./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-68.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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-pe-co_file-68.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 eddbc0be99e491b41b2298c61aa505690328b3f202a7871e81ba45da2de325f2 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 03:14:25,301 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 03:14:25,410 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 03:14:25,417 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 03:14:25,418 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 03:14:25,449 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 03:14:25,450 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 03:14:25,450 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 03:14:25,451 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 03:14:25,451 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 03:14:25,452 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 03:14:25,452 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 03:14:25,453 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 03:14:25,456 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 03:14:25,456 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 03:14:25,457 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 03:14:25,457 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 03:14:25,457 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 03:14:25,458 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 03:14:25,458 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 03:14:25,458 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 03:14:25,459 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 03:14:25,459 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 03:14:25,459 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 03:14:25,463 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 03:14:25,463 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 03:14:25,464 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 03:14:25,464 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 03:14:25,464 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 03:14:25,464 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 03:14:25,465 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 03:14:25,465 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 03:14:25,465 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:14:25,465 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 03:14:25,466 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 03:14:25,466 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 03:14:25,466 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 03:14:25,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 03:14:25,469 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 03:14:25,469 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 03:14:25,469 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 03:14:25,470 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 03:14:25,470 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 -> eddbc0be99e491b41b2298c61aa505690328b3f202a7871e81ba45da2de325f2 [2024-11-12 03:14:25,733 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 03:14:25,762 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 03:14:25,767 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 03:14:25,768 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 03:14:25,769 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 03:14:25,770 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-pe-co_file-68.i [2024-11-12 03:14:27,303 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 03:14:27,501 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 03:14:27,502 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-68.i [2024-11-12 03:14:27,518 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/491ec5633/4d1a2a96a6704431a8273ea2deb1e4c4/FLAG4c7308ae8 [2024-11-12 03:14:27,875 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/491ec5633/4d1a2a96a6704431a8273ea2deb1e4c4 [2024-11-12 03:14:27,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 03:14:27,880 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 03:14:27,881 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 03:14:27,881 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 03:14:27,886 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 03:14:27,886 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:14:27" (1/1) ... [2024-11-12 03:14:27,887 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d294e5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:14:27, skipping insertion in model container [2024-11-12 03:14:27,887 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:14:27" (1/1) ... [2024-11-12 03:14:27,922 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 03:14:28,084 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-pe-co_file-68.i[919,932] [2024-11-12 03:14:28,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:14:28,215 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 03:14:28,224 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-pe-co_file-68.i[919,932] [2024-11-12 03:14:28,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:14:28,274 INFO L204 MainTranslator]: Completed translation [2024-11-12 03:14:28,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:14:28 WrapperNode [2024-11-12 03:14:28,275 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 03:14:28,276 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 03:14:28,277 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 03:14:28,277 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 03:14:28,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:14:28" (1/1) ... [2024-11-12 03:14:28,292 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:14:28" (1/1) ... [2024-11-12 03:14:28,330 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 239 [2024-11-12 03:14:28,330 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 03:14:28,331 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 03:14:28,331 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 03:14:28,331 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 03:14:28,341 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:14:28" (1/1) ... [2024-11-12 03:14:28,341 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:14:28" (1/1) ... [2024-11-12 03:14:28,345 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:14:28" (1/1) ... [2024-11-12 03:14:28,368 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-12 03:14:28,369 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:14:28" (1/1) ... [2024-11-12 03:14:28,369 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:14:28" (1/1) ... [2024-11-12 03:14:28,390 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:14:28" (1/1) ... [2024-11-12 03:14:28,401 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:14:28" (1/1) ... [2024-11-12 03:14:28,409 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:14:28" (1/1) ... [2024-11-12 03:14:28,414 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:14:28" (1/1) ... [2024-11-12 03:14:28,423 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 03:14:28,424 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 03:14:28,424 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 03:14:28,424 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 03:14:28,425 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:14:28" (1/1) ... [2024-11-12 03:14:28,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:14:28,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:14:28,464 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-12 03:14:28,467 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-12 03:14:28,518 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 03:14:28,519 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 03:14:28,520 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 03:14:28,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 03:14:28,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 03:14:28,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 03:14:28,623 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 03:14:28,624 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 03:14:29,075 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-11-12 03:14:29,075 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 03:14:29,094 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 03:14:29,096 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 03:14:29,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:14:29 BoogieIcfgContainer [2024-11-12 03:14:29,097 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 03:14:29,099 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 03:14:29,100 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 03:14:29,103 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 03:14:29,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 03:14:27" (1/3) ... [2024-11-12 03:14:29,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e8de48e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:14:29, skipping insertion in model container [2024-11-12 03:14:29,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:14:28" (2/3) ... [2024-11-12 03:14:29,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e8de48e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:14:29, skipping insertion in model container [2024-11-12 03:14:29,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:14:29" (3/3) ... [2024-11-12 03:14:29,106 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-68.i [2024-11-12 03:14:29,124 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 03:14:29,124 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 03:14:29,191 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 03:14:29,198 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;@4a4b5305, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 03:14:29,198 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 03:14:29,203 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 76 states have (on average 1.486842105263158) internal successors, (113), 77 states have internal predecessors, (113), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 03:14:29,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-12 03:14:29,220 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:14:29,221 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:14:29,221 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:14:29,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:14:29,227 INFO L85 PathProgramCache]: Analyzing trace with hash 479502011, now seen corresponding path program 1 times [2024-11-12 03:14:29,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:14:29,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992993612] [2024-11-12 03:14:29,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:14:29,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:14:29,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:29,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:14:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:29,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:14:29,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:29,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:14:29,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:29,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:14:29,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:29,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:14:29,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:29,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:14:29,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:29,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 03:14:29,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:29,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:14:29,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:29,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:14:29,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:29,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 03:14:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:29,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:14:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:29,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 03:14:29,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:29,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:14:29,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:29,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 03:14:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:29,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 03:14:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:29,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 03:14:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:29,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 03:14:29,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:29,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 03:14:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:29,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 03:14:29,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:29,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 03:14:29,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:29,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 03:14:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:29,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 03:14:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:29,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 03:14:29,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:29,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 03:14:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:29,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 03:14:29,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:14:29,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992993612] [2024-11-12 03:14:29,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992993612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:14:29,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:14:29,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 03:14:29,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032385675] [2024-11-12 03:14:29,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:14:29,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 03:14:29,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:14:29,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 03:14:29,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 03:14:29,883 INFO L87 Difference]: Start difference. First operand has 103 states, 76 states have (on average 1.486842105263158) internal successors, (113), 77 states have internal predecessors, (113), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-12 03:14:29,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:14:29,927 INFO L93 Difference]: Finished difference Result 197 states and 338 transitions. [2024-11-12 03:14:29,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 03:14:29,930 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 167 [2024-11-12 03:14:29,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:14:29,942 INFO L225 Difference]: With dead ends: 197 [2024-11-12 03:14:29,942 INFO L226 Difference]: Without dead ends: 97 [2024-11-12 03:14:29,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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-12 03:14:29,955 INFO L435 NwaCegarLoop]: 150 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, 150 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-12 03:14:29,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 03:14:29,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-12 03:14:30,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-12 03:14:30,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 71 states have internal predecessors, (102), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 03:14:30,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 150 transitions. [2024-11-12 03:14:30,020 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 150 transitions. Word has length 167 [2024-11-12 03:14:30,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:14:30,021 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 150 transitions. [2024-11-12 03:14:30,021 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-12 03:14:30,022 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 150 transitions. [2024-11-12 03:14:30,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-12 03:14:30,026 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:14:30,026 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:14:30,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 03:14:30,027 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:14:30,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:14:30,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1448695877, now seen corresponding path program 1 times [2024-11-12 03:14:30,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:14:30,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148259388] [2024-11-12 03:14:30,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:14:30,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:14:30,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:30,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:14:30,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:30,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:14:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:30,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:14:30,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:30,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:14:30,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:30,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:14:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:30,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:14:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:30,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 03:14:30,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:30,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:14:30,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:30,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:14:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:30,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 03:14:30,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:30,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:14:30,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:30,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 03:14:30,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:30,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:14:30,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:30,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 03:14:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:30,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 03:14:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:30,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 03:14:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:30,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 03:14:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:30,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 03:14:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:30,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 03:14:30,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:30,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 03:14:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:30,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 03:14:30,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:30,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 03:14:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:30,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 03:14:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:30,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 03:14:30,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:30,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 03:14:30,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:14:30,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148259388] [2024-11-12 03:14:30,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148259388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:14:30,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:14:30,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 03:14:30,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427505292] [2024-11-12 03:14:30,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:14:30,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 03:14:30,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:14:30,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 03:14:30,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 03:14:30,546 INFO L87 Difference]: Start difference. First operand 97 states and 150 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 03:14:30,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:14:30,737 INFO L93 Difference]: Finished difference Result 191 states and 297 transitions. [2024-11-12 03:14:30,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 03:14:30,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 167 [2024-11-12 03:14:30,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:14:30,741 INFO L225 Difference]: With dead ends: 191 [2024-11-12 03:14:30,741 INFO L226 Difference]: Without dead ends: 97 [2024-11-12 03:14:30,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 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-12 03:14:30,743 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 142 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 03:14:30,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 216 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 03:14:30,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-12 03:14:30,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-12 03:14:30,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 71 states have (on average 1.4225352112676057) internal successors, (101), 71 states have internal predecessors, (101), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 03:14:30,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 149 transitions. [2024-11-12 03:14:30,758 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 149 transitions. Word has length 167 [2024-11-12 03:14:30,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:14:30,760 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 149 transitions. [2024-11-12 03:14:30,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 03:14:30,761 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 149 transitions. [2024-11-12 03:14:30,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-12 03:14:30,763 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:14:30,764 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:14:30,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 03:14:30,764 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:14:30,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:14:30,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1463140800, now seen corresponding path program 1 times [2024-11-12 03:14:30,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:14:30,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067193340] [2024-11-12 03:14:30,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:14:30,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:14:30,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:31,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:14:31,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:31,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:14:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:31,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:14:31,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:31,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:14:31,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:31,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:14:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:31,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:14:31,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:31,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 03:14:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:31,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:14:31,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:31,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:14:31,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:31,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 03:14:31,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:31,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:14:31,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:31,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 03:14:31,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:31,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:14:31,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:31,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 03:14:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:31,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 03:14:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:31,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 03:14:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:31,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 03:14:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:31,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 03:14:31,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:31,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 03:14:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:31,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 03:14:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:31,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 03:14:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:31,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 03:14:31,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:31,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 03:14:31,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:31,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 03:14:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:31,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 03:14:31,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:14:31,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067193340] [2024-11-12 03:14:31,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067193340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:14:31,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:14:31,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 03:14:31,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757000252] [2024-11-12 03:14:31,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:14:31,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 03:14:31,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:14:31,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 03:14:31,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-12 03:14:31,322 INFO L87 Difference]: Start difference. First operand 97 states and 149 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 03:14:31,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:14:31,900 INFO L93 Difference]: Finished difference Result 284 states and 441 transitions. [2024-11-12 03:14:31,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 03:14:31,901 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 168 [2024-11-12 03:14:31,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:14:31,904 INFO L225 Difference]: With dead ends: 284 [2024-11-12 03:14:31,904 INFO L226 Difference]: Without dead ends: 190 [2024-11-12 03:14:31,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-12 03:14:31,906 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 276 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 03:14:31,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 691 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 03:14:31,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-12 03:14:31,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 101. [2024-11-12 03:14:31,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 75 states have (on average 1.44) internal successors, (108), 75 states have internal predecessors, (108), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 03:14:31,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 156 transitions. [2024-11-12 03:14:31,923 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 156 transitions. Word has length 168 [2024-11-12 03:14:31,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:14:31,924 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 156 transitions. [2024-11-12 03:14:31,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 03:14:31,925 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 156 transitions. [2024-11-12 03:14:31,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-12 03:14:31,931 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:14:31,933 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:14:31,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 03:14:31,934 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:14:31,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:14:31,935 INFO L85 PathProgramCache]: Analyzing trace with hash 653794174, now seen corresponding path program 1 times [2024-11-12 03:14:31,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:14:31,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919383805] [2024-11-12 03:14:31,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:14:31,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:14:32,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:32,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:14:32,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:32,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:14:32,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:32,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:14:32,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:32,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:14:32,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:32,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:14:32,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:32,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:14:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:32,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 03:14:32,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:32,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:14:32,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:32,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:14:32,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:32,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 03:14:32,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:32,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:14:32,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:32,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 03:14:32,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:32,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:14:32,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:32,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 03:14:32,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:32,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 03:14:32,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:32,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 03:14:32,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:32,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 03:14:32,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:32,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 03:14:32,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:32,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 03:14:32,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:32,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 03:14:32,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:32,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 03:14:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:32,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 03:14:32,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:32,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 03:14:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:32,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 03:14:32,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:32,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 03:14:32,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:14:32,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919383805] [2024-11-12 03:14:32,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919383805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:14:32,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:14:32,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 03:14:32,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810213359] [2024-11-12 03:14:32,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:14:32,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 03:14:32,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:14:32,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 03:14:32,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 03:14:32,895 INFO L87 Difference]: Start difference. First operand 101 states and 156 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 03:14:33,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:14:33,693 INFO L93 Difference]: Finished difference Result 422 states and 649 transitions. [2024-11-12 03:14:33,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 03:14:33,693 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 168 [2024-11-12 03:14:33,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:14:33,699 INFO L225 Difference]: With dead ends: 422 [2024-11-12 03:14:33,700 INFO L226 Difference]: Without dead ends: 324 [2024-11-12 03:14:33,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-12 03:14:33,702 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 380 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 03:14:33,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 715 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 03:14:33,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-11-12 03:14:33,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 217. [2024-11-12 03:14:33,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 156 states have (on average 1.3653846153846154) internal successors, (213), 157 states have internal predecessors, (213), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-12 03:14:33,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 325 transitions. [2024-11-12 03:14:33,742 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 325 transitions. Word has length 168 [2024-11-12 03:14:33,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:14:33,743 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 325 transitions. [2024-11-12 03:14:33,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 03:14:33,743 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 325 transitions. [2024-11-12 03:14:33,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-12 03:14:33,763 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:14:33,763 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:14:33,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 03:14:33,764 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:14:33,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:14:33,764 INFO L85 PathProgramCache]: Analyzing trace with hash -241875648, now seen corresponding path program 1 times [2024-11-12 03:14:33,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:14:33,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332746213] [2024-11-12 03:14:33,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:14:33,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:14:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:34,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:14:34,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:34,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:14:34,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:34,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 03:14:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:34,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:14:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:34,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:14:34,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:34,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 03:14:34,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:34,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 03:14:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:34,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:14:34,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:34,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:14:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:34,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 03:14:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:34,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:14:34,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:34,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 03:14:34,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:34,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:14:34,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:34,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 03:14:34,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:34,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 03:14:34,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:34,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 03:14:34,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:34,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 03:14:34,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:34,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 03:14:34,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:34,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 03:14:34,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:34,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 03:14:34,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:34,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 03:14:34,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:34,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 03:14:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:34,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 03:14:34,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:34,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 03:14:34,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:34,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-12 03:14:34,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:14:34,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332746213] [2024-11-12 03:14:34,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332746213] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 03:14:34,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776851931] [2024-11-12 03:14:34,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:14:34,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:14:34,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:14:34,290 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-12 03:14:34,292 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-12 03:14:34,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:34,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 03:14:34,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:14:34,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 218 proven. 120 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2024-11-12 03:14:34,870 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 03:14:35,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-12 03:14:35,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776851931] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 03:14:35,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 03:14:35,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 13 [2024-11-12 03:14:35,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712989590] [2024-11-12 03:14:35,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 03:14:35,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 03:14:35,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:14:35,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 03:14:35,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-11-12 03:14:35,166 INFO L87 Difference]: Start difference. First operand 217 states and 325 transitions. Second operand has 13 states, 13 states have (on average 8.076923076923077) internal successors, (105), 13 states have internal predecessors, (105), 3 states have call successors, (45), 3 states have call predecessors, (45), 5 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) [2024-11-12 03:14:36,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:14:36,212 INFO L93 Difference]: Finished difference Result 683 states and 994 transitions. [2024-11-12 03:14:36,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-12 03:14:36,213 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 8.076923076923077) internal successors, (105), 13 states have internal predecessors, (105), 3 states have call successors, (45), 3 states have call predecessors, (45), 5 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) Word has length 169 [2024-11-12 03:14:36,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:14:36,218 INFO L225 Difference]: With dead ends: 683 [2024-11-12 03:14:36,218 INFO L226 Difference]: Without dead ends: 585 [2024-11-12 03:14:36,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 383 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=399, Invalid=1007, Unknown=0, NotChecked=0, Total=1406 [2024-11-12 03:14:36,220 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 712 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 03:14:36,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 1159 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 03:14:36,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-12 03:14:36,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 457. [2024-11-12 03:14:36,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 349 states have (on average 1.3667621776504297) internal successors, (477), 352 states have internal predecessors, (477), 90 states have call successors, (90), 17 states have call predecessors, (90), 17 states have return successors, (90), 87 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-12 03:14:36,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 657 transitions. [2024-11-12 03:14:36,283 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 657 transitions. Word has length 169 [2024-11-12 03:14:36,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:14:36,284 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 657 transitions. [2024-11-12 03:14:36,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.076923076923077) internal successors, (105), 13 states have internal predecessors, (105), 3 states have call successors, (45), 3 states have call predecessors, (45), 5 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) [2024-11-12 03:14:36,284 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 657 transitions. [2024-11-12 03:14:36,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-12 03:14:36,286 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:14:36,286 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:14:36,307 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-12 03:14:36,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:14:36,493 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:14:36,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:14:36,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1262944002, now seen corresponding path program 1 times [2024-11-12 03:14:36,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:14:36,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374892365] [2024-11-12 03:14:36,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:14:36,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:14:36,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 03:14:36,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1202331494] [2024-11-12 03:14:36,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:14:36,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:14:36,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:14:36,578 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-12 03:14:36,580 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-12 03:14:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 03:14:36,749 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 03:14:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 03:14:36,936 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 03:14:36,936 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 03:14:36,937 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 03:14:36,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-12 03:14:37,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-12 03:14:37,143 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-12 03:14:37,267 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 03:14:37,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 03:14:37 BoogieIcfgContainer [2024-11-12 03:14:37,270 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 03:14:37,271 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 03:14:37,271 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 03:14:37,271 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 03:14:37,272 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:14:29" (3/4) ... [2024-11-12 03:14:37,274 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 03:14:37,275 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 03:14:37,276 INFO L158 Benchmark]: Toolchain (without parser) took 9396.81ms. Allocated memory was 167.8MB in the beginning and 274.7MB in the end (delta: 107.0MB). Free memory was 112.0MB in the beginning and 136.9MB in the end (delta: -25.0MB). Peak memory consumption was 81.5MB. Max. memory is 16.1GB. [2024-11-12 03:14:37,276 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 102.8MB. Free memory is still 55.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 03:14:37,277 INFO L158 Benchmark]: CACSL2BoogieTranslator took 394.07ms. Allocated memory is still 167.8MB. Free memory was 112.0MB in the beginning and 133.1MB in the end (delta: -21.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 03:14:37,277 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.48ms. Allocated memory is still 167.8MB. Free memory was 133.1MB in the beginning and 128.2MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 03:14:37,277 INFO L158 Benchmark]: Boogie Preprocessor took 92.08ms. Allocated memory is still 167.8MB. Free memory was 128.2MB in the beginning and 122.7MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 03:14:37,277 INFO L158 Benchmark]: RCFGBuilder took 672.95ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 92.5MB in the end (delta: 30.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-12 03:14:37,278 INFO L158 Benchmark]: TraceAbstraction took 8171.09ms. Allocated memory was 167.8MB in the beginning and 274.7MB in the end (delta: 107.0MB). Free memory was 92.0MB in the beginning and 138.0MB in the end (delta: -46.0MB). Peak memory consumption was 63.0MB. Max. memory is 16.1GB. [2024-11-12 03:14:37,278 INFO L158 Benchmark]: Witness Printer took 4.56ms. Allocated memory is still 274.7MB. Free memory was 138.0MB in the beginning and 136.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 03:14:37,279 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.22ms. Allocated memory is still 102.8MB. Free memory is still 55.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 394.07ms. Allocated memory is still 167.8MB. Free memory was 112.0MB in the beginning and 133.1MB in the end (delta: -21.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.48ms. Allocated memory is still 167.8MB. Free memory was 133.1MB in the beginning and 128.2MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 92.08ms. Allocated memory is still 167.8MB. Free memory was 128.2MB in the beginning and 122.7MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 672.95ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 92.5MB in the end (delta: 30.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8171.09ms. Allocated memory was 167.8MB in the beginning and 274.7MB in the end (delta: 107.0MB). Free memory was 92.0MB in the beginning and 138.0MB in the end (delta: -46.0MB). Peak memory consumption was 63.0MB. Max. memory is 16.1GB. * Witness Printer took 4.56ms. Allocated memory is still 274.7MB. Free memory was 138.0MB in the beginning and 136.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 182, overapproximation of someBinaryFLOATComparisonOperation at line 182. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_5 = 0; [L24] unsigned char var_1_6 = 0; [L25] unsigned char var_1_7 = 1; [L26] unsigned char var_1_8 = 32; [L27] double var_1_9 = 4.6; [L28] double var_1_10 = 9.25; [L29] double var_1_11 = 1.25; [L30] unsigned char var_1_12 = 100; [L31] unsigned char var_1_13 = 64; [L32] unsigned char var_1_14 = 0; [L33] float var_1_15 = 7.5; [L34] signed long int var_1_16 = 0; [L35] unsigned char var_1_17 = 1; [L36] unsigned char var_1_18 = 0; [L37] unsigned char var_1_20 = 0; [L38] double var_1_21 = 4.65; [L39] double var_1_23 = 9999999999.1; [L40] double var_1_24 = 5.5; [L41] unsigned short int var_1_25 = 16; [L42] signed long int var_1_27 = 32; [L43] signed char var_1_31 = 32; [L44] signed char var_1_32 = 32; [L45] signed short int var_1_33 = 100; [L46] unsigned char var_1_34 = 1; [L47] double var_1_35 = 3.8; [L48] unsigned char var_1_36 = 0; [L49] signed short int var_1_37 = -256; [L50] unsigned short int var_1_38 = 4; [L51] double last_1_var_1_9 = 4.6; [L52] unsigned char last_1_var_1_12 = 100; [L53] unsigned char last_1_var_1_14 = 0; [L54] signed long int last_1_var_1_16 = 0; VAL [isInitial=0, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L186] isInitial = 1 [L187] FCALL initially() [L188] COND TRUE 1 [L189] CALL updateLastVariables() [L176] last_1_var_1_9 = var_1_9 [L177] last_1_var_1_12 = var_1_12 [L178] last_1_var_1_14 = var_1_14 [L179] last_1_var_1_16 = var_1_16 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L189] RET updateLastVariables() [L190] CALL updateVariables() [L137] var_1_5 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L138] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L139] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L139] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L140] var_1_7 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L141] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L142] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L142] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L143] var_1_8 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L144] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L145] CALL assume_abort_if_not(var_1_8 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L145] RET assume_abort_if_not(var_1_8 <= 255) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L146] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L146] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L147] var_1_10 = __VERIFIER_nondet_double() [L148] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L148] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L149] var_1_13 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L150] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L151] CALL assume_abort_if_not(var_1_13 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L151] RET assume_abort_if_not(var_1_13 <= 254) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L152] var_1_18 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L153] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L154] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L154] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L155] var_1_20 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L156] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L157] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L157] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L158] var_1_23 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L159] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_24=11/2, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L160] var_1_24 = __VERIFIER_nondet_double() [L161] CALL assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L161] RET assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=32, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L162] var_1_31 = __VERIFIER_nondet_char() [L163] CALL assume_abort_if_not(var_1_31 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L163] RET assume_abort_if_not(var_1_31 >= -127) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L164] CALL assume_abort_if_not(var_1_31 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L164] RET assume_abort_if_not(var_1_31 <= 127) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=32, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L165] var_1_32 = __VERIFIER_nondet_char() [L166] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L166] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L167] CALL assume_abort_if_not(var_1_32 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L167] RET assume_abort_if_not(var_1_32 <= 127) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_35=19/5, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L168] var_1_35 = __VERIFIER_nondet_double() [L169] CALL assume_abort_if_not((var_1_35 >= -922337.2036854776000e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854776000e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L169] RET assume_abort_if_not((var_1_35 >= -922337.2036854776000e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854776000e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L170] CALL assume_abort_if_not(var_1_35 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L170] RET assume_abort_if_not(var_1_35 != 0.0F) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=0, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L171] var_1_36 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_36 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L172] RET assume_abort_if_not(var_1_36 >= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L173] CALL assume_abort_if_not(var_1_36 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L173] RET assume_abort_if_not(var_1_36 <= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L190] RET updateVariables() [L191] CALL step() [L58] signed long int stepLocal_4 = last_1_var_1_16; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L59] COND FALSE !(\read(last_1_var_1_14)) [L70] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L72] var_1_16 = last_1_var_1_12 [L73] unsigned long int stepLocal_6 = var_1_13 % (5u + 256u); [L74] signed long int stepLocal_5 = var_1_13 + 16; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, stepLocal_5=16, stepLocal_6=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L75] COND TRUE stepLocal_6 <= var_1_16 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, stepLocal_5=16, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L76] COND FALSE !(stepLocal_5 >= var_1_16) [L79] var_1_14 = var_1_7 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L82] unsigned char stepLocal_0 = var_1_12; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_0=0, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L83] EXPR var_1_12 ^ var_1_12 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_0=0, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L83] COND TRUE stepLocal_0 <= (var_1_12 ^ var_1_12) [L84] var_1_1 = (! var_1_5) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L88] unsigned char stepLocal_2 = var_1_12 < (var_1_16 / var_1_8); [L89] signed long int stepLocal_1 = var_1_16; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_1=100, stepLocal_2=1, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L90] COND FALSE !(-256 >= stepLocal_1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_2=1, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L93] COND TRUE stepLocal_2 || ((var_1_5 && var_1_7) && var_1_1) [L94] var_1_6 = var_1_7 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L97] unsigned char stepLocal_3 = ! var_1_5; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_3=1, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L98] COND TRUE (var_1_7 && var_1_14) || stepLocal_3 [L99] var_1_11 = var_1_10 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L101] var_1_15 = var_1_10 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=-250, var_1_9=23/5] [L102] COND TRUE ((((((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) > (var_1_12)) ? (((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) : (var_1_12))) <= (50 * var_1_8) [L103] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=-250, var_1_9=2] [L105] var_1_17 = (var_1_18 || (var_1_6 && var_1_20)) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=-250, var_1_9=2] [L106] COND FALSE !(! var_1_14) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=16, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=-250, var_1_9=2] [L109] var_1_25 = var_1_12 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=0, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=-250, var_1_9=2] [L110] COND FALSE !(((((var_1_9) > (var_1_24)) ? (var_1_9) : (var_1_24))) > var_1_23) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=0, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=100, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=-250, var_1_9=2] [L123] var_1_33 = var_1_31 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=0, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=-250, var_1_9=2] [L124] COND FALSE !(var_1_31 >= var_1_32) [L129] var_1_34 = ((var_1_24 >= (var_1_11 / var_1_35)) || var_1_36) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=0, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=-250, var_1_9=2] [L131] EXPR var_1_12 | var_1_16 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=0, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=-250, var_1_9=2] [L131] EXPR var_1_12 ^ (var_1_12 | var_1_16) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=0, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=-250, var_1_9=2] [L131] EXPR var_1_31 ^ var_1_12 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=0, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=4, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=-250, var_1_9=2] [L131] COND FALSE !((var_1_12 ^ (var_1_12 | var_1_16)) < (var_1_31 ^ var_1_12)) [L134] var_1_38 = var_1_12 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=0, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=-250, var_1_9=2] [L191] RET step() [L192] CALL, EXPR property() [L182] EXPR var_1_12 ^ var_1_12 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=0, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=-250, var_1_9=2] [L182-L183] return ((((((((var_1_12 <= (var_1_12 ^ var_1_12)) ? (var_1_1 == ((unsigned char) (! var_1_5))) : (var_1_1 == ((unsigned char) (! var_1_5)))) && ((-256 >= var_1_16) ? (var_1_6 == ((unsigned char) (var_1_1 || var_1_7))) : (((var_1_12 < (var_1_16 / var_1_8)) || ((var_1_5 && var_1_7) && var_1_1)) ? (var_1_6 == ((unsigned char) var_1_7)) : 1))) && ((((((((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) > (var_1_12)) ? (((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) : (var_1_12))) <= (50 * var_1_8)) ? (var_1_9 == ((double) var_1_10)) : 1)) && (((var_1_7 && var_1_14) || (! var_1_5)) ? (var_1_11 == ((double) var_1_10)) : 1)) && (last_1_var_1_14 ? ((var_1_10 >= (- last_1_var_1_9)) ? ((var_1_8 != last_1_var_1_16) ? (var_1_12 == ((unsigned char) var_1_13)) : (var_1_12 == ((unsigned char) 50))) : (var_1_12 == ((unsigned char) var_1_13))) : (var_1_12 == ((unsigned char) var_1_13)))) && (((var_1_13 % (5u + 256u)) <= var_1_16) ? (((var_1_13 + 16) >= var_1_16) ? (var_1_14 == ((unsigned char) var_1_7)) : (var_1_14 == ((unsigned char) var_1_7))) : 1)) && (var_1_15 == ((float) var_1_10))) && (var_1_16 == ((signed long int) last_1_var_1_12)) ; [L192] RET, EXPR property() [L192] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=0, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=-250, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=2, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_25=0, var_1_27=32, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=1, var_1_36=1, var_1_37=-256, var_1_38=0, var_1_5=0, var_1_6=1, var_1_7=1, var_1_8=-250, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.0s, OverallIterations: 6, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1514 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1510 mSDsluCounter, 2931 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2155 mSDsCounter, 273 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1733 IncrementalHoareTripleChecker+Invalid, 2006 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 273 mSolverCounterUnsat, 776 mSDtfsCounter, 1733 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 671 GetRequests, 611 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=457occurred in iteration=5, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 324 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1346 NumberOfCodeBlocks, 1346 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1170 ConstructedInterpolants, 0 QuantifiedInterpolants, 2729 SizeOfPredicates, 1 NumberOfNonLiveVariables, 418 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 7482/7728 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-12 03:14:37,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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-pe-co_file-68.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 eddbc0be99e491b41b2298c61aa505690328b3f202a7871e81ba45da2de325f2 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 03:14:39,601 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 03:14:39,683 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 03:14:39,689 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 03:14:39,690 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 03:14:39,721 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 03:14:39,722 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 03:14:39,722 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 03:14:39,723 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 03:14:39,723 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 03:14:39,724 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 03:14:39,724 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 03:14:39,725 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 03:14:39,725 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 03:14:39,725 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 03:14:39,726 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 03:14:39,729 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 03:14:39,730 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 03:14:39,730 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 03:14:39,730 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 03:14:39,730 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 03:14:39,731 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 03:14:39,732 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 03:14:39,732 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 03:14:39,732 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 03:14:39,732 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 03:14:39,733 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 03:14:39,733 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 03:14:39,733 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 03:14:39,733 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 03:14:39,734 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 03:14:39,734 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 03:14:39,734 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 03:14:39,734 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 03:14:39,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:14:39,735 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 03:14:39,737 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 03:14:39,737 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 03:14:39,737 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 03:14:39,737 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 03:14:39,738 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 03:14:39,738 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 03:14:39,738 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 03:14:39,738 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 03:14:39,739 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 -> eddbc0be99e491b41b2298c61aa505690328b3f202a7871e81ba45da2de325f2 [2024-11-12 03:14:40,069 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 03:14:40,090 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 03:14:40,093 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 03:14:40,094 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 03:14:40,094 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 03:14:40,095 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-pe-co_file-68.i [2024-11-12 03:14:41,636 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 03:14:41,857 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 03:14:41,858 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-68.i [2024-11-12 03:14:41,869 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/892229e12/25d353b7797542f2aa20d435d32b6127/FLAG5d78b9b6b [2024-11-12 03:14:42,219 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/892229e12/25d353b7797542f2aa20d435d32b6127 [2024-11-12 03:14:42,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 03:14:42,222 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 03:14:42,225 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 03:14:42,225 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 03:14:42,230 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 03:14:42,230 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:14:42" (1/1) ... [2024-11-12 03:14:42,231 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@710bc217 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:14:42, skipping insertion in model container [2024-11-12 03:14:42,231 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:14:42" (1/1) ... [2024-11-12 03:14:42,263 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 03:14:42,454 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-pe-co_file-68.i[919,932] [2024-11-12 03:14:42,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:14:42,564 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 03:14:42,578 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-pe-co_file-68.i[919,932] [2024-11-12 03:14:42,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:14:42,650 INFO L204 MainTranslator]: Completed translation [2024-11-12 03:14:42,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:14:42 WrapperNode [2024-11-12 03:14:42,651 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 03:14:42,652 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 03:14:42,652 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 03:14:42,652 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 03:14:42,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:14:42" (1/1) ... [2024-11-12 03:14:42,677 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:14:42" (1/1) ... [2024-11-12 03:14:42,717 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 184 [2024-11-12 03:14:42,718 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 03:14:42,718 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 03:14:42,719 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 03:14:42,719 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 03:14:42,734 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:14:42" (1/1) ... [2024-11-12 03:14:42,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:14:42" (1/1) ... [2024-11-12 03:14:42,739 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:14:42" (1/1) ... [2024-11-12 03:14:42,758 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-12 03:14:42,761 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:14:42" (1/1) ... [2024-11-12 03:14:42,762 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:14:42" (1/1) ... [2024-11-12 03:14:42,777 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:14:42" (1/1) ... [2024-11-12 03:14:42,785 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:14:42" (1/1) ... [2024-11-12 03:14:42,790 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:14:42" (1/1) ... [2024-11-12 03:14:42,795 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:14:42" (1/1) ... [2024-11-12 03:14:42,799 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 03:14:42,800 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 03:14:42,800 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 03:14:42,800 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 03:14:42,805 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:14:42" (1/1) ... [2024-11-12 03:14:42,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:14:42,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:14:42,835 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-12 03:14:42,837 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-12 03:14:42,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 03:14:42,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 03:14:42,876 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 03:14:42,877 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 03:14:42,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 03:14:42,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 03:14:42,966 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 03:14:42,968 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 03:14:47,996 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-12 03:14:47,996 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 03:14:48,012 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 03:14:48,012 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 03:14:48,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:14:48 BoogieIcfgContainer [2024-11-12 03:14:48,015 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 03:14:48,016 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 03:14:48,017 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 03:14:48,020 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 03:14:48,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 03:14:42" (1/3) ... [2024-11-12 03:14:48,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@772bb6e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:14:48, skipping insertion in model container [2024-11-12 03:14:48,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:14:42" (2/3) ... [2024-11-12 03:14:48,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@772bb6e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:14:48, skipping insertion in model container [2024-11-12 03:14:48,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:14:48" (3/3) ... [2024-11-12 03:14:48,024 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-68.i [2024-11-12 03:14:48,055 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 03:14:48,055 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 03:14:48,117 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 03:14:48,123 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;@7e9f5f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 03:14:48,125 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 03:14:48,130 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 57 states have internal predecessors, (79), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 03:14:48,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-12 03:14:48,144 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:14:48,145 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:14:48,145 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:14:48,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:14:48,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1885384555, now seen corresponding path program 1 times [2024-11-12 03:14:48,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:14:48,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1999153455] [2024-11-12 03:14:48,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:14:48,168 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-12 03:14:48,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:14:48,169 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-12 03:14:48,189 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-12 03:14:49,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:49,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 03:14:49,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:14:49,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2024-11-12 03:14:49,137 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 03:14:49,138 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:14:49,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1999153455] [2024-11-12 03:14:49,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1999153455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:14:49,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:14:49,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 03:14:49,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297666555] [2024-11-12 03:14:49,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:14:49,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 03:14:49,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 03:14:49,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 03:14:49,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 03:14:49,171 INFO L87 Difference]: Start difference. First operand has 83 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 57 states have internal predecessors, (79), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-12 03:14:49,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:14:49,204 INFO L93 Difference]: Finished difference Result 159 states and 272 transitions. [2024-11-12 03:14:49,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 03:14:49,206 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 161 [2024-11-12 03:14:49,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:14:49,213 INFO L225 Difference]: With dead ends: 159 [2024-11-12 03:14:49,213 INFO L226 Difference]: Without dead ends: 79 [2024-11-12 03:14:49,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 160 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-12 03:14:49,219 INFO L435 NwaCegarLoop]: 120 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, 120 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-12 03:14:49,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 03:14:49,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-12 03:14:49,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-12 03:14:49,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 03:14:49,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 120 transitions. [2024-11-12 03:14:49,262 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 120 transitions. Word has length 161 [2024-11-12 03:14:49,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:14:49,263 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 120 transitions. [2024-11-12 03:14:49,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-12 03:14:49,264 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 120 transitions. [2024-11-12 03:14:49,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-12 03:14:49,267 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:14:49,267 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:14:49,286 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-12 03:14:49,468 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-12 03:14:49,468 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:14:49,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:14:49,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1322509931, now seen corresponding path program 1 times [2024-11-12 03:14:49,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:14:49,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [930283786] [2024-11-12 03:14:49,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:14:49,471 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-12 03:14:49,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:14:49,473 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-12 03:14:49,474 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-12 03:14:50,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:14:50,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 03:14:50,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:14:53,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 03:14:53,802 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 03:14:53,803 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:14:53,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [930283786] [2024-11-12 03:14:53,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [930283786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:14:53,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:14:53,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 03:14:53,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464257759] [2024-11-12 03:14:53,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:14:53,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 03:14:53,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 03:14:53,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 03:14:53,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-12 03:14:53,807 INFO L87 Difference]: Start difference. First operand 79 states and 120 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 03:15:00,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:15:00,792 INFO L93 Difference]: Finished difference Result 336 states and 513 transitions. [2024-11-12 03:15:00,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 03:15:00,800 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2024-11-12 03:15:00,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:15:00,804 INFO L225 Difference]: With dead ends: 336 [2024-11-12 03:15:00,805 INFO L226 Difference]: Without dead ends: 260 [2024-11-12 03:15:00,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-12 03:15:00,807 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 258 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-11-12 03:15:00,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 564 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2024-11-12 03:15:00,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-12 03:15:00,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 142. [2024-11-12 03:15:00,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 91 states have (on average 1.3296703296703296) internal successors, (121), 91 states have internal predecessors, (121), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-12 03:15:00,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 217 transitions. [2024-11-12 03:15:00,850 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 217 transitions. Word has length 161 [2024-11-12 03:15:00,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:15:00,855 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 217 transitions. [2024-11-12 03:15:00,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 03:15:00,856 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 217 transitions. [2024-11-12 03:15:00,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-12 03:15:00,860 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:15:00,861 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:15:00,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 03:15:01,061 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-12 03:15:01,062 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:15:01,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:15:01,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1283513623, now seen corresponding path program 1 times [2024-11-12 03:15:01,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:15:01,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1648335154] [2024-11-12 03:15:01,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:15:01,064 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-12 03:15:01,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:15:01,067 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-12 03:15:01,068 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-12 03:15:01,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:15:01,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 03:15:01,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:15:02,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 03:15:02,115 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 03:15:02,116 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:15:02,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1648335154] [2024-11-12 03:15:02,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1648335154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:15:02,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:15:02,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 03:15:02,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081117665] [2024-11-12 03:15:02,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:15:02,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 03:15:02,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 03:15:02,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 03:15:02,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 03:15:02,118 INFO L87 Difference]: Start difference. First operand 142 states and 217 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 03:15:02,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:15:02,872 INFO L93 Difference]: Finished difference Result 228 states and 349 transitions. [2024-11-12 03:15:02,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 03:15:02,882 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2024-11-12 03:15:02,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:15:02,884 INFO L225 Difference]: With dead ends: 228 [2024-11-12 03:15:02,885 INFO L226 Difference]: Without dead ends: 142 [2024-11-12 03:15:02,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 03:15:02,887 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 114 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 03:15:02,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 213 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 03:15:02,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-12 03:15:02,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-11-12 03:15:02,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 91 states have (on average 1.3076923076923077) internal successors, (119), 91 states have internal predecessors, (119), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-12 03:15:02,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 215 transitions. [2024-11-12 03:15:02,917 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 215 transitions. Word has length 161 [2024-11-12 03:15:02,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:15:02,918 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 215 transitions. [2024-11-12 03:15:02,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 03:15:02,919 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 215 transitions. [2024-11-12 03:15:02,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-12 03:15:02,921 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:15:02,921 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 03:15:02,945 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 (4)] Forceful destruction successful, exit code 0 [2024-11-12 03:15:03,121 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-12 03:15:03,122 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:15:03,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:15:03,123 INFO L85 PathProgramCache]: Analyzing trace with hash 999794447, now seen corresponding path program 1 times [2024-11-12 03:15:03,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:15:03,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1620610762] [2024-11-12 03:15:03,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:15:03,124 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-12 03:15:03,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:15:03,127 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-12 03:15:03,129 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-12 03:15:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:15:03,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-12 03:15:03,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:15:13,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 417 proven. 114 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2024-11-12 03:15:13,585 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 03:15:16,186 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:15:16,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1620610762] [2024-11-12 03:15:16,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1620610762] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 03:15:16,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1859262434] [2024-11-12 03:15:16,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:15:16,187 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 03:15:16,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 03:15:16,191 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 03:15:16,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-12 03:15:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:15:18,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-12 03:15:18,183 INFO L279 TraceCheckSpWp]: Computing forward predicates...