./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a8f78c623d774702e75368c2fe8941228db282ab156387541e59d18cd5f431d1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:38:59,096 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:38:59,148 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:38:59,156 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:38:59,156 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:38:59,177 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:38:59,178 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:38:59,178 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:38:59,178 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:38:59,179 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:38:59,179 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:38:59,179 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:38:59,179 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:38:59,180 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:38:59,180 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:38:59,180 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:38:59,180 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:38:59,180 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:38:59,181 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:38:59,181 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:38:59,181 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:38:59,181 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:38:59,181 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:38:59,181 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:38:59,181 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:38:59,181 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:38:59,181 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:38:59,181 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:38:59,181 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:38:59,182 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:38:59,182 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:38:59,182 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:38:59,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:38:59,182 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:38:59,182 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:38:59,182 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:38:59,182 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:38:59,183 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:38:59,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:38:59,183 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:38:59,183 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:38:59,183 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:38:59,183 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:38:59,183 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a8f78c623d774702e75368c2fe8941228db282ab156387541e59d18cd5f431d1 [2025-03-04 00:38:59,419 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:38:59,427 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:38:59,429 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:38:59,430 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:38:59,430 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:38:59,432 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-1.i [2025-03-04 00:39:00,538 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e55cba89f/480587604d824c8495759e14d6965f7d/FLAG00dee65b1 [2025-03-04 00:39:00,821 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:39:00,822 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-1.i [2025-03-04 00:39:00,831 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e55cba89f/480587604d824c8495759e14d6965f7d/FLAG00dee65b1 [2025-03-04 00:39:01,116 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e55cba89f/480587604d824c8495759e14d6965f7d [2025-03-04 00:39:01,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:39:01,120 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:39:01,122 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:39:01,122 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:39:01,126 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:39:01,127 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:39:01" (1/1) ... [2025-03-04 00:39:01,127 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bcca7a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:39:01, skipping insertion in model container [2025-03-04 00:39:01,128 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:39:01" (1/1) ... [2025-03-04 00:39:01,145 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:39:01,255 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-1.i[914,927] [2025-03-04 00:39:01,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:39:01,327 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:39:01,334 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-1.i[914,927] [2025-03-04 00:39:01,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:39:01,386 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:39:01,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:39:01 WrapperNode [2025-03-04 00:39:01,388 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:39:01,389 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:39:01,389 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:39:01,389 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:39:01,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:39:01" (1/1) ... [2025-03-04 00:39:01,405 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:39:01" (1/1) ... [2025-03-04 00:39:01,427 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 150 [2025-03-04 00:39:01,432 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:39:01,433 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:39:01,433 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:39:01,433 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:39:01,439 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:39:01" (1/1) ... [2025-03-04 00:39:01,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:39:01" (1/1) ... [2025-03-04 00:39:01,446 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:39:01" (1/1) ... [2025-03-04 00:39:01,465 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:39:01,465 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:39:01" (1/1) ... [2025-03-04 00:39:01,466 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:39:01" (1/1) ... [2025-03-04 00:39:01,472 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:39:01" (1/1) ... [2025-03-04 00:39:01,476 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:39:01" (1/1) ... [2025-03-04 00:39:01,480 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:39:01" (1/1) ... [2025-03-04 00:39:01,483 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:39:01" (1/1) ... [2025-03-04 00:39:01,485 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:39:01,487 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:39:01,488 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:39:01,488 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:39:01,489 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:39:01" (1/1) ... [2025-03-04 00:39:01,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:39:01,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:39:01,517 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:39:01,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:39:01,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:39:01,534 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:39:01,534 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:39:01,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:39:01,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:39:01,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:39:01,590 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:39:01,591 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:39:01,828 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-04 00:39:01,828 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:39:01,837 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:39:01,839 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:39:01,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:39:01 BoogieIcfgContainer [2025-03-04 00:39:01,839 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:39:01,841 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:39:01,842 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:39:01,845 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:39:01,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:39:01" (1/3) ... [2025-03-04 00:39:01,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26db3f62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:39:01, skipping insertion in model container [2025-03-04 00:39:01,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:39:01" (2/3) ... [2025-03-04 00:39:01,846 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26db3f62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:39:01, skipping insertion in model container [2025-03-04 00:39:01,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:39:01" (3/3) ... [2025-03-04 00:39:01,847 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-1.i [2025-03-04 00:39:01,858 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:39:01,859 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount50_file-1.i that has 2 procedures, 67 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:39:01,900 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:39:01,911 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@118ea51a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:39:01,911 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:39:01,915 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 42 states have internal predecessors, (55), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 00:39:01,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-04 00:39:01,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:39:01,925 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:39:01,926 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:39:01,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:39:01,929 INFO L85 PathProgramCache]: Analyzing trace with hash 698509192, now seen corresponding path program 1 times [2025-03-04 00:39:01,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:39:01,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52108598] [2025-03-04 00:39:01,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:39:01,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:39:02,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 00:39:02,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 00:39:02,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:39:02,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:39:02,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-04 00:39:02,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:39:02,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52108598] [2025-03-04 00:39:02,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52108598] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:39:02,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478270322] [2025-03-04 00:39:02,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:39:02,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:39:02,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:39:02,187 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:39:02,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 00:39:02,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 00:39:02,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 00:39:02,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:39:02,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:39:02,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:39:02,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:39:02,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-04 00:39:02,385 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:39:02,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478270322] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:39:02,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:39:02,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:39:02,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186132459] [2025-03-04 00:39:02,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:39:02,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:39:02,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:39:02,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:39:02,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:39:02,407 INFO L87 Difference]: Start difference. First operand has 67 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 42 states have internal predecessors, (55), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 00:39:02,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:39:02,425 INFO L93 Difference]: Finished difference Result 128 states and 220 transitions. [2025-03-04 00:39:02,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:39:02,426 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 146 [2025-03-04 00:39:02,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:39:02,433 INFO L225 Difference]: With dead ends: 128 [2025-03-04 00:39:02,433 INFO L226 Difference]: Without dead ends: 64 [2025-03-04 00:39:02,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:39:02,438 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:39:02,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:39:02,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-04 00:39:02,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-04 00:39:02,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 39 states have internal predecessors, (49), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 00:39:02,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 95 transitions. [2025-03-04 00:39:02,467 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 95 transitions. Word has length 146 [2025-03-04 00:39:02,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:39:02,468 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 95 transitions. [2025-03-04 00:39:02,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 00:39:02,468 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 95 transitions. [2025-03-04 00:39:02,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-04 00:39:02,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:39:02,474 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:39:02,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:39:02,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 00:39:02,679 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:39:02,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:39:02,680 INFO L85 PathProgramCache]: Analyzing trace with hash 62823816, now seen corresponding path program 1 times [2025-03-04 00:39:02,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:39:02,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642347980] [2025-03-04 00:39:02,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:39:02,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:39:02,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 00:39:02,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 00:39:02,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:39:02,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:39:03,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 00:39:03,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:39:03,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642347980] [2025-03-04 00:39:03,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642347980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:39:03,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:39:03,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:39:03,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16893603] [2025-03-04 00:39:03,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:39:03,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:39:03,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:39:03,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:39:03,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:39:03,168 INFO L87 Difference]: Start difference. First operand 64 states and 95 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 00:39:03,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:39:03,207 INFO L93 Difference]: Finished difference Result 186 states and 279 transitions. [2025-03-04 00:39:03,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:39:03,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 146 [2025-03-04 00:39:03,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:39:03,212 INFO L225 Difference]: With dead ends: 186 [2025-03-04 00:39:03,212 INFO L226 Difference]: Without dead ends: 125 [2025-03-04 00:39:03,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:39:03,214 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 43 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:39:03,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 186 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:39:03,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-04 00:39:03,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2025-03-04 00:39:03,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 74 states have internal predecessors, (93), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 00:39:03,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 185 transitions. [2025-03-04 00:39:03,242 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 185 transitions. Word has length 146 [2025-03-04 00:39:03,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:39:03,243 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 185 transitions. [2025-03-04 00:39:03,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 00:39:03,244 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 185 transitions. [2025-03-04 00:39:03,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 00:39:03,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:39:03,246 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:39:03,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:39:03,247 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:39:03,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:39:03,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1207733308, now seen corresponding path program 1 times [2025-03-04 00:39:03,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:39:03,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69857614] [2025-03-04 00:39:03,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:39:03,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:39:03,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 00:39:03,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 00:39:03,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:39:03,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:39:03,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 00:39:03,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:39:03,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69857614] [2025-03-04 00:39:03,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69857614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:39:03,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:39:03,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 00:39:03,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521847711] [2025-03-04 00:39:03,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:39:03,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 00:39:03,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:39:03,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 00:39:03,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:39:03,704 INFO L87 Difference]: Start difference. First operand 123 states and 185 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 00:39:04,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:39:04,388 INFO L93 Difference]: Finished difference Result 399 states and 581 transitions. [2025-03-04 00:39:04,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:39:04,389 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 147 [2025-03-04 00:39:04,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:39:04,393 INFO L225 Difference]: With dead ends: 399 [2025-03-04 00:39:04,394 INFO L226 Difference]: Without dead ends: 338 [2025-03-04 00:39:04,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-03-04 00:39:04,397 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 288 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:39:04,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 319 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 00:39:04,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-03-04 00:39:04,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 153. [2025-03-04 00:39:04,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 102 states have (on average 1.2843137254901962) internal successors, (131), 102 states have internal predecessors, (131), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 00:39:04,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 223 transitions. [2025-03-04 00:39:04,446 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 223 transitions. Word has length 147 [2025-03-04 00:39:04,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:39:04,446 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 223 transitions. [2025-03-04 00:39:04,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 00:39:04,447 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 223 transitions. [2025-03-04 00:39:04,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 00:39:04,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:39:04,448 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:39:04,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:39:04,449 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:39:04,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:39:04,449 INFO L85 PathProgramCache]: Analyzing trace with hash 2035334332, now seen corresponding path program 1 times [2025-03-04 00:39:04,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:39:04,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460384321] [2025-03-04 00:39:04,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:39:04,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:39:04,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 00:39:04,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 00:39:04,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:39:04,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:39:04,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 00:39:04,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:39:04,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460384321] [2025-03-04 00:39:04,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460384321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:39:04,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:39:04,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:39:04,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682725656] [2025-03-04 00:39:04,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:39:04,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:39:04,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:39:04,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:39:04,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:39:04,625 INFO L87 Difference]: Start difference. First operand 153 states and 223 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 00:39:04,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:39:04,796 INFO L93 Difference]: Finished difference Result 419 states and 611 transitions. [2025-03-04 00:39:04,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:39:04,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 147 [2025-03-04 00:39:04,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:39:04,799 INFO L225 Difference]: With dead ends: 419 [2025-03-04 00:39:04,799 INFO L226 Difference]: Without dead ends: 269 [2025-03-04 00:39:04,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:39:04,800 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 83 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:39:04,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 327 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:39:04,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-03-04 00:39:04,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 153. [2025-03-04 00:39:04,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 102 states have (on average 1.2450980392156863) internal successors, (127), 102 states have internal predecessors, (127), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 00:39:04,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 219 transitions. [2025-03-04 00:39:04,832 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 219 transitions. Word has length 147 [2025-03-04 00:39:04,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:39:04,832 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 219 transitions. [2025-03-04 00:39:04,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 00:39:04,832 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 219 transitions. [2025-03-04 00:39:04,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 00:39:04,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:39:04,834 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:39:04,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:39:04,834 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:39:04,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:39:04,835 INFO L85 PathProgramCache]: Analyzing trace with hash -589218051, now seen corresponding path program 1 times [2025-03-04 00:39:04,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:39:04,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789782000] [2025-03-04 00:39:04,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:39:04,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:39:04,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 00:39:04,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 00:39:04,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:39:04,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:39:05,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 00:39:05,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:39:05,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789782000] [2025-03-04 00:39:05,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789782000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:39:05,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:39:05,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 00:39:05,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97164917] [2025-03-04 00:39:05,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:39:05,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:39:05,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:39:05,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:39:05,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:39:05,127 INFO L87 Difference]: Start difference. First operand 153 states and 219 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 00:39:05,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:39:05,477 INFO L93 Difference]: Finished difference Result 315 states and 451 transitions. [2025-03-04 00:39:05,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 00:39:05,479 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 147 [2025-03-04 00:39:05,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:39:05,481 INFO L225 Difference]: With dead ends: 315 [2025-03-04 00:39:05,481 INFO L226 Difference]: Without dead ends: 239 [2025-03-04 00:39:05,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:39:05,482 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 200 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:39:05,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 200 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:39:05,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-03-04 00:39:05,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 153. [2025-03-04 00:39:05,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 102 states have (on average 1.2450980392156863) internal successors, (127), 102 states have internal predecessors, (127), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 00:39:05,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 219 transitions. [2025-03-04 00:39:05,520 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 219 transitions. Word has length 147 [2025-03-04 00:39:05,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:39:05,520 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 219 transitions. [2025-03-04 00:39:05,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 00:39:05,520 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 219 transitions. [2025-03-04 00:39:05,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 00:39:05,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:39:05,523 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:39:05,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:39:05,523 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:39:05,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:39:05,526 INFO L85 PathProgramCache]: Analyzing trace with hash 238382973, now seen corresponding path program 1 times [2025-03-04 00:39:05,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:39:05,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287284762] [2025-03-04 00:39:05,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:39:05,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:39:05,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 00:39:05,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 00:39:05,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:39:05,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:39:05,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [960301526] [2025-03-04 00:39:05,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:39:05,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:39:05,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:39:05,589 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:39:05,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 00:39:05,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 00:39:05,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 00:39:05,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:39:05,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:39:05,710 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:39:05,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 00:39:05,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 00:39:05,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:39:05,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:39:05,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:39:05,821 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:39:05,822 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:39:05,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 00:39:06,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 00:39:06,026 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-04 00:39:06,114 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:39:06,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:39:06 BoogieIcfgContainer [2025-03-04 00:39:06,117 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:39:06,118 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:39:06,118 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:39:06,118 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:39:06,119 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:39:01" (3/4) ... [2025-03-04 00:39:06,120 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:39:06,121 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:39:06,121 INFO L158 Benchmark]: Toolchain (without parser) took 5001.36ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 105.9MB in the beginning and 155.1MB in the end (delta: -49.1MB). Peak memory consumption was 94.0MB. Max. memory is 16.1GB. [2025-03-04 00:39:06,122 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:39:06,122 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.54ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 91.8MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 00:39:06,122 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.73ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 88.3MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:39:06,122 INFO L158 Benchmark]: Boogie Preprocessor took 53.26ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 84.9MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:39:06,123 INFO L158 Benchmark]: IcfgBuilder took 352.26ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 64.9MB in the end (delta: 19.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 00:39:06,123 INFO L158 Benchmark]: TraceAbstraction took 4275.82ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 64.1MB in the beginning and 155.1MB in the end (delta: -91.1MB). Peak memory consumption was 52.0MB. Max. memory is 16.1GB. [2025-03-04 00:39:06,123 INFO L158 Benchmark]: Witness Printer took 3.05ms. Allocated memory is still 285.2MB. Free memory was 155.1MB in the beginning and 155.1MB in the end (delta: 87.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:39:06,124 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 266.54ms. Allocated memory is still 142.6MB. Free memory was 105.9MB in the beginning and 91.8MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.73ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 88.3MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 53.26ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 84.9MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 352.26ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 64.9MB in the end (delta: 19.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4275.82ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 64.1MB in the beginning and 155.1MB in the end (delta: -91.1MB). Peak memory consumption was 52.0MB. Max. memory is 16.1GB. * Witness Printer took 3.05ms. Allocated memory is still 285.2MB. Free memory was 155.1MB in the beginning and 155.1MB in the end (delta: 87.7kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of someBinaryFLOATComparisonOperation at line 102, overapproximation of someBinaryFLOATComparisonOperation at line 134, overapproximation of someBinaryDOUBLEComparisonOperation at line 134, overapproximation of someBinaryDOUBLEComparisonOperation at line 95. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 64; [L23] double var_1_6 = 31.5; [L24] double var_1_9 = 1000000000.25; [L25] float var_1_10 = 1.1; [L26] float var_1_11 = 8.75; [L27] float var_1_12 = 63.8; [L28] unsigned char var_1_13 = 1; [L29] float var_1_14 = 127.5; [L30] signed char var_1_15 = -2; [L31] signed char var_1_16 = 1; [L32] signed char var_1_17 = 1; [L33] signed char var_1_18 = 1; [L34] signed char var_1_19 = -2; [L35] signed char var_1_20 = 16; [L36] signed char var_1_21 = 2; [L37] signed char var_1_22 = 8; [L38] unsigned char var_1_23 = 0; [L39] unsigned char var_1_24 = 0; [L40] unsigned char var_1_25 = 0; [L41] unsigned char var_1_26 = 0; [L42] unsigned char var_1_27 = 32; VAL [isInitial=0, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2, var_1_9=4000000001/4] [L138] isInitial = 1 [L139] FCALL initially() [L140] COND TRUE 1 [L141] FCALL updateLastVariables() [L142] CALL updateVariables() [L94] var_1_9 = __VERIFIER_nondet_double() [L95] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L95] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L96] var_1_11 = __VERIFIER_nondet_float() [L97] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L97] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L98] var_1_13 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L99] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L100] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L100] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L101] var_1_14 = __VERIFIER_nondet_float() [L102] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L102] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L103] var_1_16 = __VERIFIER_nondet_char() [L104] CALL assume_abort_if_not(var_1_16 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L104] RET assume_abort_if_not(var_1_16 >= -1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L105] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L105] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L106] var_1_17 = __VERIFIER_nondet_char() [L107] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L107] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L108] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L108] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L109] var_1_19 = __VERIFIER_nondet_char() [L110] CALL assume_abort_if_not(var_1_19 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L110] RET assume_abort_if_not(var_1_19 >= -63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L111] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L111] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L112] var_1_20 = __VERIFIER_nondet_char() [L113] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=63, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=63, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L113] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=63, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L114] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=63, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=63, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L114] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=63, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L115] var_1_21 = __VERIFIER_nondet_char() [L116] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L116] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L117] CALL assume_abort_if_not(var_1_21 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L117] RET assume_abort_if_not(var_1_21 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L118] var_1_22 = __VERIFIER_nondet_char() [L119] CALL assume_abort_if_not(var_1_22 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L119] RET assume_abort_if_not(var_1_22 >= -63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L120] CALL assume_abort_if_not(var_1_22 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L120] RET assume_abort_if_not(var_1_22 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L121] var_1_24 = __VERIFIER_nondet_uchar() [L122] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L122] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L123] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L123] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L124] var_1_25 = __VERIFIER_nondet_uchar() [L125] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_26=0, var_1_27=32, var_1_6=63/2] [L125] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_26=0, var_1_27=32, var_1_6=63/2] [L126] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L126] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_6=63/2] [L127] var_1_26 = __VERIFIER_nondet_uchar() [L128] CALL assume_abort_if_not(var_1_26 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_6=63/2] [L128] RET assume_abort_if_not(var_1_26 >= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_6=63/2] [L129] CALL assume_abort_if_not(var_1_26 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_6=63/2] [L129] RET assume_abort_if_not(var_1_26 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_6=63/2] [L142] RET updateVariables() [L143] CALL step() [L46] var_1_15 = (var_1_16 - var_1_17) [L47] var_1_27 = var_1_21 [L48] unsigned char stepLocal_1 = var_1_27; [L49] unsigned char stepLocal_0 = var_1_27; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=64, var_1_20=63, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L50] COND TRUE (var_1_27 + var_1_27) <= stepLocal_1 [L51] var_1_1 = (128 + var_1_27) VAL [isInitial=1, stepLocal_0=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=128, var_1_20=63, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L59] COND FALSE !(var_1_27 < (var_1_27 - var_1_27)) VAL [isInitial=1, stepLocal_0=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=128, var_1_20=63, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L62] unsigned char stepLocal_2 = var_1_27; VAL [isInitial=1, stepLocal_0=0, stepLocal_2=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=128, var_1_20=63, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L63] COND FALSE !(var_1_27 > stepLocal_2) [L66] var_1_10 = 9.75f VAL [isInitial=1, stepLocal_0=0, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=1, var_1_19=63, var_1_1=128, var_1_20=63, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L68] COND TRUE ((((var_1_27) < (var_1_27)) ? (var_1_27) : (var_1_27))) < 25u [L69] var_1_18 = (((((var_1_19) > ((var_1_20 - var_1_21))) ? (var_1_19) : ((var_1_20 - var_1_21)))) + (((((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) < 0 ) ? -((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) : ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))))) VAL [isInitial=1, stepLocal_0=0, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=126, var_1_19=63, var_1_1=128, var_1_20=63, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L71] signed long int stepLocal_5 = ~ var_1_21; VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=126, var_1_19=63, var_1_1=128, var_1_20=63, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L72] COND FALSE !(\read(var_1_13)) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=126, var_1_19=63, var_1_1=128, var_1_20=63, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L81] unsigned char stepLocal_4 = var_1_18 >= var_1_27; [L82] unsigned char stepLocal_3 = var_1_27; VAL [isInitial=1, stepLocal_0=0, stepLocal_3=0, stepLocal_4=1, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=126, var_1_19=63, var_1_1=128, var_1_20=63, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L83] COND FALSE !(var_1_23 && stepLocal_4) VAL [isInitial=1, stepLocal_0=0, stepLocal_3=0, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=126, var_1_19=63, var_1_1=128, var_1_20=63, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L86] COND TRUE 1 >= stepLocal_3 [L87] var_1_12 = var_1_11 VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=126, var_1_19=63, var_1_1=128, var_1_20=63, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L143] RET step() [L144] CALL, EXPR property() [L134-L135] return (((((((((var_1_27 + var_1_27) <= var_1_27) ? (var_1_1 == ((signed short int) (128 + var_1_27))) : ((var_1_27 >= (var_1_27 * var_1_27)) ? (var_1_1 == ((signed short int) var_1_27)) : (var_1_1 == ((signed short int) 1)))) && ((var_1_27 < (var_1_27 - var_1_27)) ? (var_1_6 == ((double) var_1_9)) : 1)) && ((var_1_27 > var_1_27) ? (var_1_10 == ((float) (1.00000000000009E13f - var_1_11))) : (var_1_10 == ((float) 9.75f)))) && ((var_1_23 && (var_1_18 >= var_1_27)) ? (var_1_12 == ((float) var_1_11)) : ((1 >= var_1_27) ? (var_1_12 == ((float) var_1_11)) : (var_1_12 == ((float) var_1_14))))) && (var_1_15 == ((signed char) (var_1_16 - var_1_17)))) && ((((((var_1_27) < (var_1_27)) ? (var_1_27) : (var_1_27))) < 25u) ? (var_1_18 == ((signed char) (((((var_1_19) > ((var_1_20 - var_1_21))) ? (var_1_19) : ((var_1_20 - var_1_21)))) + (((((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) < 0 ) ? -((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) : ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))))))) : 1)) && (var_1_13 ? (((~ var_1_21) > var_1_27) ? (var_1_23 == ((unsigned char) (var_1_24 && (! var_1_25)))) : (var_1_24 ? (var_1_23 == ((unsigned char) ((! var_1_25) || var_1_26))) : 1)) : 1)) && (var_1_27 == ((unsigned char) var_1_21)) ; VAL [\result=0, isInitial=1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=126, var_1_19=63, var_1_1=128, var_1_20=63, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L144] RET, EXPR property() [L144] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=126, var_1_19=63, var_1_1=128, var_1_20=63, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] [L19] reach_error() VAL [isInitial=1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=126, var_1_19=63, var_1_1=128, var_1_20=63, var_1_21=0, var_1_22=-63, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_6=63/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 67 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 6, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 614 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 614 mSDsluCounter, 1127 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 583 mSDsCounter, 349 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 642 IncrementalHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 349 mSolverCounterUnsat, 544 mSDtfsCounter, 642 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=153occurred in iteration=3, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 389 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1173 NumberOfCodeBlocks, 1173 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 873 ConstructedInterpolants, 0 QuantifiedInterpolants, 1665 SizeOfPredicates, 0 NumberOfNonLiveVariables, 338 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 6028/6072 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 00:39:06,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a8f78c623d774702e75368c2fe8941228db282ab156387541e59d18cd5f431d1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:39:08,040 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:39:08,143 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:39:08,150 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:39:08,151 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:39:08,174 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:39:08,175 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:39:08,175 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:39:08,175 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:39:08,176 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:39:08,176 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:39:08,176 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:39:08,177 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:39:08,177 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:39:08,177 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:39:08,177 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:39:08,177 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:39:08,177 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:39:08,177 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:39:08,177 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:39:08,177 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:39:08,177 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:39:08,177 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:39:08,177 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:39:08,177 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:39:08,177 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:39:08,177 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:39:08,177 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:39:08,178 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:39:08,178 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:39:08,178 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:39:08,178 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:39:08,178 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:39:08,178 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:39:08,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:39:08,178 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:39:08,178 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:39:08,178 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:39:08,178 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:39:08,178 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:39:08,178 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:39:08,178 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:39:08,178 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:39:08,178 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:39:08,178 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:39:08,178 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a8f78c623d774702e75368c2fe8941228db282ab156387541e59d18cd5f431d1 [2025-03-04 00:39:08,407 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:39:08,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:39:08,416 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:39:08,417 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:39:08,418 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:39:08,419 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-1.i [2025-03-04 00:39:09,574 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83eb12605/931deded780443f8a709c6032a15eabd/FLAG8139d10be [2025-03-04 00:39:09,807 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:39:09,808 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-1.i [2025-03-04 00:39:09,818 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83eb12605/931deded780443f8a709c6032a15eabd/FLAG8139d10be [2025-03-04 00:39:09,833 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83eb12605/931deded780443f8a709c6032a15eabd [2025-03-04 00:39:09,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:39:09,836 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:39:09,838 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:39:09,839 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:39:09,842 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:39:09,842 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:39:09" (1/1) ... [2025-03-04 00:39:09,844 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fd45b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:39:09, skipping insertion in model container [2025-03-04 00:39:09,845 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:39:09" (1/1) ... [2025-03-04 00:39:09,859 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:39:09,953 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-1.i[914,927] [2025-03-04 00:39:09,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:39:09,999 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:39:10,008 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-1.i[914,927] [2025-03-04 00:39:10,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:39:10,044 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:39:10,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:39:10 WrapperNode [2025-03-04 00:39:10,045 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:39:10,046 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:39:10,046 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:39:10,046 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:39:10,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:39:10" (1/1) ... [2025-03-04 00:39:10,060 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:39:10" (1/1) ... [2025-03-04 00:39:10,088 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 144 [2025-03-04 00:39:10,088 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:39:10,093 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:39:10,093 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:39:10,093 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:39:10,103 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:39:10" (1/1) ... [2025-03-04 00:39:10,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:39:10" (1/1) ... [2025-03-04 00:39:10,107 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:39:10" (1/1) ... [2025-03-04 00:39:10,120 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:39:10,120 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:39:10" (1/1) ... [2025-03-04 00:39:10,120 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:39:10" (1/1) ... [2025-03-04 00:39:10,133 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:39:10" (1/1) ... [2025-03-04 00:39:10,134 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:39:10" (1/1) ... [2025-03-04 00:39:10,140 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:39:10" (1/1) ... [2025-03-04 00:39:10,141 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:39:10" (1/1) ... [2025-03-04 00:39:10,146 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:39:10,146 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:39:10,146 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:39:10,147 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:39:10,151 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:39:10" (1/1) ... [2025-03-04 00:39:10,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:39:10,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:39:10,179 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:39:10,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:39:10,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:39:10,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:39:10,202 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:39:10,202 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:39:10,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:39:10,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:39:10,264 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:39:10,266 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:39:10,584 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-04 00:39:10,587 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:39:10,595 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:39:10,595 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:39:10,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:39:10 BoogieIcfgContainer [2025-03-04 00:39:10,595 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:39:10,597 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:39:10,597 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:39:10,601 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:39:10,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:39:09" (1/3) ... [2025-03-04 00:39:10,603 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@beb88db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:39:10, skipping insertion in model container [2025-03-04 00:39:10,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:39:10" (2/3) ... [2025-03-04 00:39:10,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@beb88db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:39:10, skipping insertion in model container [2025-03-04 00:39:10,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:39:10" (3/3) ... [2025-03-04 00:39:10,605 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-1.i [2025-03-04 00:39:10,627 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:39:10,628 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount50_file-1.i that has 2 procedures, 67 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:39:10,677 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:39:10,686 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@f98d94f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:39:10,687 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:39:10,690 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 42 states have internal predecessors, (55), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 00:39:10,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-04 00:39:10,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:39:10,702 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:39:10,702 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:39:10,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:39:10,706 INFO L85 PathProgramCache]: Analyzing trace with hash 698509192, now seen corresponding path program 1 times [2025-03-04 00:39:10,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:39:10,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [142681856] [2025-03-04 00:39:10,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:39:10,718 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:39:10,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:39:10,720 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:39:10,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 00:39:10,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 00:39:10,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 00:39:10,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:39:10,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:39:10,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:39:10,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:39:11,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2025-03-04 00:39:11,026 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:39:11,026 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:39:11,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [142681856] [2025-03-04 00:39:11,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [142681856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:39:11,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:39:11,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:39:11,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367490841] [2025-03-04 00:39:11,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:39:11,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:39:11,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:39:11,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:39:11,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:39:11,051 INFO L87 Difference]: Start difference. First operand has 67 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 42 states have internal predecessors, (55), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 00:39:11,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:39:11,073 INFO L93 Difference]: Finished difference Result 128 states and 220 transitions. [2025-03-04 00:39:11,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:39:11,075 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 146 [2025-03-04 00:39:11,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:39:11,080 INFO L225 Difference]: With dead ends: 128 [2025-03-04 00:39:11,081 INFO L226 Difference]: Without dead ends: 64 [2025-03-04 00:39:11,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:39:11,087 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:39:11,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:39:11,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-04 00:39:11,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-04 00:39:11,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 39 states have internal predecessors, (49), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 00:39:11,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 95 transitions. [2025-03-04 00:39:11,125 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 95 transitions. Word has length 146 [2025-03-04 00:39:11,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:39:11,125 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 95 transitions. [2025-03-04 00:39:11,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 00:39:11,126 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 95 transitions. [2025-03-04 00:39:11,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-04 00:39:11,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:39:11,129 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:39:11,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 00:39:11,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:39:11,330 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:39:11,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:39:11,331 INFO L85 PathProgramCache]: Analyzing trace with hash 62823816, now seen corresponding path program 1 times [2025-03-04 00:39:11,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:39:11,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [424079655] [2025-03-04 00:39:11,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:39:11,332 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:39:11,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:39:11,334 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:39:11,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-04 00:39:11,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 00:39:11,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 00:39:11,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:39:11,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:39:11,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 00:39:11,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:39:11,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 527 proven. 48 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2025-03-04 00:39:11,956 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:39:12,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 00:39:12,080 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:39:12,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [424079655] [2025-03-04 00:39:12,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [424079655] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 00:39:12,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:39:12,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2025-03-04 00:39:12,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575510890] [2025-03-04 00:39:12,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:39:12,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:39:12,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:39:12,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:39:12,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:39:12,082 INFO L87 Difference]: Start difference. First operand 64 states and 95 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 00:39:12,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:39:12,123 INFO L93 Difference]: Finished difference Result 125 states and 187 transitions. [2025-03-04 00:39:12,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:39:12,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 146 [2025-03-04 00:39:12,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:39:12,125 INFO L225 Difference]: With dead ends: 125 [2025-03-04 00:39:12,125 INFO L226 Difference]: Without dead ends: 64 [2025-03-04 00:39:12,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:39:12,126 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:39:12,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:39:12,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-04 00:39:12,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-04 00:39:12,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 00:39:12,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 94 transitions. [2025-03-04 00:39:12,132 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 94 transitions. Word has length 146 [2025-03-04 00:39:12,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:39:12,133 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 94 transitions. [2025-03-04 00:39:12,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 00:39:12,134 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 94 transitions. [2025-03-04 00:39:12,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-04 00:39:12,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:39:12,135 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:39:12,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-04 00:39:12,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:39:12,336 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:39:12,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:39:12,336 INFO L85 PathProgramCache]: Analyzing trace with hash -133689689, now seen corresponding path program 1 times [2025-03-04 00:39:12,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:39:12,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1729279880] [2025-03-04 00:39:12,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:39:12,337 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:39:12,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:39:12,339 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:39:12,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-04 00:39:12,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-04 00:39:12,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 00:39:12,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:39:12,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:39:12,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 00:39:12,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:39:12,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 00:39:12,761 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:39:12,761 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:39:12,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1729279880] [2025-03-04 00:39:12,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1729279880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:39:12,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:39:12,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:39:12,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278756393] [2025-03-04 00:39:12,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:39:12,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:39:12,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:39:12,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:39:12,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:39:12,762 INFO L87 Difference]: Start difference. First operand 64 states and 94 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 00:39:12,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:39:12,813 INFO L93 Difference]: Finished difference Result 186 states and 276 transitions. [2025-03-04 00:39:12,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:39:12,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 146 [2025-03-04 00:39:12,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:39:12,817 INFO L225 Difference]: With dead ends: 186 [2025-03-04 00:39:12,818 INFO L226 Difference]: Without dead ends: 125 [2025-03-04 00:39:12,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:39:12,819 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 16 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:39:12,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 184 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:39:12,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-04 00:39:12,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2025-03-04 00:39:12,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 74 states have (on average 1.2297297297297298) internal successors, (91), 74 states have internal predecessors, (91), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-04 00:39:12,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 183 transitions. [2025-03-04 00:39:12,842 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 183 transitions. Word has length 146 [2025-03-04 00:39:12,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:39:12,842 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 183 transitions. [2025-03-04 00:39:12,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 00:39:12,842 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 183 transitions. [2025-03-04 00:39:12,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 00:39:12,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:39:12,847 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:39:12,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-04 00:39:13,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:39:13,047 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:39:13,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:39:13,048 INFO L85 PathProgramCache]: Analyzing trace with hash -589218051, now seen corresponding path program 1 times [2025-03-04 00:39:13,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:39:13,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [786665427] [2025-03-04 00:39:13,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:39:13,048 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:39:13,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:39:13,051 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:39:13,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-04 00:39:13,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 00:39:13,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 00:39:13,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:39:13,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:39:13,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 00:39:13,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:39:13,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 516 proven. 27 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2025-03-04 00:39:13,353 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:39:13,403 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:39:13,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [786665427] [2025-03-04 00:39:13,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [786665427] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:39:13,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1797273242] [2025-03-04 00:39:13,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:39:13,404 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 00:39:13,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 00:39:13,427 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 00:39:13,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-03-04 00:39:13,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 00:39:13,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 00:39:13,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:39:13,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:39:13,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 00:39:13,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:39:14,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-04 00:39:14,018 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:39:14,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1797273242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:39:14,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:39:14,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2025-03-04 00:39:14,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603153577] [2025-03-04 00:39:14,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:39:14,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:39:14,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:39:14,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:39:14,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:39:14,019 INFO L87 Difference]: Start difference. First operand 123 states and 183 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 00:39:14,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:39:14,464 INFO L93 Difference]: Finished difference Result 309 states and 449 transitions. [2025-03-04 00:39:14,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:39:14,466 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 147 [2025-03-04 00:39:14,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:39:14,468 INFO L225 Difference]: With dead ends: 309 [2025-03-04 00:39:14,468 INFO L226 Difference]: Without dead ends: 248 [2025-03-04 00:39:14,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-04 00:39:14,473 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 160 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:39:14,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 303 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:39:14,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-04 00:39:14,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 167. [2025-03-04 00:39:14,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 103 states have (on average 1.203883495145631) internal successors, (124), 104 states have internal predecessors, (124), 59 states have call successors, (59), 4 states have call predecessors, (59), 4 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-04 00:39:14,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 242 transitions. [2025-03-04 00:39:14,508 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 242 transitions. Word has length 147 [2025-03-04 00:39:14,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:39:14,509 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 242 transitions. [2025-03-04 00:39:14,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-04 00:39:14,509 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 242 transitions. [2025-03-04 00:39:14,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-04 00:39:14,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:39:14,512 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:39:14,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-04 00:39:14,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2025-03-04 00:39:14,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-04 00:39:14,913 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:39:14,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:39:14,914 INFO L85 PathProgramCache]: Analyzing trace with hash 238382973, now seen corresponding path program 1 times [2025-03-04 00:39:14,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:39:14,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1510586671] [2025-03-04 00:39:14,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:39:14,914 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:39:14,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:39:14,916 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:39:14,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-04 00:39:14,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-04 00:39:15,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-04 00:39:15,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:39:15,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:39:15,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 00:39:15,061 INFO L279 TraceCheckSpWp]: Computing forward predicates...