./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-48.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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_fillercodestructure_filler-pr-ci_file-48.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 d87c3660a424df0524cae67268a05b6384bd5fce4f180c391a8617728ea69ead --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:43:35,507 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:43:35,564 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 21:43:35,568 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:43:35,568 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:43:35,588 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:43:35,589 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:43:35,589 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:43:35,590 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:43:35,591 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:43:35,591 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:43:35,591 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:43:35,592 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:43:35,592 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:43:35,593 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:43:35,594 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:43:35,594 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:43:35,594 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:43:35,594 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 21:43:35,594 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:43:35,595 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:43:35,599 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:43:35,599 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:43:35,599 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:43:35,600 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:43:35,600 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:43:35,600 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:43:35,600 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:43:35,600 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:43:35,600 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:43:35,601 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:43:35,601 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:43:35,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:43:35,601 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:43:35,601 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:43:35,601 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:43:35,601 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 21:43:35,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 21:43:35,602 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:43:35,602 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:43:35,604 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:43:35,604 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:43:35,604 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> d87c3660a424df0524cae67268a05b6384bd5fce4f180c391a8617728ea69ead [2024-11-08 21:43:35,804 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:43:35,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:43:35,831 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:43:35,832 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:43:35,833 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:43:35,834 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-48.i [2024-11-08 21:43:37,138 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:43:37,300 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:43:37,301 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-48.i [2024-11-08 21:43:37,314 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee92c401f/28102c5b9e83457c822e7b49b55dac34/FLAGb1bddacf8 [2024-11-08 21:43:37,325 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee92c401f/28102c5b9e83457c822e7b49b55dac34 [2024-11-08 21:43:37,327 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:43:37,328 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:43:37,329 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:43:37,330 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:43:37,338 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:43:37,338 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:43:37" (1/1) ... [2024-11-08 21:43:37,339 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ea26456 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:43:37, skipping insertion in model container [2024-11-08 21:43:37,339 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:43:37" (1/1) ... [2024-11-08 21:43:37,367 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:43:37,491 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_fillercodestructure_filler-pr-ci_file-48.i[919,932] [2024-11-08 21:43:37,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:43:37,561 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:43:37,569 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_fillercodestructure_filler-pr-ci_file-48.i[919,932] [2024-11-08 21:43:37,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:43:37,615 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:43:37,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:43:37 WrapperNode [2024-11-08 21:43:37,615 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:43:37,616 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:43:37,616 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:43:37,616 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:43:37,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:43:37" (1/1) ... [2024-11-08 21:43:37,630 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:43:37" (1/1) ... [2024-11-08 21:43:37,665 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 223 [2024-11-08 21:43:37,665 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:43:37,666 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:43:37,666 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:43:37,666 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:43:37,677 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:43:37" (1/1) ... [2024-11-08 21:43:37,678 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:43:37" (1/1) ... [2024-11-08 21:43:37,682 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:43:37" (1/1) ... [2024-11-08 21:43:37,708 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]. [2024-11-08 21:43:37,709 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:43:37" (1/1) ... [2024-11-08 21:43:37,709 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:43:37" (1/1) ... [2024-11-08 21:43:37,717 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:43:37" (1/1) ... [2024-11-08 21:43:37,720 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:43:37" (1/1) ... [2024-11-08 21:43:37,722 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:43:37" (1/1) ... [2024-11-08 21:43:37,724 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:43:37" (1/1) ... [2024-11-08 21:43:37,728 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:43:37,729 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:43:37,729 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:43:37,729 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:43:37,730 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:43:37" (1/1) ... [2024-11-08 21:43:37,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:43:37,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:43:37,803 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) [2024-11-08 21:43:37,817 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 [2024-11-08 21:43:37,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:43:37,880 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:43:37,881 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:43:37,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 21:43:37,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:43:37,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:43:37,960 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:43:37,962 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:43:38,255 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-08 21:43:38,256 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:43:38,269 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:43:38,269 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:43:38,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:43:38 BoogieIcfgContainer [2024-11-08 21:43:38,271 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:43:38,274 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:43:38,274 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:43:38,276 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:43:38,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:43:37" (1/3) ... [2024-11-08 21:43:38,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@492045f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:43:38, skipping insertion in model container [2024-11-08 21:43:38,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:43:37" (2/3) ... [2024-11-08 21:43:38,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@492045f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:43:38, skipping insertion in model container [2024-11-08 21:43:38,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:43:38" (3/3) ... [2024-11-08 21:43:38,280 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-48.i [2024-11-08 21:43:38,292 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:43:38,292 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:43:38,350 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:43:38,356 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;@54cee19e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:43:38,357 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:43:38,362 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 64 states have (on average 1.453125) internal successors, (93), 65 states have internal predecessors, (93), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 21:43:38,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-08 21:43:38,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:43:38,378 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:43:38,378 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:43:38,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:43:38,383 INFO L85 PathProgramCache]: Analyzing trace with hash 279041345, now seen corresponding path program 1 times [2024-11-08 21:43:38,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:43:38,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477637219] [2024-11-08 21:43:38,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:43:38,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:43:38,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:38,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:43:38,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:38,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:43:38,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:38,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:43:38,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:38,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:43:38,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:38,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:43:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:38,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:43:38,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:38,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 21:43:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:38,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:43:38,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:38,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 21:43:38,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:38,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:43:38,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:38,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 21:43:38,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:38,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:43:38,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:38,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 21:43:38,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:38,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:43:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:38,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 21:43:38,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:38,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:43:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:38,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 21:43:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:38,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:43:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:38,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:43:38,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:38,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:43:38,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:38,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:43:38,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:38,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:43:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:38,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:43:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:38,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:43:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:38,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:43:38,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:38,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:43:38,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:38,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:43:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:38,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-08 21:43:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:38,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-08 21:43:38,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:38,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-08 21:43:38,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:43:38,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477637219] [2024-11-08 21:43:38,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477637219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:43:38,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:43:38,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:43:38,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70522013] [2024-11-08 21:43:38,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:43:38,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:43:38,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:43:38,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:43:38,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:43:38,900 INFO L87 Difference]: Start difference. First operand has 96 states, 64 states have (on average 1.453125) internal successors, (93), 65 states have internal predecessors, (93), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-08 21:43:38,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:43:38,937 INFO L93 Difference]: Finished difference Result 184 states and 323 transitions. [2024-11-08 21:43:38,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:43:38,940 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 192 [2024-11-08 21:43:38,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:43:38,946 INFO L225 Difference]: With dead ends: 184 [2024-11-08 21:43:38,947 INFO L226 Difference]: Without dead ends: 91 [2024-11-08 21:43:38,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:43:38,955 INFO L432 NwaCegarLoop]: 140 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, 140 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 [2024-11-08 21:43:38,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:43:38,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-08 21:43:38,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-08 21:43:38,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 60 states have internal predecessors, (82), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 21:43:38,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 140 transitions. [2024-11-08 21:43:38,993 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 140 transitions. Word has length 192 [2024-11-08 21:43:38,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:43:38,994 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 140 transitions. [2024-11-08 21:43:38,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-08 21:43:38,994 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 140 transitions. [2024-11-08 21:43:38,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-08 21:43:38,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:43:38,998 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:43:38,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 21:43:38,999 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:43:38,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:43:38,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1919348557, now seen corresponding path program 1 times [2024-11-08 21:43:39,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:43:39,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975121413] [2024-11-08 21:43:39,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:43:39,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:43:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:43:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:43:39,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:43:39,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:43:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:43:39,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:43:39,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 21:43:39,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:43:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 21:43:39,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:43:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 21:43:39,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:43:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 21:43:39,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:43:39,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 21:43:39,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:43:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 21:43:39,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:43:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:43:39,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:43:39,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:43:39,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:43:39,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:43:39,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:43:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:43:39,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:43:39,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:43:39,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-08 21:43:39,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-08 21:43:39,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-08 21:43:39,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:43:39,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975121413] [2024-11-08 21:43:39,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975121413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:43:39,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:43:39,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:43:39,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37535151] [2024-11-08 21:43:39,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:43:39,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:43:39,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:43:39,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:43:39,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:43:39,328 INFO L87 Difference]: Start difference. First operand 91 states and 140 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:43:39,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:43:39,386 INFO L93 Difference]: Finished difference Result 213 states and 330 transitions. [2024-11-08 21:43:39,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:43:39,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 192 [2024-11-08 21:43:39,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:43:39,389 INFO L225 Difference]: With dead ends: 213 [2024-11-08 21:43:39,393 INFO L226 Difference]: Without dead ends: 125 [2024-11-08 21:43:39,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:43:39,394 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 38 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:43:39,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 256 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:43:39,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-08 21:43:39,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 108. [2024-11-08 21:43:39,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 77 states have internal predecessors, (106), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 21:43:39,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 164 transitions. [2024-11-08 21:43:39,415 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 164 transitions. Word has length 192 [2024-11-08 21:43:39,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:43:39,416 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 164 transitions. [2024-11-08 21:43:39,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:43:39,416 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 164 transitions. [2024-11-08 21:43:39,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-08 21:43:39,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:43:39,421 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:43:39,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 21:43:39,421 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:43:39,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:43:39,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1549342859, now seen corresponding path program 1 times [2024-11-08 21:43:39,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:43:39,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971576174] [2024-11-08 21:43:39,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:43:39,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:43:39,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:43:39,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:43:39,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:43:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:43:39,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:43:39,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:43:39,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 21:43:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:43:39,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 21:43:39,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:43:39,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 21:43:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:43:39,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 21:43:39,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:43:39,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 21:43:39,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:43:39,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 21:43:39,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:43:39,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:43:39,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:43:39,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:43:39,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:43:39,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:43:39,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:43:39,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:43:39,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:43:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:43:39,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-08 21:43:39,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-08 21:43:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-08 21:43:39,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:43:39,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971576174] [2024-11-08 21:43:39,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971576174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:43:39,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:43:39,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:43:39,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275652138] [2024-11-08 21:43:39,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:43:39,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:43:39,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:43:39,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:43:39,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:43:39,652 INFO L87 Difference]: Start difference. First operand 108 states and 164 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:43:39,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:43:39,668 INFO L93 Difference]: Finished difference Result 214 states and 327 transitions. [2024-11-08 21:43:39,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:43:39,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 192 [2024-11-08 21:43:39,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:43:39,671 INFO L225 Difference]: With dead ends: 214 [2024-11-08 21:43:39,671 INFO L226 Difference]: Without dead ends: 109 [2024-11-08 21:43:39,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:43:39,672 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:43:39,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 272 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:43:39,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-08 21:43:39,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-08 21:43:39,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 78 states have (on average 1.3717948717948718) internal successors, (107), 78 states have internal predecessors, (107), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 21:43:39,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 165 transitions. [2024-11-08 21:43:39,679 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 165 transitions. Word has length 192 [2024-11-08 21:43:39,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:43:39,680 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 165 transitions. [2024-11-08 21:43:39,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:43:39,680 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 165 transitions. [2024-11-08 21:43:39,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-08 21:43:39,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:43:39,682 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:43:39,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 21:43:39,683 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:43:39,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:43:39,683 INFO L85 PathProgramCache]: Analyzing trace with hash -949185005, now seen corresponding path program 1 times [2024-11-08 21:43:39,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:43:39,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845051999] [2024-11-08 21:43:39,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:43:39,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:43:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:43:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:43:39,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:43:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:43:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:43:39,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:43:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 21:43:39,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:43:39,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 21:43:39,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:43:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 21:43:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:43:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 21:43:39,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:43:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 21:43:39,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:43:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 21:43:39,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:43:39,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:43:39,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:43:39,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:43:39,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:43:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:43:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:43:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:43:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:43:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:43:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-08 21:43:39,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-08 21:43:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:39,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-08 21:43:39,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:43:39,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845051999] [2024-11-08 21:43:39,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845051999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:43:39,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:43:39,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:43:39,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976122589] [2024-11-08 21:43:39,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:43:39,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:43:39,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:43:39,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:43:39,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:43:39,912 INFO L87 Difference]: Start difference. First operand 109 states and 165 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:43:39,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:43:39,983 INFO L93 Difference]: Finished difference Result 320 states and 487 transitions. [2024-11-08 21:43:39,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:43:39,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 193 [2024-11-08 21:43:39,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:43:39,985 INFO L225 Difference]: With dead ends: 320 [2024-11-08 21:43:39,986 INFO L226 Difference]: Without dead ends: 214 [2024-11-08 21:43:39,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:43:39,987 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 103 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:43:39,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 259 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:43:39,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-08 21:43:40,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2024-11-08 21:43:40,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 151 states have (on average 1.3642384105960266) internal successors, (206), 151 states have internal predecessors, (206), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-08 21:43:40,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 322 transitions. [2024-11-08 21:43:40,007 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 322 transitions. Word has length 193 [2024-11-08 21:43:40,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:43:40,008 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 322 transitions. [2024-11-08 21:43:40,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:43:40,008 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 322 transitions. [2024-11-08 21:43:40,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-08 21:43:40,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:43:40,010 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:43:40,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 21:43:40,011 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:43:40,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:43:40,011 INFO L85 PathProgramCache]: Analyzing trace with hash 695384867, now seen corresponding path program 1 times [2024-11-08 21:43:40,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:43:40,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352354130] [2024-11-08 21:43:40,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:43:40,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:43:40,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:40,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:43:40,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:40,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:43:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:40,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:43:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:40,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:43:40,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:40,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:43:40,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:40,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:43:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:40,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 21:43:40,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:40,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:43:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:40,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 21:43:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:40,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:43:40,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:40,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 21:43:40,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:40,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:43:40,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:40,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 21:43:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:40,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:43:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:40,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 21:43:40,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:40,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:43:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:40,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 21:43:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:40,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:43:40,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:40,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:43:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:40,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:43:40,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:40,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:43:40,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:40,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:43:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:40,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:43:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:40,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:43:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:40,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:43:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:40,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:43:40,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:40,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:43:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:40,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-08 21:43:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:40,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-08 21:43:40,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:40,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-08 21:43:40,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:43:40,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352354130] [2024-11-08 21:43:40,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352354130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:43:40,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:43:40,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 21:43:40,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815222768] [2024-11-08 21:43:40,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:43:40,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 21:43:40,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:43:40,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 21:43:40,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-08 21:43:40,865 INFO L87 Difference]: Start difference. First operand 212 states and 322 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:43:41,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:43:41,453 INFO L93 Difference]: Finished difference Result 648 states and 971 transitions. [2024-11-08 21:43:41,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 21:43:41,453 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 194 [2024-11-08 21:43:41,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:43:41,456 INFO L225 Difference]: With dead ends: 648 [2024-11-08 21:43:41,456 INFO L226 Difference]: Without dead ends: 439 [2024-11-08 21:43:41,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-11-08 21:43:41,457 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 385 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 21:43:41,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 607 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 21:43:41,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-11-08 21:43:41,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 301. [2024-11-08 21:43:41,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 210 states have (on average 1.3571428571428572) internal successors, (285), 210 states have internal predecessors, (285), 87 states have call successors, (87), 3 states have call predecessors, (87), 3 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2024-11-08 21:43:41,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 459 transitions. [2024-11-08 21:43:41,481 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 459 transitions. Word has length 194 [2024-11-08 21:43:41,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:43:41,481 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 459 transitions. [2024-11-08 21:43:41,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:43:41,481 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 459 transitions. [2024-11-08 21:43:41,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-08 21:43:41,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:43:41,483 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:43:41,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 21:43:41,483 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:43:41,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:43:41,484 INFO L85 PathProgramCache]: Analyzing trace with hash -315732383, now seen corresponding path program 1 times [2024-11-08 21:43:41,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:43:41,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210932239] [2024-11-08 21:43:41,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:43:41,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:43:41,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:41,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:43:41,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:41,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:43:41,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:41,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:43:41,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:41,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:43:41,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:41,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:43:41,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:41,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:43:41,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:41,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 21:43:41,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:41,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:43:41,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:41,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 21:43:41,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:41,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:43:41,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:41,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 21:43:41,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:41,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:43:41,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:41,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 21:43:41,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:41,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:43:41,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:41,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 21:43:41,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:41,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:43:41,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:41,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 21:43:41,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:41,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:43:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:41,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:43:41,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:41,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:43:41,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:41,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:43:41,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:41,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:43:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:41,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:43:41,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:41,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:43:41,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:41,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:43:41,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:41,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:43:41,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:41,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:43:41,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:41,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-08 21:43:41,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:41,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-08 21:43:41,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:41,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 69 proven. 15 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-08 21:43:41,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:43:41,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210932239] [2024-11-08 21:43:41,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210932239] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:43:41,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463621838] [2024-11-08 21:43:41,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:43:41,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:43:41,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:43:41,705 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) [2024-11-08 21:43:41,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 21:43:41,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:43:41,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 21:43:41,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:43:41,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 534 proven. 15 refuted. 0 times theorem prover too weak. 1075 trivial. 0 not checked. [2024-11-08 21:43:41,948 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:43:42,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 69 proven. 15 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-08 21:43:42,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463621838] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 21:43:42,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 21:43:42,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-08 21:43:42,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553021328] [2024-11-08 21:43:42,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 21:43:42,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 21:43:42,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:43:42,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 21:43:42,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:43:42,124 INFO L87 Difference]: Start difference. First operand 301 states and 459 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-08 21:43:42,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:43:42,293 INFO L93 Difference]: Finished difference Result 537 states and 802 transitions. [2024-11-08 21:43:42,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 21:43:42,293 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 194 [2024-11-08 21:43:42,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:43:42,296 INFO L225 Difference]: With dead ends: 537 [2024-11-08 21:43:42,296 INFO L226 Difference]: Without dead ends: 325 [2024-11-08 21:43:42,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 442 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-08 21:43:42,297 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 77 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:43:42,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 260 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:43:42,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-11-08 21:43:42,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 313. [2024-11-08 21:43:42,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 219 states have (on average 1.3287671232876712) internal successors, (291), 219 states have internal predecessors, (291), 87 states have call successors, (87), 6 states have call predecessors, (87), 6 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2024-11-08 21:43:42,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 465 transitions. [2024-11-08 21:43:42,325 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 465 transitions. Word has length 194 [2024-11-08 21:43:42,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:43:42,325 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 465 transitions. [2024-11-08 21:43:42,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-08 21:43:42,326 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 465 transitions. [2024-11-08 21:43:42,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-08 21:43:42,327 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:43:42,327 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:43:42,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 21:43:42,528 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,SelfDestructingSolverStorable5 [2024-11-08 21:43:42,528 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:43:42,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:43:42,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1125079009, now seen corresponding path program 1 times [2024-11-08 21:43:42,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:43:42,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085935332] [2024-11-08 21:43:42,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:43:42,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:43:42,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 21:43:42,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [751646448] [2024-11-08 21:43:42,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:43:42,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:43:42,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:43:42,610 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) [2024-11-08 21:43:42,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 21:43:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:43:42,741 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 21:43:42,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:43:42,859 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 21:43:42,859 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 21:43:42,860 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 21:43:42,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 21:43:43,061 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,SelfDestructingSolverStorable6 [2024-11-08 21:43:43,065 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:43:43,252 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 21:43:43,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 09:43:43 BoogieIcfgContainer [2024-11-08 21:43:43,258 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 21:43:43,259 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 21:43:43,259 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 21:43:43,259 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 21:43:43,259 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:43:38" (3/4) ... [2024-11-08 21:43:43,261 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 21:43:43,266 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 21:43:43,266 INFO L158 Benchmark]: Toolchain (without parser) took 5938.14ms. Allocated memory was 188.7MB in the beginning and 335.5MB in the end (delta: 146.8MB). Free memory was 117.7MB in the beginning and 205.0MB in the end (delta: -87.3MB). Peak memory consumption was 61.4MB. Max. memory is 16.1GB. [2024-11-08 21:43:43,266 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 188.7MB. Free memory is still 145.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 21:43:43,266 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.15ms. Allocated memory is still 188.7MB. Free memory was 117.5MB in the beginning and 99.7MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 21:43:43,267 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.53ms. Allocated memory is still 188.7MB. Free memory was 99.7MB in the beginning and 94.7MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 21:43:43,268 INFO L158 Benchmark]: Boogie Preprocessor took 62.21ms. Allocated memory is still 188.7MB. Free memory was 94.7MB in the beginning and 88.2MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 21:43:43,268 INFO L158 Benchmark]: RCFGBuilder took 542.02ms. Allocated memory is still 188.7MB. Free memory was 87.9MB in the beginning and 128.9MB in the end (delta: -41.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 21:43:43,268 INFO L158 Benchmark]: TraceAbstraction took 4984.87ms. Allocated memory was 188.7MB in the beginning and 335.5MB in the end (delta: 146.8MB). Free memory was 128.9MB in the beginning and 205.0MB in the end (delta: -76.2MB). Peak memory consumption was 73.7MB. Max. memory is 16.1GB. [2024-11-08 21:43:43,269 INFO L158 Benchmark]: Witness Printer took 7.00ms. Allocated memory is still 335.5MB. Free memory is still 205.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 21:43:43,270 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.15ms. Allocated memory is still 188.7MB. Free memory is still 145.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 286.15ms. Allocated memory is still 188.7MB. Free memory was 117.5MB in the beginning and 99.7MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.53ms. Allocated memory is still 188.7MB. Free memory was 99.7MB in the beginning and 94.7MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.21ms. Allocated memory is still 188.7MB. Free memory was 94.7MB in the beginning and 88.2MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 542.02ms. Allocated memory is still 188.7MB. Free memory was 87.9MB in the beginning and 128.9MB in the end (delta: -41.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4984.87ms. Allocated memory was 188.7MB in the beginning and 335.5MB in the end (delta: 146.8MB). Free memory was 128.9MB in the beginning and 205.0MB in the end (delta: -76.2MB). Peak memory consumption was 73.7MB. Max. memory is 16.1GB. * Witness Printer took 7.00ms. Allocated memory is still 335.5MB. Free memory is still 205.0MB. 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 someBinaryDOUBLEComparisonOperation at line 200, overapproximation of someBinaryFLOATComparisonOperation at line 193. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 10; [L23] unsigned char var_1_2 = 1; [L24] double var_1_3 = 0.0; [L25] double var_1_4 = 128.2; [L26] double var_1_5 = 50.1; [L27] double var_1_6 = 64.5; [L28] unsigned short int var_1_7 = 1; [L29] unsigned char var_1_8 = 5; [L30] double var_1_9 = 15.35; [L31] unsigned char var_1_10 = 10; [L32] unsigned char var_1_11 = 2; [L33] signed long int var_1_12 = 32; [L34] signed long int var_1_13 = 256; [L35] signed char var_1_14 = 1; [L36] unsigned char var_1_15 = 128; [L37] unsigned char var_1_16 = 0; [L38] signed char var_1_17 = -64; [L39] unsigned short int var_1_18 = 64; [L40] unsigned short int var_1_20 = 8; [L41] unsigned char var_1_22 = 0; [L42] unsigned char var_1_25 = 1; [L43] unsigned char var_1_26 = 1; [L44] unsigned char var_1_28 = 0; [L45] double var_1_29 = 50.2; [L46] signed char var_1_32 = -25; [L47] unsigned char var_1_36 = 0; [L48] unsigned char var_1_37 = 0; [L49] signed short int var_1_38 = -4; [L50] float var_1_40 = 16.2; [L51] float var_1_41 = 10.75; [L52] float var_1_42 = 999.6; [L53] float var_1_43 = 64.5; [L54] signed long int var_1_44 = -2; [L55] signed short int var_1_45 = 2; [L56] unsigned char last_1_var_1_8 = 5; [L57] unsigned short int last_1_var_1_18 = 64; VAL [isInitial=0, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_3=0, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L204] isInitial = 1 [L205] FCALL initially() [L206] COND TRUE 1 [L207] CALL updateLastVariables() [L196] last_1_var_1_8 = var_1_8 [L197] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=1, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_3=0, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L207] RET updateLastVariables() [L208] CALL updateVariables() [L147] var_1_2 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_3=0, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_3=0, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L148] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_3=0, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L149] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_3=0, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_3=0, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L149] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_3=0, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L150] var_1_3 = __VERIFIER_nondet_double() [L151] CALL assume_abort_if_not((var_1_3 >= 4611686.018427387900e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L151] RET assume_abort_if_not((var_1_3 >= 4611686.018427387900e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L152] var_1_4 = __VERIFIER_nondet_double() [L153] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427387900e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L153] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427387900e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L154] var_1_5 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L155] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L156] var_1_6 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L157] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L158] var_1_7 = __VERIFIER_nondet_ushort() [L159] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_8=5, var_1_9=307/20] [L159] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_8=5, var_1_9=307/20] [L160] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5, var_1_9=307/20] [L160] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5, var_1_9=307/20] [L161] var_1_9 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L162] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L163] CALL assume_abort_if_not(var_1_9 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L163] RET assume_abort_if_not(var_1_9 != 0.0F) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L164] var_1_10 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L165] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L166] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L166] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L167] var_1_11 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L168] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L169] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L169] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L170] var_1_15 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_15 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L171] RET assume_abort_if_not(var_1_15 >= 127) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L172] CALL assume_abort_if_not(var_1_15 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L172] RET assume_abort_if_not(var_1_15 <= 255) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L173] var_1_16 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L174] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L175] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L175] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L176] var_1_17 = __VERIFIER_nondet_char() [L177] CALL assume_abort_if_not(var_1_17 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L177] RET assume_abort_if_not(var_1_17 >= -126) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L178] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L178] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L179] var_1_25 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_25 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L180] RET assume_abort_if_not(var_1_25 >= 1) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L181] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L181] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L182] var_1_28 = __VERIFIER_nondet_uchar() [L183] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L183] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L184] CALL assume_abort_if_not(var_1_28 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L184] RET assume_abort_if_not(var_1_28 <= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L185] var_1_37 = __VERIFIER_nondet_uchar() [L186] CALL assume_abort_if_not(var_1_37 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L186] RET assume_abort_if_not(var_1_37 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L187] CALL assume_abort_if_not(var_1_37 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L187] RET assume_abort_if_not(var_1_37 <= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_41=43/4, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L188] var_1_41 = __VERIFIER_nondet_float() [L189] CALL assume_abort_if_not((var_1_41 >= -461168.6018427382800e+13F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 4611686.018427382800e+12F && var_1_41 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L189] RET assume_abort_if_not((var_1_41 >= -461168.6018427382800e+13F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 4611686.018427382800e+12F && var_1_41 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_42=4998/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L190] var_1_42 = __VERIFIER_nondet_float() [L191] CALL assume_abort_if_not((var_1_42 >= -461168.6018427382800e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 4611686.018427382800e+12F && var_1_42 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L191] RET assume_abort_if_not((var_1_42 >= -461168.6018427382800e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 4611686.018427382800e+12F && var_1_42 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_43=129/2, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L192] var_1_43 = __VERIFIER_nondet_float() [L193] CALL assume_abort_if_not((var_1_43 >= -461168.6018427382800e+13F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 4611686.018427382800e+12F && var_1_43 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L193] RET assume_abort_if_not((var_1_43 >= -461168.6018427382800e+13F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 4611686.018427382800e+12F && var_1_43 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L208] RET updateVariables() [L209] CALL step() [L61] COND FALSE !(\read(var_1_2)) [L68] var_1_1 = 1 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=1, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L70] EXPR var_1_10 >> var_1_16 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=1, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=-4, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L70] COND TRUE ((var_1_10 | 1) % var_1_15) >= (var_1_10 >> var_1_16) [L71] var_1_38 = (((((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))) < 0 ) ? -((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))) : ((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=1, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=127, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L73] unsigned short int stepLocal_0 = var_1_1; VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=1, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=127, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=5] [L74] COND TRUE var_1_6 > (var_1_5 / ((((var_1_3) > (var_1_9)) ? (var_1_3) : (var_1_9)))) [L75] var_1_8 = ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=1, var_1_20=8, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=127, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=0] [L83] var_1_20 = var_1_11 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=1, var_1_20=1, var_1_22=0, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=127, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=0] [L84] COND TRUE var_1_2 || (2.65f > var_1_4) [L85] var_1_22 = (! (! var_1_25)) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=1, var_1_20=1, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=127, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=0] [L87] COND FALSE !(\read(var_1_37)) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=0, var_1_11=1, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=1, var_1_20=1, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=127, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=0] [L90] COND FALSE !(\read(var_1_2)) [L99] var_1_12 = last_1_var_1_18 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=0, var_1_11=1, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=1, var_1_20=1, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=-25, var_1_36=0, var_1_37=0, var_1_38=127, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=0] [L101] COND TRUE (((((var_1_15) < 0 ) ? -(var_1_15) : (var_1_15))) - ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))) <= var_1_15 [L102] var_1_32 = ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=0, var_1_11=1, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=1, var_1_20=1, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=1, var_1_36=0, var_1_37=0, var_1_38=127, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=0] [L104] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=0, var_1_11=1, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=1, var_1_20=1, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=1, var_1_36=0, var_1_37=0, var_1_38=127, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=0] [L107] signed long int stepLocal_1 = ((((var_1_15 - var_1_16)) > (var_1_12)) ? ((var_1_15 - var_1_16)) : (var_1_12)); VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, stepLocal_1=64, var_1_10=0, var_1_11=1, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=1, var_1_20=1, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=1, var_1_36=0, var_1_37=0, var_1_38=127, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=0] [L108] COND FALSE !(var_1_10 == stepLocal_1) [L111] var_1_14 = var_1_17 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=0, var_1_11=1, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=1, var_1_20=1, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=1, var_1_36=0, var_1_37=0, var_1_38=127, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=0] [L113] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=0, var_1_11=1, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=1, var_1_20=1, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=1, var_1_36=0, var_1_37=0, var_1_38=127, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=0] [L116] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=0, var_1_11=1, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=1, var_1_20=1, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=1, var_1_36=0, var_1_37=0, var_1_38=127, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=0] [L119] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=0, var_1_11=1, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=1, var_1_20=1, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=1, var_1_36=0, var_1_37=0, var_1_38=127, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=0] [L122] EXPR var_1_16 & var_1_8 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=0, var_1_11=1, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=1, var_1_20=1, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=1, var_1_36=0, var_1_37=0, var_1_38=127, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=0] [L122] COND FALSE !((var_1_16 & var_1_8) <= ((var_1_15 - var_1_15) + -16)) [L125] COND FALSE !(\read(var_1_28)) [L128] var_1_36 = var_1_37 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=0, var_1_11=1, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=1, var_1_20=1, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=1, var_1_36=0, var_1_37=0, var_1_38=127, var_1_40=81/5, var_1_44=-2, var_1_45=2, var_1_7=0, var_1_8=0] [L131] var_1_45 = var_1_12 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=0, var_1_11=1, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=1, var_1_20=1, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=1, var_1_36=0, var_1_37=0, var_1_38=127, var_1_40=81/5, var_1_44=-2, var_1_45=64, var_1_7=0, var_1_8=0] [L132] COND FALSE !(var_1_8 == var_1_13) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=0, var_1_11=1, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=64, var_1_1=1, var_1_20=1, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=1, var_1_36=0, var_1_37=0, var_1_38=127, var_1_40=81/5, var_1_44=-2, var_1_45=64, var_1_7=0, var_1_8=0] [L135] COND FALSE !(last_1_var_1_18 != var_1_16) [L142] var_1_18 = var_1_10 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=0, var_1_11=1, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=1, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=1, var_1_36=0, var_1_37=0, var_1_38=127, var_1_40=81/5, var_1_44=-2, var_1_45=64, var_1_7=0, var_1_8=0] [L209] RET step() [L210] CALL, EXPR property() [L200-L201] return (((((var_1_2 ? ((((var_1_3 - var_1_4) - var_1_5) == (15.75 - var_1_6)) ? (var_1_1 == ((unsigned short int) (5 + last_1_var_1_8))) : (var_1_1 == ((unsigned short int) last_1_var_1_8))) : (var_1_1 == ((unsigned short int) 1))) && ((var_1_6 > (var_1_5 / ((((var_1_3) > (var_1_9)) ? (var_1_3) : (var_1_9))))) ? (var_1_8 == ((unsigned char) ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))))) : ((var_1_1 <= var_1_7) ? (var_1_8 == ((unsigned char) var_1_10)) : (var_1_8 == ((unsigned char) var_1_11))))) && (var_1_2 ? ((-128 > var_1_10) ? ((var_1_3 >= (2.75 / var_1_9)) ? (var_1_12 == ((signed long int) (var_1_11 + (last_1_var_1_18 + var_1_10)))) : (var_1_12 == ((signed long int) last_1_var_1_18))) : 1) : (var_1_12 == ((signed long int) last_1_var_1_18)))) && (var_1_2 ? (var_1_13 == ((signed long int) var_1_11)) : 1)) && ((var_1_10 == (((((var_1_15 - var_1_16)) > (var_1_12)) ? ((var_1_15 - var_1_16)) : (var_1_12)))) ? (var_1_14 == ((signed char) ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))))) : (var_1_14 == ((signed char) var_1_17)))) && ((var_1_8 == var_1_13) ? (var_1_18 == ((unsigned short int) (var_1_10 + ((((var_1_14) < (var_1_16)) ? (var_1_14) : (var_1_16)))))) : ((last_1_var_1_18 != var_1_16) ? ((-256 >= var_1_13) ? (var_1_18 == ((unsigned short int) var_1_16)) : (var_1_18 == ((unsigned short int) var_1_15))) : (var_1_18 == ((unsigned short int) var_1_10)))) ; VAL [\result=0, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=1, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=1, var_1_36=0, var_1_37=0, var_1_38=127, var_1_40=81/5, var_1_44=-2, var_1_45=64, var_1_7=0, var_1_8=0] [L210] RET, EXPR property() [L210] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=1, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=1, var_1_36=0, var_1_37=0, var_1_38=127, var_1_40=81/5, var_1_44=-2, var_1_45=64, var_1_7=0, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=0, var_1_11=1, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=127, var_1_16=64, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=1, var_1_22=1, var_1_25=1, var_1_26=1, var_1_28=0, var_1_29=251/5, var_1_2=0, var_1_32=1, var_1_36=0, var_1_37=0, var_1_38=127, var_1_40=81/5, var_1_44=-2, var_1_45=64, var_1_7=0, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.7s, OverallIterations: 7, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 625 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 603 mSDsluCounter, 1794 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1013 mSDsCounter, 142 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 594 IncrementalHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 142 mSolverCounterUnsat, 781 mSDtfsCounter, 594 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 799 GetRequests, 772 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=313occurred in iteration=6, InterpolantAutomatonStates: 31, 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, 6 MinimizatonAttempts, 169 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1739 NumberOfCodeBlocks, 1739 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1537 ConstructedInterpolants, 0 QuantifiedInterpolants, 3186 SizeOfPredicates, 1 NumberOfNonLiveVariables, 451 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 12947/12992 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 21:43:43,318 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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_fillercodestructure_filler-pr-ci_file-48.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 d87c3660a424df0524cae67268a05b6384bd5fce4f180c391a8617728ea69ead --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:43:45,195 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:43:45,257 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 21:43:45,260 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:43:45,261 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:43:45,283 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:43:45,286 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:43:45,286 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:43:45,286 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:43:45,289 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:43:45,289 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:43:45,289 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:43:45,290 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:43:45,290 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:43:45,290 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:43:45,290 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:43:45,291 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:43:45,291 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:43:45,291 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:43:45,291 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:43:45,291 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:43:45,294 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:43:45,294 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:43:45,294 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 21:43:45,295 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 21:43:45,295 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:43:45,295 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 21:43:45,295 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:43:45,296 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:43:45,296 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:43:45,296 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:43:45,296 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:43:45,297 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:43:45,297 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:43:45,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:43:45,298 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:43:45,298 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:43:45,298 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:43:45,298 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 21:43:45,298 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 21:43:45,299 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:43:45,299 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:43:45,299 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:43:45,300 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:43:45,300 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> d87c3660a424df0524cae67268a05b6384bd5fce4f180c391a8617728ea69ead [2024-11-08 21:43:45,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:43:45,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:43:45,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:43:45,585 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:43:45,585 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:43:45,586 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-48.i [2024-11-08 21:43:47,305 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:43:47,557 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:43:47,558 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-48.i [2024-11-08 21:43:47,570 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4f3bf168/565e3076eaaa42938744231304de99c0/FLAG2fb9178d4 [2024-11-08 21:43:47,586 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4f3bf168/565e3076eaaa42938744231304de99c0 [2024-11-08 21:43:47,591 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:43:47,593 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:43:47,593 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:43:47,594 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:43:47,598 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:43:47,598 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:43:47" (1/1) ... [2024-11-08 21:43:47,599 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d396513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:43:47, skipping insertion in model container [2024-11-08 21:43:47,599 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:43:47" (1/1) ... [2024-11-08 21:43:47,623 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:43:47,778 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_fillercodestructure_filler-pr-ci_file-48.i[919,932] [2024-11-08 21:43:47,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:43:47,874 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:43:47,884 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_fillercodestructure_filler-pr-ci_file-48.i[919,932] [2024-11-08 21:43:47,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:43:47,957 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:43:47,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:43:47 WrapperNode [2024-11-08 21:43:47,958 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:43:47,959 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:43:47,959 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:43:47,959 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:43:47,965 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:43:47" (1/1) ... [2024-11-08 21:43:47,977 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:43:47" (1/1) ... [2024-11-08 21:43:48,016 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 206 [2024-11-08 21:43:48,017 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:43:48,018 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:43:48,021 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:43:48,021 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:43:48,031 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:43:47" (1/1) ... [2024-11-08 21:43:48,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:43:47" (1/1) ... [2024-11-08 21:43:48,036 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:43:47" (1/1) ... [2024-11-08 21:43:48,056 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]. [2024-11-08 21:43:48,058 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:43:47" (1/1) ... [2024-11-08 21:43:48,058 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:43:47" (1/1) ... [2024-11-08 21:43:48,069 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:43:47" (1/1) ... [2024-11-08 21:43:48,079 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:43:47" (1/1) ... [2024-11-08 21:43:48,082 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:43:47" (1/1) ... [2024-11-08 21:43:48,085 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:43:47" (1/1) ... [2024-11-08 21:43:48,092 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:43:48,097 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:43:48,097 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:43:48,097 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:43:48,098 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:43:47" (1/1) ... [2024-11-08 21:43:48,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:43:48,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:43:48,126 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) [2024-11-08 21:43:48,132 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 [2024-11-08 21:43:48,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:43:48,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 21:43:48,163 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:43:48,163 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:43:48,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:43:48,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:43:48,245 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:43:48,247 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:44:12,135 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-08 21:44:12,135 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:44:12,151 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:44:12,151 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:44:12,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:44:12 BoogieIcfgContainer [2024-11-08 21:44:12,151 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:44:12,153 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:44:12,153 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:44:12,159 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:44:12,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:43:47" (1/3) ... [2024-11-08 21:44:12,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4907748d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:44:12, skipping insertion in model container [2024-11-08 21:44:12,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:43:47" (2/3) ... [2024-11-08 21:44:12,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4907748d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:44:12, skipping insertion in model container [2024-11-08 21:44:12,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:44:12" (3/3) ... [2024-11-08 21:44:12,165 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-48.i [2024-11-08 21:44:12,177 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:44:12,178 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:44:12,221 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:44:12,226 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;@5df09c94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:44:12,226 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:44:12,229 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 60 states have internal predecessors, (85), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 21:44:12,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-08 21:44:12,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:44:12,240 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:44:12,241 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:44:12,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:44:12,246 INFO L85 PathProgramCache]: Analyzing trace with hash 89355840, now seen corresponding path program 1 times [2024-11-08 21:44:12,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:44:12,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1792261884] [2024-11-08 21:44:12,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:44:12,256 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 [2024-11-08 21:44:12,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:44:12,259 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) [2024-11-08 21:44:12,261 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 [2024-11-08 21:44:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:44:13,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 21:44:13,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:44:13,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 440 proven. 0 refuted. 0 times theorem prover too weak. 1184 trivial. 0 not checked. [2024-11-08 21:44:13,757 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:44:13,758 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:44:13,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1792261884] [2024-11-08 21:44:13,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1792261884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:44:13,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:44:13,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:44:13,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213156465] [2024-11-08 21:44:13,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:44:13,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:44:13,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:44:13,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:44:13,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:44:13,803 INFO L87 Difference]: Start difference. First operand has 91 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 60 states have internal predecessors, (85), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-08 21:44:13,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:44:13,846 INFO L93 Difference]: Finished difference Result 174 states and 307 transitions. [2024-11-08 21:44:13,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:44:13,848 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 190 [2024-11-08 21:44:13,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:44:13,857 INFO L225 Difference]: With dead ends: 174 [2024-11-08 21:44:13,861 INFO L226 Difference]: Without dead ends: 86 [2024-11-08 21:44:13,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:44:13,866 INFO L432 NwaCegarLoop]: 131 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, 131 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 [2024-11-08 21:44:13,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:44:13,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-08 21:44:13,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-08 21:44:13,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 55 states have internal predecessors, (73), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 21:44:13,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 131 transitions. [2024-11-08 21:44:13,928 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 131 transitions. Word has length 190 [2024-11-08 21:44:13,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:44:13,928 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 131 transitions. [2024-11-08 21:44:13,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-08 21:44:13,928 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 131 transitions. [2024-11-08 21:44:13,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-08 21:44:13,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:44:13,932 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:44:13,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 21:44:14,132 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 [2024-11-08 21:44:14,132 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:44:14,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:44:14,133 INFO L85 PathProgramCache]: Analyzing trace with hash 905288289, now seen corresponding path program 1 times [2024-11-08 21:44:14,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:44:14,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [804304997] [2024-11-08 21:44:14,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:44:14,134 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 [2024-11-08 21:44:14,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:44:14,136 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) [2024-11-08 21:44:14,140 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 [2024-11-08 21:44:15,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:44:15,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 21:44:15,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:44:16,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 378 proven. 9 refuted. 0 times theorem prover too weak. 1237 trivial. 0 not checked. [2024-11-08 21:44:16,799 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:44:20,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 75 proven. 9 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-08 21:44:20,118 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:44:20,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [804304997] [2024-11-08 21:44:20,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [804304997] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 21:44:20,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 21:44:20,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-08 21:44:20,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957355830] [2024-11-08 21:44:20,119 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 21:44:20,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 21:44:20,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:44:20,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 21:44:20,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:44:20,124 INFO L87 Difference]: Start difference. First operand 86 states and 131 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-08 21:44:23,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:44:23,610 INFO L93 Difference]: Finished difference Result 177 states and 266 transitions. [2024-11-08 21:44:23,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 21:44:23,611 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 191 [2024-11-08 21:44:23,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:44:23,613 INFO L225 Difference]: With dead ends: 177 [2024-11-08 21:44:23,613 INFO L226 Difference]: Without dead ends: 94 [2024-11-08 21:44:23,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 374 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-08 21:44:23,614 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 140 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:44:23,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 230 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-08 21:44:23,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-08 21:44:23,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2024-11-08 21:44:23,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 58 states have (on average 1.293103448275862) internal successors, (75), 58 states have internal predecessors, (75), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 21:44:23,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 133 transitions. [2024-11-08 21:44:23,625 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 133 transitions. Word has length 191 [2024-11-08 21:44:23,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:44:23,626 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 133 transitions. [2024-11-08 21:44:23,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-08 21:44:23,626 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 133 transitions. [2024-11-08 21:44:23,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-08 21:44:23,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:44:23,628 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:44:23,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-08 21:44:23,832 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 [2024-11-08 21:44:23,833 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:44:23,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:44:23,833 INFO L85 PathProgramCache]: Analyzing trace with hash -683059613, now seen corresponding path program 1 times [2024-11-08 21:44:23,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:44:23,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1727366226] [2024-11-08 21:44:23,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:44:23,834 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 [2024-11-08 21:44:23,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:44:23,836 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) [2024-11-08 21:44:23,837 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 [2024-11-08 21:44:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:44:25,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 21:44:25,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:44:25,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-08 21:44:25,664 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:44:25,664 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:44:25,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1727366226] [2024-11-08 21:44:25,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1727366226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:44:25,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:44:25,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:44:25,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328740086] [2024-11-08 21:44:25,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:44:25,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:44:25,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:44:25,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:44:25,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:44:25,670 INFO L87 Difference]: Start difference. First operand 90 states and 133 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:44:30,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:44:34,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:44:34,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:44:34,646 INFO L93 Difference]: Finished difference Result 206 states and 306 transitions. [2024-11-08 21:44:34,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:44:34,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2024-11-08 21:44:34,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:44:34,651 INFO L225 Difference]: With dead ends: 206 [2024-11-08 21:44:34,651 INFO L226 Difference]: Without dead ends: 119 [2024-11-08 21:44:34,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:44:34,657 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 27 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 10 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:44:34,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 236 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 19 Invalid, 2 Unknown, 0 Unchecked, 9.0s Time] [2024-11-08 21:44:34,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-08 21:44:34,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 105. [2024-11-08 21:44:34,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 73 states have (on average 1.3013698630136987) internal successors, (95), 73 states have internal predecessors, (95), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 21:44:34,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 153 transitions. [2024-11-08 21:44:34,694 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 153 transitions. Word has length 191 [2024-11-08 21:44:34,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:44:34,695 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 153 transitions. [2024-11-08 21:44:34,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:44:34,695 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 153 transitions. [2024-11-08 21:44:34,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-08 21:44:34,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:44:34,697 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:44:34,760 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 [2024-11-08 21:44:34,901 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 [2024-11-08 21:44:34,902 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:44:34,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:44:34,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1386139295, now seen corresponding path program 1 times [2024-11-08 21:44:34,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:44:34,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1543588902] [2024-11-08 21:44:34,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:44:34,903 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 [2024-11-08 21:44:34,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:44:34,906 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) [2024-11-08 21:44:34,907 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 [2024-11-08 21:44:36,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:44:36,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 21:44:36,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:44:38,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 534 proven. 15 refuted. 0 times theorem prover too weak. 1075 trivial. 0 not checked. [2024-11-08 21:44:38,893 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:44:43,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 69 proven. 15 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-08 21:44:43,067 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:44:43,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1543588902] [2024-11-08 21:44:43,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1543588902] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 21:44:43,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 21:44:43,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-08 21:44:43,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311010763] [2024-11-08 21:44:43,068 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 21:44:43,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 21:44:43,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:44:43,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 21:44:43,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:44:43,070 INFO L87 Difference]: Start difference. First operand 105 states and 153 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-08 21:44:47,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:44:47,065 INFO L93 Difference]: Finished difference Result 217 states and 312 transitions. [2024-11-08 21:44:47,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 21:44:47,072 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 191 [2024-11-08 21:44:47,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:44:47,075 INFO L225 Difference]: With dead ends: 217 [2024-11-08 21:44:47,077 INFO L226 Difference]: Without dead ends: 115 [2024-11-08 21:44:47,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 374 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-08 21:44:47,079 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 115 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-08 21:44:47,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 229 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-08 21:44:47,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-08 21:44:47,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 109. [2024-11-08 21:44:47,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 76 states have (on average 1.2763157894736843) internal successors, (97), 76 states have internal predecessors, (97), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-08 21:44:47,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 155 transitions. [2024-11-08 21:44:47,096 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 155 transitions. Word has length 191 [2024-11-08 21:44:47,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:44:47,096 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 155 transitions. [2024-11-08 21:44:47,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-08 21:44:47,097 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 155 transitions. [2024-11-08 21:44:47,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-08 21:44:47,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:44:47,099 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:44:47,139 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 (5)] Forceful destruction successful, exit code 0 [2024-11-08 21:44:47,302 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 [2024-11-08 21:44:47,303 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:44:47,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:44:47,304 INFO L85 PathProgramCache]: Analyzing trace with hash 388868067, now seen corresponding path program 1 times [2024-11-08 21:44:47,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:44:47,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [996947187] [2024-11-08 21:44:47,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:44:47,305 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 [2024-11-08 21:44:47,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:44:47,309 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) [2024-11-08 21:44:47,310 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 [2024-11-08 21:44:48,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:44:48,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 21:44:48,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:44:56,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-08 21:44:56,709 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:44:56,709 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:44:56,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [996947187] [2024-11-08 21:44:56,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [996947187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:44:56,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:44:56,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:44:56,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998579964] [2024-11-08 21:44:56,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:44:56,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:44:56,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:44:56,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:44:56,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:44:56,712 INFO L87 Difference]: Start difference. First operand 109 states and 155 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:45:01,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.40s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:45:05,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:45:05,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:45:05,522 INFO L93 Difference]: Finished difference Result 320 states and 457 transitions. [2024-11-08 21:45:05,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:45:05,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 191 [2024-11-08 21:45:05,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:45:05,527 INFO L225 Difference]: With dead ends: 320 [2024-11-08 21:45:05,527 INFO L226 Difference]: Without dead ends: 214 [2024-11-08 21:45:05,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:45:05,536 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 23 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2024-11-08 21:45:05,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 247 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 2 Unknown, 0 Unchecked, 8.8s Time] [2024-11-08 21:45:05,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-08 21:45:05,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2024-11-08 21:45:05,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 147 states have (on average 1.2653061224489797) internal successors, (186), 147 states have internal predecessors, (186), 58 states have call successors, (58), 6 states have call predecessors, (58), 6 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-08 21:45:05,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 302 transitions. [2024-11-08 21:45:05,589 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 302 transitions. Word has length 191 [2024-11-08 21:45:05,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:45:05,589 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 302 transitions. [2024-11-08 21:45:05,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-08 21:45:05,589 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 302 transitions. [2024-11-08 21:45:05,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-08 21:45:05,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:45:05,591 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:45:05,629 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 [2024-11-08 21:45:05,793 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 [2024-11-08 21:45:05,794 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:45:05,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:45:05,795 INFO L85 PathProgramCache]: Analyzing trace with hash -774642880, now seen corresponding path program 1 times [2024-11-08 21:45:05,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:45:05,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [173135492] [2024-11-08 21:45:05,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:45:05,796 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 [2024-11-08 21:45:05,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:45:05,797 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) [2024-11-08 21:45:05,798 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 [2024-11-08 21:45:07,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:45:07,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-08 21:45:07,306 INFO L278 TraceCheckSpWp]: Computing forward predicates...