./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-17.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-17.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 4feb39e487a380ff9488b8d70ce2acf8acdc63d176a7d1801d07edeaf24892b2 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:28:36,083 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:28:36,164 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 21:28:36,170 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:28:36,170 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:28:36,201 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:28:36,201 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:28:36,202 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:28:36,203 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:28:36,204 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:28:36,204 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:28:36,205 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:28:36,205 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:28:36,206 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:28:36,208 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:28:36,208 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:28:36,209 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:28:36,209 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:28:36,209 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 21:28:36,209 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:28:36,210 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:28:36,214 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:28:36,214 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:28:36,215 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:28:36,215 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:28:36,215 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:28:36,215 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:28:36,215 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:28:36,216 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:28:36,216 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:28:36,216 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:28:36,216 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:28:36,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:28:36,217 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:28:36,217 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:28:36,217 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:28:36,218 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 21:28:36,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 21:28:36,218 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:28:36,219 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:28:36,219 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:28:36,220 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:28:36,220 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 -> 4feb39e487a380ff9488b8d70ce2acf8acdc63d176a7d1801d07edeaf24892b2 [2024-11-08 21:28:36,451 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:28:36,475 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:28:36,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:28:36,480 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:28:36,480 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:28:36,481 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-17.i [2024-11-08 21:28:37,989 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:28:38,185 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:28:38,190 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-17.i [2024-11-08 21:28:38,202 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57db4a782/8aa88cc8f2be4c93a0afd13bf41ebe9e/FLAGbfff59b2c [2024-11-08 21:28:38,214 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57db4a782/8aa88cc8f2be4c93a0afd13bf41ebe9e [2024-11-08 21:28:38,216 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:28:38,217 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:28:38,219 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:28:38,219 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:28:38,224 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:28:38,224 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:28:38" (1/1) ... [2024-11-08 21:28:38,225 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6919002d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:28:38, skipping insertion in model container [2024-11-08 21:28:38,225 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:28:38" (1/1) ... [2024-11-08 21:28:38,255 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:28:38,415 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-17.i[919,932] [2024-11-08 21:28:38,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:28:38,498 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:28:38,529 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-17.i[919,932] [2024-11-08 21:28:38,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:28:38,609 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:28:38,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:28:38 WrapperNode [2024-11-08 21:28:38,610 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:28:38,611 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:28:38,611 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:28:38,611 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:28:38,617 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:28:38" (1/1) ... [2024-11-08 21:28:38,634 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:28:38" (1/1) ... [2024-11-08 21:28:38,675 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 238 [2024-11-08 21:28:38,676 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:28:38,676 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:28:38,677 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:28:38,677 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:28:38,690 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:28:38" (1/1) ... [2024-11-08 21:28:38,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:28:38" (1/1) ... [2024-11-08 21:28:38,698 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:28:38" (1/1) ... [2024-11-08 21:28:38,718 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 21:28:38,719 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:28:38" (1/1) ... [2024-11-08 21:28:38,719 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:28:38" (1/1) ... [2024-11-08 21:28:38,740 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:28:38" (1/1) ... [2024-11-08 21:28:38,744 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:28:38" (1/1) ... [2024-11-08 21:28:38,748 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:28:38" (1/1) ... [2024-11-08 21:28:38,755 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:28:38" (1/1) ... [2024-11-08 21:28:38,766 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:28:38,767 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:28:38,768 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:28:38,768 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:28:38,769 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:28:38" (1/1) ... [2024-11-08 21:28:38,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:28:38,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:28:38,802 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 21:28:38,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 21:28:38,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:28:38,848 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:28:38,848 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:28:38,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 21:28:38,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:28:38,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:28:38,928 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:28:38,930 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:28:39,384 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-08 21:28:39,385 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:28:39,400 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:28:39,402 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:28:39,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:28:39 BoogieIcfgContainer [2024-11-08 21:28:39,402 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:28:39,405 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:28:39,405 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:28:39,408 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:28:39,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:28:38" (1/3) ... [2024-11-08 21:28:39,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@565f6cd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:28:39, skipping insertion in model container [2024-11-08 21:28:39,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:28:38" (2/3) ... [2024-11-08 21:28:39,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@565f6cd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:28:39, skipping insertion in model container [2024-11-08 21:28:39,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:28:39" (3/3) ... [2024-11-08 21:28:39,412 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-17.i [2024-11-08 21:28:39,429 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:28:39,429 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:28:39,497 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:28:39,504 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;@37689dbe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:28:39,504 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:28:39,508 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 76 states have (on average 1.4736842105263157) internal successors, (112), 77 states have internal predecessors, (112), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 21:28:39,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-08 21:28:39,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:28:39,527 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:28:39,528 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:28:39,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:28:39,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1960244346, now seen corresponding path program 1 times [2024-11-08 21:28:39,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:28:39,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650367739] [2024-11-08 21:28:39,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:28:39,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:28:39,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:39,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:28:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:39,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:28:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:39,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:28:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:39,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:28:39,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:39,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:28:39,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:39,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:28:39,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:39,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:28:39,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:39,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:28:39,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:39,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:28:39,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:39,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:28:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:39,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:28:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:39,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:28:40,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:40,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:28:40,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:40,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:28:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:40,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:28:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:40,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:28:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:40,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:28:40,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:40,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:28:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:40,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:28:40,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:40,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:28:40,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:40,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:28:40,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:40,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:28:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:40,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:28:40,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:40,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:28:40,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:40,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:28:40,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:40,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:28:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:40,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 21:28:40,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:28:40,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650367739] [2024-11-08 21:28:40,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650367739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:28:40,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:28:40,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:28:40,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079647571] [2024-11-08 21:28:40,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:28:40,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:28:40,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:28:40,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:28:40,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:28:40,156 INFO L87 Difference]: Start difference. First operand has 105 states, 76 states have (on average 1.4736842105263157) internal successors, (112), 77 states have internal predecessors, (112), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 21:28:40,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:28:40,198 INFO L93 Difference]: Finished difference Result 203 states and 348 transitions. [2024-11-08 21:28:40,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:28:40,201 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 175 [2024-11-08 21:28:40,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:28:40,211 INFO L225 Difference]: With dead ends: 203 [2024-11-08 21:28:40,212 INFO L226 Difference]: Without dead ends: 101 [2024-11-08 21:28:40,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:28:40,220 INFO L432 NwaCegarLoop]: 157 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, 157 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:28:40,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:28:40,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-08 21:28:40,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-08 21:28:40,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 73 states have internal predecessors, (105), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 21:28:40,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 157 transitions. [2024-11-08 21:28:40,312 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 157 transitions. Word has length 175 [2024-11-08 21:28:40,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:28:40,312 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 157 transitions. [2024-11-08 21:28:40,313 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 21:28:40,313 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 157 transitions. [2024-11-08 21:28:40,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-08 21:28:40,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:28:40,320 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:28:40,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 21:28:40,320 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:28:40,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:28:40,321 INFO L85 PathProgramCache]: Analyzing trace with hash 368211390, now seen corresponding path program 1 times [2024-11-08 21:28:40,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:28:40,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558534923] [2024-11-08 21:28:40,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:28:40,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:28:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:41,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:28:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:41,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:28:41,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:41,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:28:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:41,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:28:41,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:41,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:28:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:41,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:28:41,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:41,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:28:41,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:41,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:28:41,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:41,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:28:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:41,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:28:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:41,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:28:41,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:41,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:28:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:41,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:28:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:41,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:28:41,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:41,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:28:41,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:41,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:28:41,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:41,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:28:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:41,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:28:41,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:41,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:28:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:41,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:28:41,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:41,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:28:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:41,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:28:41,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:41,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:28:41,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:41,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:28:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:41,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:28:41,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:41,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:28:41,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:41,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 21:28:41,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:28:41,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558534923] [2024-11-08 21:28:41,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558534923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:28:41,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:28:41,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 21:28:41,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561964525] [2024-11-08 21:28:41,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:28:41,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:28:41,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:28:41,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:28:41,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:28:41,233 INFO L87 Difference]: Start difference. First operand 101 states and 157 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 21:28:41,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:28:41,547 INFO L93 Difference]: Finished difference Result 298 states and 466 transitions. [2024-11-08 21:28:41,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 21:28:41,548 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2024-11-08 21:28:41,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:28:41,551 INFO L225 Difference]: With dead ends: 298 [2024-11-08 21:28:41,555 INFO L226 Difference]: Without dead ends: 200 [2024-11-08 21:28:41,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:28:41,559 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 107 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:28:41,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 533 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 21:28:41,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-08 21:28:41,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 150. [2024-11-08 21:28:41,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 95 states have (on average 1.3368421052631578) internal successors, (127), 95 states have internal predecessors, (127), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-08 21:28:41,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 231 transitions. [2024-11-08 21:28:41,609 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 231 transitions. Word has length 175 [2024-11-08 21:28:41,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:28:41,609 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 231 transitions. [2024-11-08 21:28:41,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 21:28:41,610 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 231 transitions. [2024-11-08 21:28:41,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-08 21:28:41,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:28:41,616 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:28:41,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 21:28:41,617 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:28:41,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:28:41,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1392075, now seen corresponding path program 1 times [2024-11-08 21:28:41,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:28:41,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82969456] [2024-11-08 21:28:41,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:28:41,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:28:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:44,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:28:44,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:44,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:28:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:44,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:28:44,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:44,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:28:44,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:44,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:28:44,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:44,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:28:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:44,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:28:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:44,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:28:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:44,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:28:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:44,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:28:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:44,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:28:44,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:44,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:28:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:44,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:28:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:44,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:28:44,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:44,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:28:44,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:44,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:28:44,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:44,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:28:44,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:44,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:28:44,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:44,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:28:44,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:44,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:28:44,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:44,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:28:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:44,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:28:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:44,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:28:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:44,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:28:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:44,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:28:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:44,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:28:44,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:44,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 21:28:44,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:28:44,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82969456] [2024-11-08 21:28:44,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82969456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:28:44,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:28:44,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 21:28:44,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239144251] [2024-11-08 21:28:44,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:28:44,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 21:28:44,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:28:44,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 21:28:44,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-08 21:28:44,941 INFO L87 Difference]: Start difference. First operand 150 states and 231 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 21:28:48,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:28:48,219 INFO L93 Difference]: Finished difference Result 799 states and 1240 transitions. [2024-11-08 21:28:48,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 21:28:48,220 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2024-11-08 21:28:48,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:28:48,226 INFO L225 Difference]: With dead ends: 799 [2024-11-08 21:28:48,226 INFO L226 Difference]: Without dead ends: 701 [2024-11-08 21:28:48,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2024-11-08 21:28:48,228 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 1353 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 1504 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1353 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 1737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 1504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-08 21:28:48,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1353 Valid, 1128 Invalid, 1737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 1504 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-08 21:28:48,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2024-11-08 21:28:48,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 389. [2024-11-08 21:28:48,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 280 states have (on average 1.425) internal successors, (399), 280 states have internal predecessors, (399), 104 states have call successors, (104), 4 states have call predecessors, (104), 4 states have return successors, (104), 104 states have call predecessors, (104), 104 states have call successors, (104) [2024-11-08 21:28:48,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 607 transitions. [2024-11-08 21:28:48,318 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 607 transitions. Word has length 176 [2024-11-08 21:28:48,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:28:48,320 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 607 transitions. [2024-11-08 21:28:48,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 21:28:48,320 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 607 transitions. [2024-11-08 21:28:48,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-08 21:28:48,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:28:48,324 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:28:48,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 21:28:48,324 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:28:48,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:28:48,325 INFO L85 PathProgramCache]: Analyzing trace with hash -767533130, now seen corresponding path program 1 times [2024-11-08 21:28:48,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:28:48,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42082974] [2024-11-08 21:28:48,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:28:48,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:28:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:49,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:28:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:49,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:28:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:49,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:28:49,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:49,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:28:49,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:49,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:28:49,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:49,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:28:49,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:49,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:28:49,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:49,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:28:49,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:49,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:28:49,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:49,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:28:49,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:49,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:28:49,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:49,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:28:49,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:49,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:28:49,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:49,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:28:49,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:49,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:28:49,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:49,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:28:49,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:49,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:28:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:49,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:28:49,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:49,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:28:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:49,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:28:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:49,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:28:49,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:49,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:28:49,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:49,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:28:49,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:49,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:28:49,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:49,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:28:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:49,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:28:49,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:49,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 21:28:49,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:28:49,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42082974] [2024-11-08 21:28:49,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42082974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:28:49,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:28:49,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 21:28:49,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435549686] [2024-11-08 21:28:49,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:28:49,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 21:28:49,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:28:49,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 21:28:49,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:28:49,130 INFO L87 Difference]: Start difference. First operand 389 states and 607 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 21:28:50,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:28:50,339 INFO L93 Difference]: Finished difference Result 1022 states and 1588 transitions. [2024-11-08 21:28:50,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 21:28:50,340 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2024-11-08 21:28:50,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:28:50,347 INFO L225 Difference]: With dead ends: 1022 [2024-11-08 21:28:50,347 INFO L226 Difference]: Without dead ends: 685 [2024-11-08 21:28:50,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-11-08 21:28:50,352 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 751 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:28:50,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 536 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 21:28:50,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2024-11-08 21:28:50,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 556. [2024-11-08 21:28:50,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 391 states have (on average 1.39386189258312) internal successors, (545), 393 states have internal predecessors, (545), 156 states have call successors, (156), 8 states have call predecessors, (156), 8 states have return successors, (156), 154 states have call predecessors, (156), 156 states have call successors, (156) [2024-11-08 21:28:50,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 857 transitions. [2024-11-08 21:28:50,451 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 857 transitions. Word has length 177 [2024-11-08 21:28:50,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:28:50,453 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 857 transitions. [2024-11-08 21:28:50,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 21:28:50,455 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 857 transitions. [2024-11-08 21:28:50,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-08 21:28:50,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:28:50,457 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:28:50,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 21:28:50,457 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:28:50,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:28:50,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1408724349, now seen corresponding path program 1 times [2024-11-08 21:28:50,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:28:50,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939787558] [2024-11-08 21:28:50,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:28:50,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:28:50,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:51,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:28:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:51,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:28:51,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:51,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:28:51,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:51,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:28:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:51,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:28:51,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:51,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:28:51,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:51,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:28:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:51,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:28:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:51,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:28:51,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:51,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:28:51,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:51,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:28:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:51,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:28:51,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:51,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:28:51,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:51,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:28:51,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:51,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:28:51,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:51,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:28:51,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:51,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:28:51,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:51,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:28:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:51,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:28:51,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:51,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:28:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:51,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:28:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:51,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:28:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:51,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:28:51,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:51,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:28:51,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:51,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:28:51,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:51,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:28:51,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:28:51,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 21:28:51,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:28:51,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939787558] [2024-11-08 21:28:51,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939787558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:28:51,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:28:51,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 21:28:51,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632774136] [2024-11-08 21:28:51,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:28:51,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 21:28:51,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:28:51,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 21:28:51,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-08 21:28:51,681 INFO L87 Difference]: Start difference. First operand 556 states and 857 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 21:28:54,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:28:54,416 INFO L93 Difference]: Finished difference Result 1726 states and 2651 transitions. [2024-11-08 21:28:54,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 21:28:54,417 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2024-11-08 21:28:54,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:28:54,425 INFO L225 Difference]: With dead ends: 1726 [2024-11-08 21:28:54,426 INFO L226 Difference]: Without dead ends: 1222 [2024-11-08 21:28:54,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2024-11-08 21:28:54,429 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 1373 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 1130 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1373 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 1378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 1130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-08 21:28:54,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1373 Valid, 948 Invalid, 1378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 1130 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 21:28:54,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2024-11-08 21:28:54,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 808. [2024-11-08 21:28:54,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 583 states have (on average 1.411663807890223) internal successors, (823), 587 states have internal predecessors, (823), 212 states have call successors, (212), 12 states have call predecessors, (212), 12 states have return successors, (212), 208 states have call predecessors, (212), 212 states have call successors, (212) [2024-11-08 21:28:54,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1247 transitions. [2024-11-08 21:28:54,540 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1247 transitions. Word has length 177 [2024-11-08 21:28:54,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:28:54,541 INFO L471 AbstractCegarLoop]: Abstraction has 808 states and 1247 transitions. [2024-11-08 21:28:54,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 21:28:54,542 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1247 transitions. [2024-11-08 21:28:54,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-08 21:28:54,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:28:54,544 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:28:54,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 21:28:54,544 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:28:54,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:28:54,545 INFO L85 PathProgramCache]: Analyzing trace with hash -821918335, now seen corresponding path program 1 times [2024-11-08 21:28:54,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:28:54,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933126893] [2024-11-08 21:28:54,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:28:54,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:28:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 21:28:54,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1686442350] [2024-11-08 21:28:54,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:28:54,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:28:54,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:28:54,700 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 21:28:54,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 21:28:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:28:54,896 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 21:28:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:28:55,136 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 21:28:55,137 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 21:28:55,138 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 21:28:55,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 21:28:55,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-08 21:28:55,345 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-08 21:28:55,471 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 21:28:55,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 09:28:55 BoogieIcfgContainer [2024-11-08 21:28:55,474 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 21:28:55,475 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 21:28:55,475 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 21:28:55,475 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 21:28:55,476 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:28:39" (3/4) ... [2024-11-08 21:28:55,482 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 21:28:55,484 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 21:28:55,484 INFO L158 Benchmark]: Toolchain (without parser) took 17267.29ms. Allocated memory was 167.8MB in the beginning and 325.1MB in the end (delta: 157.3MB). Free memory was 102.4MB in the beginning and 121.9MB in the end (delta: -19.5MB). Peak memory consumption was 140.2MB. Max. memory is 16.1GB. [2024-11-08 21:28:55,485 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 67.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 21:28:55,485 INFO L158 Benchmark]: CACSL2BoogieTranslator took 391.45ms. Allocated memory is still 167.8MB. Free memory was 102.2MB in the beginning and 136.8MB in the end (delta: -34.6MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2024-11-08 21:28:55,485 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.23ms. Allocated memory is still 167.8MB. Free memory was 136.1MB in the beginning and 131.9MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 21:28:55,485 INFO L158 Benchmark]: Boogie Preprocessor took 90.27ms. Allocated memory is still 167.8MB. Free memory was 131.9MB in the beginning and 125.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 21:28:55,486 INFO L158 Benchmark]: RCFGBuilder took 634.95ms. Allocated memory is still 167.8MB. Free memory was 125.6MB in the beginning and 94.1MB in the end (delta: 31.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-08 21:28:55,486 INFO L158 Benchmark]: TraceAbstraction took 16069.84ms. Allocated memory was 167.8MB in the beginning and 325.1MB in the end (delta: 157.3MB). Free memory was 93.4MB in the beginning and 122.9MB in the end (delta: -29.5MB). Peak memory consumption was 128.4MB. Max. memory is 16.1GB. [2024-11-08 21:28:55,486 INFO L158 Benchmark]: Witness Printer took 8.71ms. Allocated memory is still 325.1MB. Free memory was 122.9MB in the beginning and 121.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 21:28:55,488 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.17ms. Allocated memory is still 104.9MB. Free memory is still 67.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 391.45ms. Allocated memory is still 167.8MB. Free memory was 102.2MB in the beginning and 136.8MB in the end (delta: -34.6MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.23ms. Allocated memory is still 167.8MB. Free memory was 136.1MB in the beginning and 131.9MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.27ms. Allocated memory is still 167.8MB. Free memory was 131.9MB in the beginning and 125.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 634.95ms. Allocated memory is still 167.8MB. Free memory was 125.6MB in the beginning and 94.1MB in the end (delta: 31.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 16069.84ms. Allocated memory was 167.8MB in the beginning and 325.1MB in the end (delta: 157.3MB). Free memory was 93.4MB in the beginning and 122.9MB in the end (delta: -29.5MB). Peak memory consumption was 128.4MB. Max. memory is 16.1GB. * Witness Printer took 8.71ms. Allocated memory is still 325.1MB. Free memory was 122.9MB in the beginning and 121.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 187, overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of shiftRight at line 129. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 25; [L23] unsigned char var_1_2 = 25; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_4 = 0; [L26] signed long int var_1_5 = 4; [L27] unsigned char var_1_7 = 0; [L28] unsigned char var_1_8 = 1; [L29] unsigned char var_1_9 = 0; [L30] unsigned char var_1_10 = 0; [L31] double var_1_11 = 7.3; [L32] double var_1_12 = 1.25; [L33] double var_1_13 = 128.8; [L34] signed char var_1_14 = -1; [L35] signed char var_1_15 = 10; [L36] signed short int var_1_16 = 8; [L37] unsigned long int var_1_18 = 128; [L38] unsigned long int var_1_19 = 3963666122; [L39] float var_1_20 = 15.875; [L40] float var_1_21 = 4.2; [L41] float var_1_22 = 5.5; [L42] signed short int var_1_23 = -10; [L43] unsigned long int var_1_30 = 1000000000; [L44] unsigned long int var_1_31 = 4155847319; [L45] float var_1_33 = 99.25; [L46] signed long int var_1_34 = 10; [L47] unsigned char var_1_35 = 16; [L48] unsigned char var_1_36 = 100; [L49] signed long int var_1_39 = -128; [L50] signed long int var_1_40 = 1792665454; [L51] unsigned char last_1_var_1_8 = 1; [L52] signed char last_1_var_1_14 = -1; VAL [isInitial=0, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=25, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L191] isInitial = 1 [L192] FCALL initially() [L193] COND TRUE 1 [L194] CALL updateLastVariables() [L183] last_1_var_1_8 = var_1_8 [L184] last_1_var_1_14 = var_1_14 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=25, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L194] RET updateLastVariables() [L195] CALL updateVariables() [L140] var_1_2 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L141] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L142] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L142] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L143] var_1_3 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L144] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L145] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L145] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L146] var_1_4 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L147] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L148] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L148] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L149] var_1_7 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_8=1, var_1_9=0] [L150] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_8=1, var_1_9=0] [L151] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=0] [L151] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=0] [L152] var_1_9 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L153] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L154] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L154] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L155] var_1_10 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L156] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L157] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L157] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L158] var_1_12 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L159] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L160] var_1_13 = __VERIFIER_nondet_double() [L161] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L161] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L162] var_1_15 = __VERIFIER_nondet_char() [L163] CALL assume_abort_if_not(var_1_15 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L163] RET assume_abort_if_not(var_1_15 >= -127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L164] CALL assume_abort_if_not(var_1_15 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L164] RET assume_abort_if_not(var_1_15 <= 126) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L165] var_1_19 = __VERIFIER_nondet_ulong() [L166] CALL assume_abort_if_not(var_1_19 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L166] RET assume_abort_if_not(var_1_19 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L167] CALL assume_abort_if_not(var_1_19 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L167] RET assume_abort_if_not(var_1_19 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_21=21/5, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L168] var_1_21 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L169] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_22=11/2, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L170] var_1_22 = __VERIFIER_nondet_float() [L171] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L171] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=4155847319, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L172] var_1_31 = __VERIFIER_nondet_ulong() [L173] CALL assume_abort_if_not(var_1_31 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=-2147483649, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=-2147483649, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L173] RET assume_abort_if_not(var_1_31 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=-2147483649, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L174] CALL assume_abort_if_not(var_1_31 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=-2147483649, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=-2147483649, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L174] RET assume_abort_if_not(var_1_31 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=-2147483649, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=100, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L175] var_1_36 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=-2147483649, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=-2147483649, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L176] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=-2147483649, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L177] CALL assume_abort_if_not(var_1_36 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=-2147483649, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=-2147483649, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L177] RET assume_abort_if_not(var_1_36 <= 254) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=-2147483649, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1792665454, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L178] var_1_40 = __VERIFIER_nondet_long() [L179] CALL assume_abort_if_not(var_1_40 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=-2147483649, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=-2147483649, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L179] RET assume_abort_if_not(var_1_40 >= 1073741823) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=-2147483649, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L180] CALL assume_abort_if_not(var_1_40 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=-2147483649, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=-2147483649, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L180] RET assume_abort_if_not(var_1_40 <= 2147483646) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=-2147483649, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L195] RET updateVariables() [L196] CALL step() [L56] unsigned char stepLocal_0 = last_1_var_1_8; VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_0=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=-2147483649, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L57] COND TRUE stepLocal_0 && last_1_var_1_8 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=-2147483649, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=-255] [L58] COND TRUE \read(last_1_var_1_8) [L59] var_1_5 = (((((last_1_var_1_14) < 0 ) ? -(last_1_var_1_14) : (last_1_var_1_14))) - ((((var_1_4) < (var_1_2)) ? (var_1_4) : (var_1_2)))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=-2147483649, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=-255] [L64] COND TRUE var_1_5 < var_1_3 [L65] var_1_8 = ((var_1_7 || (last_1_var_1_8 || var_1_9)) && var_1_10) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=-2147483649, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=-255] [L69] var_1_1 = (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=51, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=-2147483649, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=-255] [L70] COND FALSE !((64.4f + 1.5f) <= var_1_13) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=51, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=-2147483649, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=-255] [L75] unsigned char stepLocal_3 = var_1_9 && var_1_8; VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_3=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=6442450943, var_1_1=51, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=-2147483649, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=-255] [L76] COND TRUE stepLocal_3 || (var_1_8 && var_1_10) [L77] var_1_18 = (var_1_19 - (((((1991720936u - var_1_1)) < (var_1_2)) ? ((1991720936u - var_1_1)) : (var_1_2)))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=6442450942, var_1_19=6442450943, var_1_1=51, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=-2147483649, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=-255] [L81] signed long int stepLocal_1 = 8 + var_1_14; VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_1=7, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=6442450942, var_1_19=6442450943, var_1_1=51, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=-2147483649, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=-255] [L82] COND TRUE var_1_4 == stepLocal_1 [L83] var_1_11 = ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=6442450942, var_1_19=6442450943, var_1_1=51, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=-2147483649, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=-255] [L85] EXPR var_1_15 & var_1_1 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=6442450942, var_1_19=6442450943, var_1_1=51, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=-2147483649, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=-255] [L85] unsigned long int stepLocal_2 = var_1_18 * (var_1_15 & var_1_1); [L86] COND FALSE !(var_1_12 >= 9.6) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_2=0, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=6442450942, var_1_19=6442450943, var_1_1=51, var_1_20=127/8, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=-2147483649, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=-255] [L97] var_1_20 = ((((var_1_21) < (var_1_22)) ? (var_1_21) : (var_1_22))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_2=0, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=6442450942, var_1_19=6442450943, var_1_1=51, var_1_20=3, var_1_21=3, var_1_22=0, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=-2147483649, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=-255] [L98] COND FALSE !(128u <= var_1_5) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_2=0, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=6442450942, var_1_19=6442450943, var_1_1=51, var_1_20=3, var_1_21=3, var_1_22=0, var_1_23=-10, var_1_2=-255, var_1_30=1000000000, var_1_31=-2147483649, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=-255] [L113] COND TRUE var_1_1 >= var_1_16 [L114] var_1_30 = (((((var_1_31) < 0 ) ? -(var_1_31) : (var_1_31))) - var_1_1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_2=0, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=6442450942, var_1_19=6442450943, var_1_1=51, var_1_20=3, var_1_21=3, var_1_22=0, var_1_23=-10, var_1_2=-255, var_1_30=-2147483700, var_1_31=-2147483649, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=-255] [L116] var_1_33 = var_1_21 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_2=0, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=6442450942, var_1_19=6442450943, var_1_1=51, var_1_20=3, var_1_21=3, var_1_22=0, var_1_23=-10, var_1_2=-255, var_1_30=-2147483700, var_1_31=-2147483649, var_1_33=3, var_1_34=10, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=-255] [L117] COND TRUE \read(var_1_8) [L118] var_1_34 = ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_2=0, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=6442450942, var_1_19=6442450943, var_1_1=51, var_1_20=3, var_1_21=3, var_1_22=0, var_1_23=-10, var_1_2=-255, var_1_30=-2147483700, var_1_31=-2147483649, var_1_33=3, var_1_34=1, var_1_35=16, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=-255] [L120] COND TRUE var_1_31 > var_1_1 [L121] var_1_35 = var_1_36 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_2=0, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=6442450942, var_1_19=6442450943, var_1_1=51, var_1_20=3, var_1_21=3, var_1_22=0, var_1_23=-10, var_1_2=-255, var_1_30=-2147483700, var_1_31=-2147483649, var_1_33=3, var_1_34=1, var_1_35=0, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=-255] [L129] EXPR var_1_1 >> var_1_16 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_2=0, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=6442450942, var_1_19=6442450943, var_1_1=51, var_1_20=3, var_1_21=3, var_1_22=0, var_1_23=-10, var_1_2=-255, var_1_30=-2147483700, var_1_31=-2147483649, var_1_33=3, var_1_34=1, var_1_35=0, var_1_36=0, var_1_39=-128, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=-255] [L129] COND FALSE !(var_1_14 > (var_1_1 >> var_1_16)) [L136] var_1_39 = var_1_18 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_2=0, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=6442450942, var_1_19=6442450943, var_1_1=51, var_1_20=3, var_1_21=3, var_1_22=0, var_1_23=-10, var_1_2=-255, var_1_30=-2147483700, var_1_31=-2147483649, var_1_33=3, var_1_34=1, var_1_35=0, var_1_36=0, var_1_39=2147483646, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=-255] [L196] RET step() [L197] CALL, EXPR property() [L187] EXPR (((((var_1_1 == ((unsigned char) (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))))) && ((last_1_var_1_8 && last_1_var_1_8) ? (last_1_var_1_8 ? (var_1_5 == ((signed long int) (((((last_1_var_1_14) < 0 ) ? -(last_1_var_1_14) : (last_1_var_1_14))) - ((((var_1_4) < (var_1_2)) ? (var_1_4) : (var_1_2)))))) : (var_1_5 == ((signed long int) 8))) : 1)) && ((var_1_5 < var_1_3) ? (var_1_8 == ((unsigned char) ((var_1_7 || (last_1_var_1_8 || var_1_9)) && var_1_10))) : (var_1_8 == ((unsigned char) (! var_1_10))))) && ((var_1_4 == (8 + var_1_14)) ? (var_1_11 == ((double) ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))))) : 1)) && (((64.4f + 1.5f) <= var_1_13) ? ((var_1_1 >= var_1_4) ? (var_1_14 == ((signed char) var_1_15)) : 1) : 1)) && ((var_1_12 >= 9.6) ? (var_1_10 ? (var_1_16 == ((signed short int) (2 - var_1_1))) : (((var_1_18 * (var_1_15 & var_1_1)) <= var_1_3) ? (var_1_16 == ((signed short int) var_1_18)) : (var_1_16 == ((signed short int) var_1_4)))) : 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=6442450942, var_1_19=6442450943, var_1_1=51, var_1_20=3, var_1_21=3, var_1_22=0, var_1_23=-10, var_1_2=-255, var_1_30=-2147483700, var_1_31=-2147483649, var_1_33=3, var_1_34=1, var_1_35=0, var_1_36=0, var_1_39=2147483646, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=-255] [L187-L188] return ((((((var_1_1 == ((unsigned char) (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))))) && ((last_1_var_1_8 && last_1_var_1_8) ? (last_1_var_1_8 ? (var_1_5 == ((signed long int) (((((last_1_var_1_14) < 0 ) ? -(last_1_var_1_14) : (last_1_var_1_14))) - ((((var_1_4) < (var_1_2)) ? (var_1_4) : (var_1_2)))))) : (var_1_5 == ((signed long int) 8))) : 1)) && ((var_1_5 < var_1_3) ? (var_1_8 == ((unsigned char) ((var_1_7 || (last_1_var_1_8 || var_1_9)) && var_1_10))) : (var_1_8 == ((unsigned char) (! var_1_10))))) && ((var_1_4 == (8 + var_1_14)) ? (var_1_11 == ((double) ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))))) : 1)) && (((64.4f + 1.5f) <= var_1_13) ? ((var_1_1 >= var_1_4) ? (var_1_14 == ((signed char) var_1_15)) : 1) : 1)) && ((var_1_12 >= 9.6) ? (var_1_10 ? (var_1_16 == ((signed short int) (2 - var_1_1))) : (((var_1_18 * (var_1_15 & var_1_1)) <= var_1_3) ? (var_1_16 == ((signed short int) var_1_18)) : (var_1_16 == ((signed short int) var_1_4)))) : 1)) && (((var_1_9 && var_1_8) || (var_1_8 && var_1_10)) ? (var_1_18 == ((unsigned long int) (var_1_19 - (((((1991720936u - var_1_1)) < (var_1_2)) ? ((1991720936u - var_1_1)) : (var_1_2)))))) : (var_1_18 == ((unsigned long int) var_1_2))) ; [L197] RET, EXPR property() [L197] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=6442450942, var_1_19=6442450943, var_1_1=51, var_1_20=3, var_1_21=3, var_1_22=0, var_1_23=-10, var_1_2=-255, var_1_30=-2147483700, var_1_31=-2147483649, var_1_33=3, var_1_34=1, var_1_35=0, var_1_36=0, var_1_39=2147483646, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=-255] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=2, var_1_12=2, var_1_13=0, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=6442450942, var_1_19=6442450943, var_1_1=51, var_1_20=3, var_1_21=3, var_1_22=0, var_1_23=-10, var_1_2=-255, var_1_30=-2147483700, var_1_31=-2147483649, var_1_33=3, var_1_34=1, var_1_35=0, var_1_36=0, var_1_39=2147483646, var_1_3=1, var_1_40=1073741823, var_1_4=7, var_1_5=0, var_1_7=-255, var_1_8=1, var_1_9=-255] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 105 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.9s, OverallIterations: 6, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3584 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3584 mSDsluCounter, 3302 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2287 mSDsCounter, 832 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3240 IncrementalHoareTripleChecker+Invalid, 4072 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 832 mSolverCounterUnsat, 1015 mSDtfsCounter, 3240 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 365 GetRequests, 312 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=808occurred in iteration=5, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 5 MinimizatonAttempts, 905 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 1234 NumberOfCodeBlocks, 1234 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 875 ConstructedInterpolants, 0 QuantifiedInterpolants, 4100 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 6500/6500 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 21:28:55,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-17.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 4feb39e487a380ff9488b8d70ce2acf8acdc63d176a7d1801d07edeaf24892b2 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:28:57,920 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:28:58,006 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 21:28:58,014 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:28:58,016 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:28:58,050 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:28:58,052 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:28:58,053 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:28:58,053 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:28:58,053 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:28:58,054 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:28:58,054 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:28:58,055 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:28:58,055 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:28:58,055 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:28:58,056 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:28:58,059 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:28:58,059 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:28:58,060 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:28:58,063 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:28:58,063 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:28:58,064 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:28:58,064 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:28:58,064 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 21:28:58,064 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 21:28:58,065 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:28:58,065 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 21:28:58,065 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:28:58,065 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:28:58,066 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:28:58,066 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:28:58,066 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:28:58,066 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:28:58,067 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:28:58,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:28:58,070 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:28:58,070 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:28:58,071 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:28:58,071 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 21:28:58,071 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 21:28:58,071 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:28:58,072 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:28:58,072 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:28:58,072 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:28:58,073 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 -> 4feb39e487a380ff9488b8d70ce2acf8acdc63d176a7d1801d07edeaf24892b2 [2024-11-08 21:28:58,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:28:58,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:28:58,402 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:28:58,403 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:28:58,403 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:28:58,404 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-17.i [2024-11-08 21:28:59,962 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:29:00,245 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:29:00,246 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-17.i [2024-11-08 21:29:00,265 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d854cbb1/25f6e7f922bd4b80a324400067278d27/FLAGdc5aa85d4 [2024-11-08 21:29:00,285 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d854cbb1/25f6e7f922bd4b80a324400067278d27 [2024-11-08 21:29:00,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:29:00,291 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:29:00,292 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:29:00,292 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:29:00,298 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:29:00,299 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:29:00" (1/1) ... [2024-11-08 21:29:00,302 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8064fb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:29:00, skipping insertion in model container [2024-11-08 21:29:00,303 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:29:00" (1/1) ... [2024-11-08 21:29:00,343 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:29:00,553 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-17.i[919,932] [2024-11-08 21:29:00,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:29:00,690 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:29:00,706 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-17.i[919,932] [2024-11-08 21:29:00,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:29:00,797 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:29:00,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:29:00 WrapperNode [2024-11-08 21:29:00,798 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:29:00,799 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:29:00,800 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:29:00,800 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:29:00,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:29:00" (1/1) ... [2024-11-08 21:29:00,828 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:29:00" (1/1) ... [2024-11-08 21:29:00,868 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 188 [2024-11-08 21:29:00,868 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:29:00,869 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:29:00,869 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:29:00,869 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:29:00,881 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:29:00" (1/1) ... [2024-11-08 21:29:00,881 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:29:00" (1/1) ... [2024-11-08 21:29:00,885 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:29:00" (1/1) ... [2024-11-08 21:29:00,910 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 21:29:00,914 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:29:00" (1/1) ... [2024-11-08 21:29:00,915 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:29:00" (1/1) ... [2024-11-08 21:29:00,929 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:29:00" (1/1) ... [2024-11-08 21:29:00,937 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:29:00" (1/1) ... [2024-11-08 21:29:00,944 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:29:00" (1/1) ... [2024-11-08 21:29:00,946 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:29:00" (1/1) ... [2024-11-08 21:29:00,957 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:29:00,959 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:29:00,962 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:29:00,962 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:29:00,964 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:29:00" (1/1) ... [2024-11-08 21:29:00,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:29:00,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:29:01,000 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 21:29:01,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 21:29:01,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:29:01,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 21:29:01,056 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:29:01,056 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:29:01,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:29:01,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:29:01,169 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:29:01,172 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:29:02,251 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-08 21:29:02,251 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:29:02,272 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:29:02,272 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:29:02,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:29:02 BoogieIcfgContainer [2024-11-08 21:29:02,273 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:29:02,275 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:29:02,277 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:29:02,282 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:29:02,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:29:00" (1/3) ... [2024-11-08 21:29:02,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba3c248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:29:02, skipping insertion in model container [2024-11-08 21:29:02,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:29:00" (2/3) ... [2024-11-08 21:29:02,286 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba3c248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:29:02, skipping insertion in model container [2024-11-08 21:29:02,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:29:02" (3/3) ... [2024-11-08 21:29:02,288 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-17.i [2024-11-08 21:29:02,308 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:29:02,308 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:29:02,376 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:29:02,383 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;@289dfed3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:29:02,385 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:29:02,390 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 59 states have internal predecessors, (84), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 21:29:02,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-08 21:29:02,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:29:02,416 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:29:02,417 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:29:02,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:29:02,423 INFO L85 PathProgramCache]: Analyzing trace with hash -191599283, now seen corresponding path program 1 times [2024-11-08 21:29:02,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:29:02,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171366151] [2024-11-08 21:29:02,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:29:02,440 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:29:02,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:29:02,443 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 21:29:02,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 21:29:02,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:29:02,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 21:29:02,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:29:02,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2024-11-08 21:29:02,878 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:29:02,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:29:02,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [171366151] [2024-11-08 21:29:02,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [171366151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:29:02,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:29:02,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:29:02,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021129529] [2024-11-08 21:29:02,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:29:02,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:29:02,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:29:02,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:29:02,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:29:02,930 INFO L87 Difference]: Start difference. First operand has 87 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 59 states have internal predecessors, (84), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 21:29:02,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:29:02,981 INFO L93 Difference]: Finished difference Result 167 states and 292 transitions. [2024-11-08 21:29:02,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:29:02,983 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 171 [2024-11-08 21:29:02,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:29:02,993 INFO L225 Difference]: With dead ends: 167 [2024-11-08 21:29:02,994 INFO L226 Difference]: Without dead ends: 83 [2024-11-08 21:29:03,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:29:03,006 INFO L432 NwaCegarLoop]: 129 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, 129 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:29:03,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:29:03,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-08 21:29:03,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-08 21:29:03,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 55 states have (on average 1.4) internal successors, (77), 55 states have internal predecessors, (77), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 21:29:03,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 129 transitions. [2024-11-08 21:29:03,073 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 129 transitions. Word has length 171 [2024-11-08 21:29:03,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:29:03,073 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 129 transitions. [2024-11-08 21:29:03,074 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 21:29:03,074 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 129 transitions. [2024-11-08 21:29:03,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-08 21:29:03,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:29:03,078 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:29:03,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 21:29:03,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:29:03,283 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:29:03,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:29:03,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1566290821, now seen corresponding path program 1 times [2024-11-08 21:29:03,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:29:03,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [446011623] [2024-11-08 21:29:03,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:29:03,285 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:29:03,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:29:03,289 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 21:29:03,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 21:29:03,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:29:03,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 21:29:03,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:29:04,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 21:29:04,088 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:29:04,088 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:29:04,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [446011623] [2024-11-08 21:29:04,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [446011623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:29:04,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:29:04,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:29:04,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288271428] [2024-11-08 21:29:04,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:29:04,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:29:04,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:29:04,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:29:04,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:29:04,093 INFO L87 Difference]: Start difference. First operand 83 states and 129 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 21:29:05,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:29:05,115 INFO L93 Difference]: Finished difference Result 244 states and 382 transitions. [2024-11-08 21:29:05,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 21:29:05,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2024-11-08 21:29:05,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:29:05,127 INFO L225 Difference]: With dead ends: 244 [2024-11-08 21:29:05,128 INFO L226 Difference]: Without dead ends: 164 [2024-11-08 21:29:05,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:29:05,130 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 76 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 21:29:05,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 422 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 21:29:05,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-08 21:29:05,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 132. [2024-11-08 21:29:05,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 77 states have (on average 1.2857142857142858) internal successors, (99), 77 states have internal predecessors, (99), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-08 21:29:05,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 203 transitions. [2024-11-08 21:29:05,174 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 203 transitions. Word has length 171 [2024-11-08 21:29:05,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:29:05,177 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 203 transitions. [2024-11-08 21:29:05,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 21:29:05,178 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 203 transitions. [2024-11-08 21:29:05,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-08 21:29:05,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:29:05,183 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:29:05,194 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-08 21:29:05,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:29:05,384 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:29:05,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:29:05,386 INFO L85 PathProgramCache]: Analyzing trace with hash 402569930, now seen corresponding path program 1 times [2024-11-08 21:29:05,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:29:05,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [487662861] [2024-11-08 21:29:05,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:29:05,387 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:29:05,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:29:05,389 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 21:29:05,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 21:29:05,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:29:05,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-08 21:29:05,674 INFO L278 TraceCheckSpWp]: Computing forward predicates...