./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-40.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_fillercode_fillercodesize_ps-cn-25_file-40.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 83e6a5fc52c7b932388db74a3265271ec19421eb7c3c3913e89558f5e921b8d3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:57:40,404 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:57:40,453 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:57:40,458 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:57:40,458 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:57:40,482 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:57:40,483 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:57:40,484 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:57:40,484 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:57:40,484 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:57:40,485 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:57:40,485 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:57:40,485 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:57:40,485 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:57:40,486 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:57:40,486 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:57:40,486 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:57:40,486 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:57:40,486 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:57:40,486 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:57:40,486 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:57:40,486 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:57:40,486 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:57:40,487 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:57:40,487 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:57:40,487 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:57:40,487 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:57:40,487 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:57:40,487 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:57:40,487 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:57:40,487 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:57:40,487 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:57:40,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:57:40,488 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:57:40,488 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:57:40,488 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:57:40,488 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:57:40,488 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:57:40,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:57:40,488 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:57:40,488 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:57:40,488 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:57:40,488 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:57:40,488 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 -> 83e6a5fc52c7b932388db74a3265271ec19421eb7c3c3913e89558f5e921b8d3 [2025-03-03 19:57:40,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:57:40,726 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:57:40,728 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:57:40,730 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:57:40,730 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:57:40,731 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-40.i [2025-03-03 19:57:41,876 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf7ec3a1c/02f71e9f017041648839b068077a2e98/FLAGfc9c1a8c2 [2025-03-03 19:57:42,103 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:57:42,104 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-40.i [2025-03-03 19:57:42,115 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf7ec3a1c/02f71e9f017041648839b068077a2e98/FLAGfc9c1a8c2 [2025-03-03 19:57:42,446 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf7ec3a1c/02f71e9f017041648839b068077a2e98 [2025-03-03 19:57:42,448 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:57:42,449 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:57:42,450 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:57:42,450 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:57:42,452 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:57:42,453 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:57:42" (1/1) ... [2025-03-03 19:57:42,454 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f13129e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:57:42, skipping insertion in model container [2025-03-03 19:57:42,454 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:57:42" (1/1) ... [2025-03-03 19:57:42,470 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:57:42,570 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_fillercode_fillercodesize_ps-cn-25_file-40.i[915,928] [2025-03-03 19:57:42,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:57:42,620 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:57:42,627 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_fillercode_fillercodesize_ps-cn-25_file-40.i[915,928] [2025-03-03 19:57:42,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:57:42,669 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:57:42,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:57:42 WrapperNode [2025-03-03 19:57:42,670 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:57:42,671 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:57:42,671 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:57:42,671 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:57:42,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:57:42" (1/1) ... [2025-03-03 19:57:42,684 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:57:42" (1/1) ... [2025-03-03 19:57:42,714 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 165 [2025-03-03 19:57:42,714 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:57:42,715 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:57:42,715 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:57:42,715 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:57:42,723 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:57:42" (1/1) ... [2025-03-03 19:57:42,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:57:42" (1/1) ... [2025-03-03 19:57:42,727 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:57:42" (1/1) ... [2025-03-03 19:57:42,746 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-03 19:57:42,747 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:57:42" (1/1) ... [2025-03-03 19:57:42,747 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:57:42" (1/1) ... [2025-03-03 19:57:42,757 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:57:42" (1/1) ... [2025-03-03 19:57:42,759 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:57:42" (1/1) ... [2025-03-03 19:57:42,760 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:57:42" (1/1) ... [2025-03-03 19:57:42,763 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:57:42" (1/1) ... [2025-03-03 19:57:42,767 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:57:42,768 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:57:42,769 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:57:42,769 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:57:42,770 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:57:42" (1/1) ... [2025-03-03 19:57:42,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:57:42,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:57:42,798 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-03 19:57:42,801 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-03 19:57:42,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:57:42,818 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:57:42,819 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:57:42,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:57:42,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:57:42,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:57:42,884 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:57:42,886 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:57:43,205 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-03 19:57:43,205 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:57:43,217 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:57:43,218 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:57:43,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:57:43 BoogieIcfgContainer [2025-03-03 19:57:43,219 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:57:43,222 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:57:43,222 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:57:43,225 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:57:43,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:57:42" (1/3) ... [2025-03-03 19:57:43,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@722c493e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:57:43, skipping insertion in model container [2025-03-03 19:57:43,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:57:42" (2/3) ... [2025-03-03 19:57:43,227 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@722c493e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:57:43, skipping insertion in model container [2025-03-03 19:57:43,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:57:43" (3/3) ... [2025-03-03 19:57:43,228 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-40.i [2025-03-03 19:57:43,238 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:57:43,239 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-40.i that has 2 procedures, 72 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:57:43,280 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:57:43,292 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;@75ea0f06, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:57:43,293 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:57:43,297 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 46 states have (on average 1.391304347826087) internal successors, (64), 47 states have internal predecessors, (64), 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-03 19:57:43,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 19:57:43,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:57:43,307 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, 1, 1, 1, 1] [2025-03-03 19:57:43,308 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:57:43,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:57:43,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1812749528, now seen corresponding path program 1 times [2025-03-03 19:57:43,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:57:43,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942239671] [2025-03-03 19:57:43,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:57:43,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:57:43,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 19:57:43,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 19:57:43,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:57:43,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:57:43,579 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-03 19:57:43,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:57:43,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942239671] [2025-03-03 19:57:43,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942239671] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:57:43,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560553147] [2025-03-03 19:57:43,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:57:43,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:57:43,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:57:43,584 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-03 19:57:43,586 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-03 19:57:43,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 19:57:43,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 19:57:43,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:57:43,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:57:43,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:57:43,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:57:43,783 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-03 19:57:43,786 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:57:43,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560553147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:57:43,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:57:43,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:57:43,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104369869] [2025-03-03 19:57:43,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:57:43,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:57:43,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:57:43,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:57:43,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:57:43,811 INFO L87 Difference]: Start difference. First operand has 72 states, 46 states have (on average 1.391304347826087) internal successors, (64), 47 states have internal predecessors, (64), 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 20.5) internal successors, (41), 2 states have internal predecessors, (41), 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-03 19:57:43,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:57:43,835 INFO L93 Difference]: Finished difference Result 138 states and 238 transitions. [2025-03-03 19:57:43,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:57:43,837 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 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 151 [2025-03-03 19:57:43,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:57:43,843 INFO L225 Difference]: With dead ends: 138 [2025-03-03 19:57:43,844 INFO L226 Difference]: Without dead ends: 69 [2025-03-03 19:57:43,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 152 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-03 19:57:43,851 INFO L435 NwaCegarLoop]: 104 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, 104 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-03 19:57:43,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:57:43,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-03 19:57:43,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-03 19:57:43,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 44 states have internal predecessors, (58), 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-03 19:57:43,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 104 transitions. [2025-03-03 19:57:43,893 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 104 transitions. Word has length 151 [2025-03-03 19:57:43,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:57:43,894 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 104 transitions. [2025-03-03 19:57:43,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 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-03 19:57:43,894 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 104 transitions. [2025-03-03 19:57:43,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 19:57:43,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:57:43,896 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, 1, 1, 1, 1, 1] [2025-03-03 19:57:43,904 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-03 19:57:44,097 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-03 19:57:44,097 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:57:44,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:57:44,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1844224194, now seen corresponding path program 1 times [2025-03-03 19:57:44,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:57:44,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871699208] [2025-03-03 19:57:44,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:57:44,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:57:44,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 19:57:44,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 19:57:44,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:57:44,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:57:44,383 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-03 19:57:44,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:57:44,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871699208] [2025-03-03 19:57:44,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871699208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:57:44,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:57:44,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:57:44,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251504692] [2025-03-03 19:57:44,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:57:44,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:57:44,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:57:44,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:57:44,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:57:44,386 INFO L87 Difference]: Start difference. First operand 69 states and 104 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-03 19:57:44,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:57:44,411 INFO L93 Difference]: Finished difference Result 135 states and 205 transitions. [2025-03-03 19:57:44,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:57:44,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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 152 [2025-03-03 19:57:44,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:57:44,415 INFO L225 Difference]: With dead ends: 135 [2025-03-03 19:57:44,415 INFO L226 Difference]: Without dead ends: 69 [2025-03-03 19:57:44,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-03 19:57:44,416 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:57:44,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:57:44,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-03 19:57:44,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-03 19:57:44,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 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-03 19:57:44,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 103 transitions. [2025-03-03 19:57:44,431 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 103 transitions. Word has length 152 [2025-03-03 19:57:44,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:57:44,432 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 103 transitions. [2025-03-03 19:57:44,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-03 19:57:44,432 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 103 transitions. [2025-03-03 19:57:44,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 19:57:44,434 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:57:44,434 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, 1, 1, 1, 1, 1] [2025-03-03 19:57:44,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:57:44,434 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:57:44,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:57:44,437 INFO L85 PathProgramCache]: Analyzing trace with hash -707932767, now seen corresponding path program 1 times [2025-03-03 19:57:44,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:57:44,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600845729] [2025-03-03 19:57:44,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:57:44,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:57:44,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 19:57:44,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 19:57:44,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:57:44,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:57:45,369 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-03 19:57:45,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:57:45,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600845729] [2025-03-03 19:57:45,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600845729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:57:45,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:57:45,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:57:45,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678621106] [2025-03-03 19:57:45,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:57:45,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:57:45,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:57:45,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:57:45,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:57:45,371 INFO L87 Difference]: Start difference. First operand 69 states and 103 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-03 19:57:45,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:57:45,584 INFO L93 Difference]: Finished difference Result 196 states and 285 transitions. [2025-03-03 19:57:45,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 19:57:45,586 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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 152 [2025-03-03 19:57:45,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:57:45,587 INFO L225 Difference]: With dead ends: 196 [2025-03-03 19:57:45,589 INFO L226 Difference]: Without dead ends: 130 [2025-03-03 19:57:45,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 19:57:45,591 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 101 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:57:45,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 305 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 19:57:45,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-03 19:57:45,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 102. [2025-03-03 19:57:45,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 68 states have internal predecessors, (85), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-03 19:57:45,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 149 transitions. [2025-03-03 19:57:45,603 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 149 transitions. Word has length 152 [2025-03-03 19:57:45,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:57:45,604 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 149 transitions. [2025-03-03 19:57:45,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-03 19:57:45,604 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 149 transitions. [2025-03-03 19:57:45,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 19:57:45,605 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:57:45,605 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, 1, 1, 1, 1, 1] [2025-03-03 19:57:45,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 19:57:45,606 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:57:45,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:57:45,606 INFO L85 PathProgramCache]: Analyzing trace with hash -707009246, now seen corresponding path program 1 times [2025-03-03 19:57:45,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:57:45,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217100424] [2025-03-03 19:57:45,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:57:45,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:57:45,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 19:57:45,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 19:57:45,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:57:45,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:57:45,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 24 proven. 42 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-03 19:57:45,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:57:45,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217100424] [2025-03-03 19:57:45,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217100424] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:57:45,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999619090] [2025-03-03 19:57:45,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:57:45,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:57:45,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:57:45,861 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-03 19:57:45,863 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-03 19:57:45,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 19:57:45,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 19:57:45,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:57:45,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:57:45,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 19:57:45,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:57:46,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 486 proven. 42 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2025-03-03 19:57:46,179 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:57:46,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 24 proven. 42 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-03 19:57:46,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999619090] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:57:46,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:57:46,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-03 19:57:46,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922228759] [2025-03-03 19:57:46,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:57:46,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 19:57:46,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:57:46,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 19:57:46,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:57:46,479 INFO L87 Difference]: Start difference. First operand 102 states and 149 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-03-03 19:57:46,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:57:46,639 INFO L93 Difference]: Finished difference Result 201 states and 286 transitions. [2025-03-03 19:57:46,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 19:57:46,640 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 152 [2025-03-03 19:57:46,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:57:46,643 INFO L225 Difference]: With dead ends: 201 [2025-03-03 19:57:46,643 INFO L226 Difference]: Without dead ends: 102 [2025-03-03 19:57:46,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 301 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-03 19:57:46,644 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 65 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:57:46,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 158 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:57:46,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-03 19:57:46,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 87. [2025-03-03 19:57:46,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 53 states have (on average 1.169811320754717) internal successors, (62), 54 states have internal predecessors, (62), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 19:57:46,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 122 transitions. [2025-03-03 19:57:46,668 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 122 transitions. Word has length 152 [2025-03-03 19:57:46,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:57:46,668 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 122 transitions. [2025-03-03 19:57:46,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-03-03 19:57:46,668 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 122 transitions. [2025-03-03 19:57:46,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 19:57:46,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:57:46,670 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, 1, 1, 1, 1, 1] [2025-03-03 19:57:46,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 19:57:46,875 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,SelfDestructingSolverStorable3 [2025-03-03 19:57:46,875 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:57:46,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:57:46,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1791006691, now seen corresponding path program 1 times [2025-03-03 19:57:46,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:57:46,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799095939] [2025-03-03 19:57:46,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:57:46,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:57:46,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 19:57:46,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 19:57:46,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:57:46,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 19:57:46,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [79914206] [2025-03-03 19:57:46,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:57:46,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:57:46,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:57:46,954 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:57:46,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 19:57:47,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 19:57:47,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 19:57:47,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:57:47,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:57:47,092 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 19:57:47,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 19:57:47,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 19:57:47,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:57:47,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:57:47,214 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 19:57:47,214 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 19:57:47,215 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 19:57:47,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 19:57:47,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:57:47,423 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-03 19:57:47,497 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 19:57:47,499 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 07:57:47 BoogieIcfgContainer [2025-03-03 19:57:47,500 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 19:57:47,500 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 19:57:47,500 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 19:57:47,500 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 19:57:47,501 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:57:43" (3/4) ... [2025-03-03 19:57:47,502 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 19:57:47,503 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 19:57:47,504 INFO L158 Benchmark]: Toolchain (without parser) took 5055.01ms. Allocated memory was 167.8MB in the beginning and 343.9MB in the end (delta: 176.2MB). Free memory was 123.6MB in the beginning and 138.5MB in the end (delta: -14.9MB). Peak memory consumption was 162.6MB. Max. memory is 16.1GB. [2025-03-03 19:57:47,504 INFO L158 Benchmark]: CDTParser took 0.85ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:57:47,504 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.80ms. Allocated memory is still 167.8MB. Free memory was 123.6MB in the beginning and 108.6MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 19:57:47,504 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.58ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 104.7MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:57:47,504 INFO L158 Benchmark]: Boogie Preprocessor took 52.25ms. Allocated memory is still 167.8MB. Free memory was 104.7MB in the beginning and 98.2MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 19:57:47,505 INFO L158 Benchmark]: IcfgBuilder took 451.42ms. Allocated memory is still 167.8MB. Free memory was 98.2MB in the beginning and 73.1MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 19:57:47,508 INFO L158 Benchmark]: TraceAbstraction took 4277.30ms. Allocated memory was 167.8MB in the beginning and 343.9MB in the end (delta: 176.2MB). Free memory was 73.1MB in the beginning and 138.5MB in the end (delta: -65.4MB). Peak memory consumption was 112.3MB. Max. memory is 16.1GB. [2025-03-03 19:57:47,509 INFO L158 Benchmark]: Witness Printer took 2.89ms. Allocated memory is still 343.9MB. Free memory was 138.5MB in the beginning and 138.5MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:57:47,510 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.85ms. Allocated memory is still 201.3MB. Free memory is still 116.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 220.80ms. Allocated memory is still 167.8MB. Free memory was 123.6MB in the beginning and 108.6MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.58ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 104.7MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 52.25ms. Allocated memory is still 167.8MB. Free memory was 104.7MB in the beginning and 98.2MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 451.42ms. Allocated memory is still 167.8MB. Free memory was 98.2MB in the beginning and 73.1MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4277.30ms. Allocated memory was 167.8MB in the beginning and 343.9MB in the end (delta: 176.2MB). Free memory was 73.1MB in the beginning and 138.5MB in the end (delta: -65.4MB). Peak memory consumption was 112.3MB. Max. memory is 16.1GB. * Witness Printer took 2.89ms. Allocated memory is still 343.9MB. Free memory was 138.5MB in the beginning and 138.5MB in the end (delta: 33.1kB). 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 133, overapproximation of someBinaryFLOATComparisonOperation at line 157, overapproximation of someBinaryFLOATComparisonOperation at line 141, overapproximation of someBinaryFLOATComparisonOperation at line 60, overapproximation of someUnaryDOUBLEoperation at line 35, overapproximation of someBinaryDOUBLEComparisonOperation at line 157. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 128; [L23] signed short int var_1_4 = -200; [L24] unsigned short int var_1_8 = 5; [L25] unsigned char var_1_9 = 1; [L26] unsigned char var_1_10 = 0; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 16; [L29] unsigned char var_1_15 = 50; [L30] unsigned short int var_1_16 = 1; [L31] float var_1_17 = 25.4; [L32] float var_1_20 = 1.6; [L33] unsigned short int var_1_21 = 0; [L34] float var_1_24 = 128.5; [L35] double var_1_25 = -0.5; [L36] signed long int var_1_26 = 4; [L37] signed char var_1_27 = 2; [L38] signed char var_1_28 = -16; [L39] signed char var_1_29 = 0; [L40] unsigned char var_1_30 = 0; [L41] float var_1_31 = 127.75; [L42] float var_1_32 = 15.5; [L43] unsigned long int var_1_33 = 16; [L44] signed long int var_1_34 = 256; [L45] unsigned char var_1_35 = 0; [L46] signed short int var_1_36 = 8; [L47] signed long int var_1_37 = 256; [L48] unsigned long int var_1_38 = 500; [L49] unsigned char last_1_var_1_9 = 1; [L50] float last_1_var_1_24 = 128.5; VAL [isInitial=0, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-200, var_1_8=5, var_1_9=1] [L161] isInitial = 1 [L162] FCALL initially() [L163] COND TRUE 1 [L164] CALL updateLastVariables() [L153] last_1_var_1_9 = var_1_9 [L154] last_1_var_1_24 = var_1_24 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=-200, var_1_8=5, var_1_9=1] [L164] RET updateLastVariables() [L165] CALL updateVariables() [L116] var_1_4 = __VERIFIER_nondet_short() [L117] CALL assume_abort_if_not(var_1_4 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=5, var_1_9=1] [L117] RET assume_abort_if_not(var_1_4 >= -32768) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=5, var_1_9=1] [L118] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=5, var_1_9=1] [L118] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=5, var_1_9=1] [L119] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=5, var_1_9=1] [L119] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=5, var_1_9=1] [L120] var_1_8 = __VERIFIER_nondet_ushort() [L121] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_9=1] [L121] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_9=1] [L122] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L122] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L123] var_1_10 = __VERIFIER_nondet_uchar() [L124] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L124] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L125] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L125] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L126] var_1_11 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L127] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L128] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L128] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L129] var_1_15 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L130] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L131] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L131] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L132] var_1_20 = __VERIFIER_nondet_float() [L133] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L133] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L134] var_1_28 = __VERIFIER_nondet_char() [L135] CALL assume_abort_if_not(var_1_28 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L135] RET assume_abort_if_not(var_1_28 >= -126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L136] CALL assume_abort_if_not(var_1_28 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L136] RET assume_abort_if_not(var_1_28 <= 126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L137] var_1_29 = __VERIFIER_nondet_char() [L138] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L138] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L139] CALL assume_abort_if_not(var_1_29 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L139] RET assume_abort_if_not(var_1_29 <= 126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_32=31/2, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L140] var_1_32 = __VERIFIER_nondet_float() [L141] CALL assume_abort_if_not((var_1_32 >= -922337.2036854765600e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854765600e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L141] RET assume_abort_if_not((var_1_32 >= -922337.2036854765600e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854765600e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=0, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L142] var_1_35 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L143] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L144] CALL assume_abort_if_not(var_1_35 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=1, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=1, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L144] RET assume_abort_if_not(var_1_35 <= 1) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=1, var_1_36=8, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L145] var_1_36 = __VERIFIER_nondet_short() [L146] CALL assume_abort_if_not(var_1_36 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=1, var_1_36=-1, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=1, var_1_36=-1, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L146] RET assume_abort_if_not(var_1_36 >= -1) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=1, var_1_36=-1, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L147] CALL assume_abort_if_not(var_1_36 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=1, var_1_36=-1, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=1, var_1_36=-1, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L147] RET assume_abort_if_not(var_1_36 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=1, var_1_36=-1, var_1_37=256, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L148] var_1_37 = __VERIFIER_nondet_long() [L149] CALL assume_abort_if_not(var_1_37 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L149] RET assume_abort_if_not(var_1_37 >= -2147483647) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L150] CALL assume_abort_if_not(var_1_37 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L150] RET assume_abort_if_not(var_1_37 <= 2147483646) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L165] RET updateVariables() [L166] CALL step() [L54] var_1_27 = (((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))) - var_1_29) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L55] COND TRUE -32 <= var_1_28 [L56] var_1_30 = var_1_29 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=511/4, var_1_33=16, var_1_34=256, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L58] var_1_31 = var_1_32 [L59] var_1_33 = var_1_30 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=256, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L60] COND TRUE var_1_31 > var_1_32 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=256, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L61] COND TRUE \read(var_1_35) [L62] var_1_34 = ((((var_1_30) < 0 ) ? -(var_1_30) : (var_1_30))) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=500, var_1_4=2, var_1_8=0, var_1_9=1] [L71] COND TRUE var_1_34 < var_1_37 [L72] var_1_38 = ((((var_1_30 + var_1_29) < 0 ) ? -(var_1_30 + var_1_29) : (var_1_30 + var_1_29))) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=0, var_1_4=2, var_1_8=0, var_1_9=1] [L76] COND FALSE !((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) [L83] var_1_12 = var_1_15 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=0, var_1_4=2, var_1_8=0, var_1_9=1] [L85] unsigned char stepLocal_1 = var_1_10; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_1=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=0, var_1_4=2, var_1_8=0, var_1_9=1] [L86] COND TRUE (var_1_12 != var_1_4) || stepLocal_1 [L87] var_1_9 = var_1_11 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=0, var_1_4=2, var_1_8=0, var_1_9=0] [L89] var_1_26 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=2, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=0, var_1_4=2, var_1_8=0, var_1_9=0] [L90] COND FALSE !((var_1_9 && var_1_11) && var_1_9) [L93] var_1_21 = ((23370 - var_1_15) + var_1_12) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=2, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=0, var_1_4=2, var_1_8=0, var_1_9=0] [L95] signed long int stepLocal_2 = -4; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=2, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=0, var_1_4=2, var_1_8=0, var_1_9=0] [L96] COND FALSE !(! (-4 < var_1_12)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=2, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=0, var_1_4=2, var_1_8=0, var_1_9=0] [L99] COND FALSE !(stepLocal_2 > var_1_21) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=2, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=0, var_1_4=2, var_1_8=0, var_1_9=0] [L103] var_1_16 = (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15))) [L104] var_1_25 = var_1_20 [L105] unsigned short int stepLocal_0 = var_1_16; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_0=2, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=2, var_1_17=127/5, var_1_1=128, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=2, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=0, var_1_4=2, var_1_8=0, var_1_9=0] [L106] COND TRUE ((var_1_16 * var_1_16) / var_1_4) <= stepLocal_0 [L107] var_1_1 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=2, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=0, var_1_4=2, var_1_8=0, var_1_9=0] [L111] COND FALSE !((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=2, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=0, var_1_4=2, var_1_8=0, var_1_9=0] [L166] RET step() [L167] CALL, EXPR property() [L157-L158] return (((((((((((var_1_16 * var_1_16) / var_1_4) <= var_1_16) ? (var_1_1 == ((unsigned short int) var_1_12)) : (var_1_1 == ((unsigned short int) (var_1_12 + var_1_12)))) && (((var_1_12 != var_1_4) || var_1_10) ? (var_1_9 == ((unsigned char) var_1_11)) : 1)) && (((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) ? (((- last_1_var_1_24) < last_1_var_1_24) ? (last_1_var_1_9 ? (var_1_12 == ((unsigned char) 5)) : 1) : 1) : (var_1_12 == ((unsigned char) var_1_15)))) && (var_1_16 == ((unsigned short int) (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15)))))) && (((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16)) ? (var_1_17 == ((float) var_1_20)) : 1)) && (((var_1_9 && var_1_11) && var_1_9) ? (var_1_21 == ((unsigned short int) (var_1_26 + (var_1_15 + ((((var_1_12) > (var_1_12)) ? (var_1_12) : (var_1_12))))))) : (var_1_21 == ((unsigned short int) ((23370 - var_1_15) + var_1_12))))) && ((! (-4 < var_1_12)) ? (var_1_24 == ((float) var_1_20)) : ((-4 > var_1_21) ? (var_1_24 == ((float) 10.6f)) : 1))) && (var_1_25 == ((double) var_1_20))) && (var_1_26 == ((signed long int) var_1_12)) ; VAL [\result=0, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=2, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=0, var_1_4=2, var_1_8=0, var_1_9=0] [L167] RET, EXPR property() [L167] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=2, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=0, var_1_4=2, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=2, var_1_15=2, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=2, var_1_27=1, var_1_28=1, var_1_29=0, var_1_30=0, var_1_31=2, var_1_32=2, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=-1, var_1_37=1, var_1_38=0, var_1_4=2, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 5, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 173 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 166 mSDsluCounter, 767 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 373 mSDsCounter, 95 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 202 IncrementalHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 95 mSolverCounterUnsat, 394 mSDtfsCounter, 202 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 476 GetRequests, 461 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=3, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 43 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1214 NumberOfCodeBlocks, 1214 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1055 ConstructedInterpolants, 0 QuantifiedInterpolants, 1810 SizeOfPredicates, 1 NumberOfNonLiveVariables, 735 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 6914/7084 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-03 19:57:47,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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_fillercode_fillercodesize_ps-cn-25_file-40.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 83e6a5fc52c7b932388db74a3265271ec19421eb7c3c3913e89558f5e921b8d3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:57:49,364 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:57:49,453 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 19:57:49,462 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:57:49,462 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:57:49,483 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:57:49,485 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:57:49,485 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:57:49,485 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:57:49,486 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:57:49,486 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:57:49,487 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:57:49,487 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:57:49,487 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:57:49,487 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:57:49,487 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:57:49,487 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:57:49,487 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:57:49,488 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:57:49,488 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:57:49,488 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:57:49,488 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:57:49,488 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:57:49,488 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 19:57:49,488 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 19:57:49,488 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 19:57:49,488 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:57:49,488 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:57:49,488 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:57:49,489 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:57:49,489 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:57:49,489 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:57:49,489 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:57:49,489 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:57:49,489 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:57:49,490 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:57:49,490 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:57:49,490 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:57:49,490 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:57:49,490 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 19:57:49,490 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 19:57:49,490 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:57:49,490 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:57:49,490 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:57:49,490 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:57:49,491 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 -> 83e6a5fc52c7b932388db74a3265271ec19421eb7c3c3913e89558f5e921b8d3 [2025-03-03 19:57:49,719 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:57:49,725 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:57:49,727 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:57:49,727 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:57:49,728 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:57:49,728 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-40.i [2025-03-03 19:57:50,858 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fb94f22e/d079d69ac4ef455a9daae72b32895a71/FLAGb55922bd6 [2025-03-03 19:57:51,067 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:57:51,067 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-40.i [2025-03-03 19:57:51,076 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fb94f22e/d079d69ac4ef455a9daae72b32895a71/FLAGb55922bd6 [2025-03-03 19:57:51,432 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fb94f22e/d079d69ac4ef455a9daae72b32895a71 [2025-03-03 19:57:51,433 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:57:51,434 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:57:51,435 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:57:51,435 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:57:51,438 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:57:51,439 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:57:51" (1/1) ... [2025-03-03 19:57:51,439 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14e2ddc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:57:51, skipping insertion in model container [2025-03-03 19:57:51,439 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:57:51" (1/1) ... [2025-03-03 19:57:51,453 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:57:51,544 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_fillercode_fillercodesize_ps-cn-25_file-40.i[915,928] [2025-03-03 19:57:51,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:57:51,597 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:57:51,604 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_fillercode_fillercodesize_ps-cn-25_file-40.i[915,928] [2025-03-03 19:57:51,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:57:51,635 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:57:51,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:57:51 WrapperNode [2025-03-03 19:57:51,635 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:57:51,636 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:57:51,636 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:57:51,636 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:57:51,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:57:51" (1/1) ... [2025-03-03 19:57:51,647 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:57:51" (1/1) ... [2025-03-03 19:57:51,666 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 160 [2025-03-03 19:57:51,667 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:57:51,667 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:57:51,667 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:57:51,667 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:57:51,673 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:57:51" (1/1) ... [2025-03-03 19:57:51,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:57:51" (1/1) ... [2025-03-03 19:57:51,676 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:57:51" (1/1) ... [2025-03-03 19:57:51,685 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-03 19:57:51,685 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:57:51" (1/1) ... [2025-03-03 19:57:51,685 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:57:51" (1/1) ... [2025-03-03 19:57:51,691 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:57:51" (1/1) ... [2025-03-03 19:57:51,692 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:57:51" (1/1) ... [2025-03-03 19:57:51,697 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:57:51" (1/1) ... [2025-03-03 19:57:51,698 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:57:51" (1/1) ... [2025-03-03 19:57:51,700 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:57:51,700 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:57:51,700 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:57:51,701 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:57:51,701 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:57:51" (1/1) ... [2025-03-03 19:57:51,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:57:51,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:57:51,724 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-03 19:57:51,727 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-03 19:57:51,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:57:51,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 19:57:51,745 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:57:51,745 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:57:51,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:57:51,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:57:51,800 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:57:51,801 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:57:52,379 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-03 19:57:52,379 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:57:52,387 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:57:52,387 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:57:52,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:57:52 BoogieIcfgContainer [2025-03-03 19:57:52,387 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:57:52,390 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:57:52,390 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:57:52,394 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:57:52,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:57:51" (1/3) ... [2025-03-03 19:57:52,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b3ceb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:57:52, skipping insertion in model container [2025-03-03 19:57:52,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:57:51" (2/3) ... [2025-03-03 19:57:52,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b3ceb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:57:52, skipping insertion in model container [2025-03-03 19:57:52,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:57:52" (3/3) ... [2025-03-03 19:57:52,396 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-40.i [2025-03-03 19:57:52,407 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:57:52,409 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-40.i that has 2 procedures, 72 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:57:52,458 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:57:52,468 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;@3e5bdf62, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:57:52,468 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:57:52,472 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 46 states have (on average 1.391304347826087) internal successors, (64), 47 states have internal predecessors, (64), 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-03 19:57:52,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 19:57:52,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:57:52,482 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, 1, 1, 1, 1] [2025-03-03 19:57:52,483 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:57:52,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:57:52,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1812749528, now seen corresponding path program 1 times [2025-03-03 19:57:52,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:57:52,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [765704935] [2025-03-03 19:57:52,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:57:52,496 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-03 19:57:52,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:57:52,498 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-03 19:57:52,505 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-03 19:57:52,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 19:57:52,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 19:57:52,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:57:52,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:57:52,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:57:52,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:57:52,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2025-03-03 19:57:52,834 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:57:52,834 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:57:52,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [765704935] [2025-03-03 19:57:52,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [765704935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:57:52,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:57:52,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 19:57:52,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566655998] [2025-03-03 19:57:52,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:57:52,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:57:52,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:57:52,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:57:52,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:57:52,856 INFO L87 Difference]: Start difference. First operand has 72 states, 46 states have (on average 1.391304347826087) internal successors, (64), 47 states have internal predecessors, (64), 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 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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-03 19:57:52,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:57:52,879 INFO L93 Difference]: Finished difference Result 138 states and 238 transitions. [2025-03-03 19:57:52,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:57:52,881 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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 151 [2025-03-03 19:57:52,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:57:52,886 INFO L225 Difference]: With dead ends: 138 [2025-03-03 19:57:52,886 INFO L226 Difference]: Without dead ends: 69 [2025-03-03 19:57:52,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 150 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-03 19:57:52,892 INFO L435 NwaCegarLoop]: 104 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, 104 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-03 19:57:52,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:57:52,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-03 19:57:52,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-03 19:57:52,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 44 states have internal predecessors, (58), 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-03 19:57:52,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 104 transitions. [2025-03-03 19:57:52,929 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 104 transitions. Word has length 151 [2025-03-03 19:57:52,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:57:52,930 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 104 transitions. [2025-03-03 19:57:52,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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-03 19:57:52,931 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 104 transitions. [2025-03-03 19:57:52,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 19:57:52,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:57:52,937 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, 1, 1, 1, 1, 1] [2025-03-03 19:57:52,947 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 (2)] Forceful destruction successful, exit code 0 [2025-03-03 19:57:53,137 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-03 19:57:53,139 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:57:53,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:57:53,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1844224194, now seen corresponding path program 1 times [2025-03-03 19:57:53,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:57:53,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1435734449] [2025-03-03 19:57:53,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:57:53,140 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-03 19:57:53,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:57:53,142 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-03 19:57:53,142 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-03 19:57:53,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 19:57:53,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 19:57:53,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:57:53,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:57:53,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 19:57:53,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:57:53,381 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-03 19:57:53,381 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:57:53,381 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:57:53,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1435734449] [2025-03-03 19:57:53,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1435734449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:57:53,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:57:53,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:57:53,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570636154] [2025-03-03 19:57:53,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:57:53,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:57:53,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:57:53,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:57:53,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:57:53,383 INFO L87 Difference]: Start difference. First operand 69 states and 104 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-03 19:57:53,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:57:53,461 INFO L93 Difference]: Finished difference Result 164 states and 248 transitions. [2025-03-03 19:57:53,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:57:53,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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 152 [2025-03-03 19:57:53,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:57:53,463 INFO L225 Difference]: With dead ends: 164 [2025-03-03 19:57:53,463 INFO L226 Difference]: Without dead ends: 98 [2025-03-03 19:57:53,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 150 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-03 19:57:53,464 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 76 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:57:53,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 210 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:57:53,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-03 19:57:53,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2025-03-03 19:57:53,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 56 states have internal predecessors, (67), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-03 19:57:53,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 145 transitions. [2025-03-03 19:57:53,485 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 145 transitions. Word has length 152 [2025-03-03 19:57:53,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:57:53,486 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 145 transitions. [2025-03-03 19:57:53,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-03 19:57:53,486 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 145 transitions. [2025-03-03 19:57:53,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 19:57:53,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:57:53,487 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, 1, 1, 1, 1, 1] [2025-03-03 19:57:53,497 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 (3)] Ended with exit code 0 [2025-03-03 19:57:53,687 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-03 19:57:53,690 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:57:53,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:57:53,691 INFO L85 PathProgramCache]: Analyzing trace with hash -741196061, now seen corresponding path program 1 times [2025-03-03 19:57:53,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:57:53,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1854275574] [2025-03-03 19:57:53,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:57:53,692 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-03 19:57:53,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:57:53,696 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-03 19:57:53,697 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-03 19:57:53,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 19:57:53,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 19:57:53,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:57:53,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:57:53,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 19:57:53,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:57:54,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 486 proven. 42 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2025-03-03 19:57:54,060 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:57:54,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 24 proven. 42 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-03 19:57:54,266 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:57:54,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1854275574] [2025-03-03 19:57:54,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1854275574] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:57:54,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 19:57:54,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-03 19:57:54,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444019181] [2025-03-03 19:57:54,267 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 19:57:54,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 19:57:54,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:57:54,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 19:57:54,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:57:54,268 INFO L87 Difference]: Start difference. First operand 97 states and 145 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-03-03 19:57:54,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:57:54,670 INFO L93 Difference]: Finished difference Result 180 states and 256 transitions. [2025-03-03 19:57:54,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 19:57:54,679 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 152 [2025-03-03 19:57:54,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:57:54,681 INFO L225 Difference]: With dead ends: 180 [2025-03-03 19:57:54,681 INFO L226 Difference]: Without dead ends: 111 [2025-03-03 19:57:54,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 296 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-03 19:57:54,683 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 36 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 19:57:54,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 151 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 19:57:54,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-03 19:57:54,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 103. [2025-03-03 19:57:54,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 60 states have internal predecessors, (67), 39 states have call successors, (39), 4 states have call predecessors, (39), 4 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-03 19:57:54,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 145 transitions. [2025-03-03 19:57:54,695 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 145 transitions. Word has length 152 [2025-03-03 19:57:54,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:57:54,696 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 145 transitions. [2025-03-03 19:57:54,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2025-03-03 19:57:54,696 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 145 transitions. [2025-03-03 19:57:54,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 19:57:54,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:57:54,697 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, 1, 1, 1, 1, 1] [2025-03-03 19:57:54,707 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-03 19:57:54,897 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-03 19:57:54,898 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:57:54,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:57:54,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1756819876, now seen corresponding path program 1 times [2025-03-03 19:57:54,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:57:54,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1533894792] [2025-03-03 19:57:54,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:57:54,899 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-03 19:57:54,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:57:54,901 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-03 19:57:54,902 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-03 19:57:54,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 19:57:55,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 19:57:55,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:57:55,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:57:55,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 19:57:55,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:57:55,107 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-03 19:57:55,107 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:57:55,108 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:57:55,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1533894792] [2025-03-03 19:57:55,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1533894792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:57:55,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:57:55,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:57:55,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530715924] [2025-03-03 19:57:55,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:57:55,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:57:55,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:57:55,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:57:55,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:57:55,109 INFO L87 Difference]: Start difference. First operand 103 states and 145 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-03 19:57:55,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:57:55,219 INFO L93 Difference]: Finished difference Result 174 states and 243 transitions. [2025-03-03 19:57:55,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:57:55,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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 152 [2025-03-03 19:57:55,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:57:55,228 INFO L225 Difference]: With dead ends: 174 [2025-03-03 19:57:55,228 INFO L226 Difference]: Without dead ends: 103 [2025-03-03 19:57:55,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 150 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-03 19:57:55,229 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:57:55,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 182 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:57:55,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-03 19:57:55,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2025-03-03 19:57:55,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 59 states have (on average 1.11864406779661) internal successors, (66), 60 states have internal predecessors, (66), 39 states have call successors, (39), 4 states have call predecessors, (39), 4 states have return successors, (39), 38 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-03 19:57:55,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 144 transitions. [2025-03-03 19:57:55,238 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 144 transitions. Word has length 152 [2025-03-03 19:57:55,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:57:55,238 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 144 transitions. [2025-03-03 19:57:55,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-03 19:57:55,239 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 144 transitions. [2025-03-03 19:57:55,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 19:57:55,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:57:55,240 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, 1, 1, 1, 1, 1] [2025-03-03 19:57:55,248 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-03 19:57:55,440 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 [2025-03-03 19:57:55,441 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:57:55,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:57:55,441 INFO L85 PathProgramCache]: Analyzing trace with hash -795337085, now seen corresponding path program 1 times [2025-03-03 19:57:55,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:57:55,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1209017306] [2025-03-03 19:57:55,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:57:55,442 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-03 19:57:55,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:57:55,444 INFO L229 MonitoredProcess]: Starting monitored process 6 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-03 19:57:55,444 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 (6)] Waiting until timeout for monitored process [2025-03-03 19:57:55,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 19:57:55,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 19:57:55,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:57:55,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:57:55,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 19:57:55,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:57:55,775 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-03 19:57:55,775 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:57:55,775 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:57:55,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1209017306] [2025-03-03 19:57:55,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1209017306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:57:55,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:57:55,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:57:55,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946110009] [2025-03-03 19:57:55,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:57:55,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:57:55,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:57:55,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:57:55,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:57:55,776 INFO L87 Difference]: Start difference. First operand 103 states and 144 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-03 19:57:56,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:57:56,336 INFO L93 Difference]: Finished difference Result 266 states and 364 transitions. [2025-03-03 19:57:56,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 19:57:56,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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 152 [2025-03-03 19:57:56,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:57:56,338 INFO L225 Difference]: With dead ends: 266 [2025-03-03 19:57:56,338 INFO L226 Difference]: Without dead ends: 195 [2025-03-03 19:57:56,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:57:56,339 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 163 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 19:57:56,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 426 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 19:57:56,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-03 19:57:56,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 123. [2025-03-03 19:57:56,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 70 states have (on average 1.1) internal successors, (77), 71 states have internal predecessors, (77), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-03 19:57:56,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 169 transitions. [2025-03-03 19:57:56,358 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 169 transitions. Word has length 152 [2025-03-03 19:57:56,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:57:56,358 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 169 transitions. [2025-03-03 19:57:56,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-03 19:57:56,359 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 169 transitions. [2025-03-03 19:57:56,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-03 19:57:56,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:57:56,360 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, 1, 1, 1, 1, 1] [2025-03-03 19:57:56,371 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 (6)] Ended with exit code 0 [2025-03-03 19:57:56,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-03 19:57:56,560 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:57:56,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:57:56,561 INFO L85 PathProgramCache]: Analyzing trace with hash -794413564, now seen corresponding path program 1 times [2025-03-03 19:57:56,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:57:56,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [782164137] [2025-03-03 19:57:56,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:57:56,561 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-03 19:57:56,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:57:56,564 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-03 19:57:56,566 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-03 19:57:56,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-03 19:57:56,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-03 19:57:56,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:57:56,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:57:56,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 19:57:56,785 INFO L279 TraceCheckSpWp]: Computing forward predicates...