./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-51.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-51.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 15e4d0dfcc9ef1fdaea3d6fc81b9cee681e4ec5bdcd73e128463f69bdd9174a9 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 03:33:48,467 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 03:33:48,532 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 03:33:48,536 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 03:33:48,537 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 03:33:48,566 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 03:33:48,566 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 03:33:48,567 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 03:33:48,567 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 03:33:48,567 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 03:33:48,568 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 03:33:48,568 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 03:33:48,569 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 03:33:48,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 03:33:48,570 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 03:33:48,570 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 03:33:48,570 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 03:33:48,570 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 03:33:48,571 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 03:33:48,571 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 03:33:48,571 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 03:33:48,572 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 03:33:48,573 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 03:33:48,573 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 03:33:48,573 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 03:33:48,574 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 03:33:48,574 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 03:33:48,574 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 03:33:48,575 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 03:33:48,575 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 03:33:48,575 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 03:33:48,576 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 03:33:48,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 03:33:48,576 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 03:33:48,576 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 03:33:48,577 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 03:33:48,577 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 03:33:48,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 03:33:48,578 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 03:33:48,578 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 03:33:48,578 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 03:33:48,579 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 03:33:48,579 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 -> 15e4d0dfcc9ef1fdaea3d6fc81b9cee681e4ec5bdcd73e128463f69bdd9174a9 [2024-11-20 03:33:48,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 03:33:48,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 03:33:48,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 03:33:48,886 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 03:33:48,887 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 03:33:48,888 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-51.i [2024-11-20 03:33:50,376 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 03:33:50,596 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 03:33:50,596 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-51.i [2024-11-20 03:33:50,609 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/070b569fc/027a4cd0d96c412ea1cf962ada626132/FLAGace321647 [2024-11-20 03:33:50,951 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/070b569fc/027a4cd0d96c412ea1cf962ada626132 [2024-11-20 03:33:50,954 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 03:33:50,955 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 03:33:50,956 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 03:33:50,957 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 03:33:50,961 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 03:33:50,962 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:33:50" (1/1) ... [2024-11-20 03:33:50,963 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32552cc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:33:50, skipping insertion in model container [2024-11-20 03:33:50,963 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:33:50" (1/1) ... [2024-11-20 03:33:50,991 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 03:33:51,184 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-51.i[915,928] [2024-11-20 03:33:51,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 03:33:51,272 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 03:33:51,283 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-51.i[915,928] [2024-11-20 03:33:51,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 03:33:51,335 INFO L204 MainTranslator]: Completed translation [2024-11-20 03:33:51,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:33:51 WrapperNode [2024-11-20 03:33:51,336 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 03:33:51,337 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 03:33:51,337 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 03:33:51,337 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 03:33:51,344 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:33:51" (1/1) ... [2024-11-20 03:33:51,354 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:33:51" (1/1) ... [2024-11-20 03:33:51,398 INFO L138 Inliner]: procedures = 26, calls = 50, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 223 [2024-11-20 03:33:51,399 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 03:33:51,401 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 03:33:51,401 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 03:33:51,401 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 03:33:51,413 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:33:51" (1/1) ... [2024-11-20 03:33:51,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:33:51" (1/1) ... [2024-11-20 03:33:51,416 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:33:51" (1/1) ... [2024-11-20 03:33:51,436 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-20 03:33:51,437 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:33:51" (1/1) ... [2024-11-20 03:33:51,437 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:33:51" (1/1) ... [2024-11-20 03:33:51,452 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:33:51" (1/1) ... [2024-11-20 03:33:51,458 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:33:51" (1/1) ... [2024-11-20 03:33:51,464 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:33:51" (1/1) ... [2024-11-20 03:33:51,466 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:33:51" (1/1) ... [2024-11-20 03:33:51,474 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 03:33:51,475 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 03:33:51,475 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 03:33:51,475 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 03:33:51,476 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:33:51" (1/1) ... [2024-11-20 03:33:51,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 03:33:51,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 03:33:51,511 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-20 03:33:51,514 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-20 03:33:51,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 03:33:51,564 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 03:33:51,565 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 03:33:51,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 03:33:51,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 03:33:51,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 03:33:51,703 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 03:33:51,706 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 03:33:52,113 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-20 03:33:52,116 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 03:33:52,133 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 03:33:52,134 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 03:33:52,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:33:52 BoogieIcfgContainer [2024-11-20 03:33:52,134 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 03:33:52,138 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 03:33:52,138 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 03:33:52,141 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 03:33:52,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:33:50" (1/3) ... [2024-11-20 03:33:52,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@95ce2c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:33:52, skipping insertion in model container [2024-11-20 03:33:52,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:33:51" (2/3) ... [2024-11-20 03:33:52,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@95ce2c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:33:52, skipping insertion in model container [2024-11-20 03:33:52,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:33:52" (3/3) ... [2024-11-20 03:33:52,146 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-51.i [2024-11-20 03:33:52,167 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 03:33:52,167 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 03:33:52,244 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 03:33:52,250 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;@45b760de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 03:33:52,251 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 03:33:52,255 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 58 states have (on average 1.3620689655172413) internal successors, (79), 59 states have internal predecessors, (79), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-20 03:33:52,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-20 03:33:52,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:33:52,271 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:33:52,272 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:33:52,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:33:52,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1588593571, now seen corresponding path program 1 times [2024-11-20 03:33:52,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:33:52,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675231466] [2024-11-20 03:33:52,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:33:52,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:33:52,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:52,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:33:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:52,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 03:33:52,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:52,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 03:33:52,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:52,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 03:33:52,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:52,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 03:33:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:52,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 03:33:52,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:52,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 03:33:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:52,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 03:33:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:52,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 03:33:52,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:52,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 03:33:52,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:52,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 03:33:52,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:52,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 03:33:52,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:52,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 03:33:52,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:52,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 03:33:52,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:52,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 03:33:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:52,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 03:33:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:52,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 03:33:52,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:52,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 03:33:52,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:52,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 03:33:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:52,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 03:33:52,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:52,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 03:33:52,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:52,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 03:33:52,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:52,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 03:33:52,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:52,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 03:33:52,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:52,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 03:33:52,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:52,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-20 03:33:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:52,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 03:33:52,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:52,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-20 03:33:52,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:52,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-20 03:33:52,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:52,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-20 03:33:52,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:52,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-20 03:33:52,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:52,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-20 03:33:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:52,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-20 03:33:52,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:52,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-20 03:33:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:52,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-20 03:33:52,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:52,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-20 03:33:52,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:52,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-20 03:33:52,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:52,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-11-20 03:33:52,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:33:52,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675231466] [2024-11-20 03:33:52,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675231466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:33:52,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:33:52,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 03:33:52,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203444069] [2024-11-20 03:33:52,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:33:52,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 03:33:52,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:33:53,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 03:33:53,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 03:33:53,009 INFO L87 Difference]: Start difference. First operand has 98 states, 58 states have (on average 1.3620689655172413) internal successors, (79), 59 states have internal predecessors, (79), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) 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, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-20 03:33:53,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:33:53,059 INFO L93 Difference]: Finished difference Result 189 states and 337 transitions. [2024-11-20 03:33:53,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 03:33:53,061 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, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 2 states have call successors, (37) Word has length 230 [2024-11-20 03:33:53,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:33:53,071 INFO L225 Difference]: With dead ends: 189 [2024-11-20 03:33:53,072 INFO L226 Difference]: Without dead ends: 94 [2024-11-20 03:33:53,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 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-20 03:33:53,086 INFO L432 NwaCegarLoop]: 145 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, 145 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-20 03:33:53,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 03:33:53,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-20 03:33:53,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-20 03:33:53,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 55 states have (on average 1.290909090909091) internal successors, (71), 55 states have internal predecessors, (71), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-20 03:33:53,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 145 transitions. [2024-11-20 03:33:53,153 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 145 transitions. Word has length 230 [2024-11-20 03:33:53,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:33:53,156 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 145 transitions. [2024-11-20 03:33:53,157 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, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-20 03:33:53,157 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 145 transitions. [2024-11-20 03:33:53,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-20 03:33:53,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:33:53,165 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:33:53,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 03:33:53,166 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:33:53,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:33:53,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1977422939, now seen corresponding path program 1 times [2024-11-20 03:33:53,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:33:53,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036292860] [2024-11-20 03:33:53,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:33:53,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:33:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:53,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:33:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:53,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 03:33:53,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:53,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 03:33:53,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:53,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 03:33:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:53,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 03:33:53,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:53,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 03:33:53,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:53,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 03:33:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:53,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 03:33:53,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:53,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 03:33:53,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:53,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 03:33:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:53,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 03:33:53,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:53,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 03:33:53,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:53,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 03:33:53,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:53,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 03:33:53,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:53,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 03:33:53,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:53,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 03:33:53,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:53,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 03:33:53,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:53,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 03:33:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:53,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 03:33:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:53,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 03:33:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:53,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 03:33:53,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:53,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 03:33:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:53,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 03:33:53,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:53,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 03:33:53,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:53,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 03:33:53,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:53,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-20 03:33:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:53,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 03:33:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:53,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-20 03:33:53,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:53,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-20 03:33:53,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:53,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-20 03:33:53,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:53,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-20 03:33:53,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:53,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-20 03:33:53,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:53,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-20 03:33:53,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:53,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-20 03:33:53,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:53,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-20 03:33:53,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:53,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-20 03:33:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:53,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-20 03:33:53,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:54,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-11-20 03:33:54,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:33:54,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036292860] [2024-11-20 03:33:54,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036292860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:33:54,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:33:54,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 03:33:54,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396782088] [2024-11-20 03:33:54,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:33:54,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 03:33:54,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:33:54,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 03:33:54,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 03:33:54,008 INFO L87 Difference]: Start difference. First operand 94 states and 145 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-20 03:33:54,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:33:54,369 INFO L93 Difference]: Finished difference Result 277 states and 430 transitions. [2024-11-20 03:33:54,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 03:33:54,370 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 230 [2024-11-20 03:33:54,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:33:54,377 INFO L225 Difference]: With dead ends: 277 [2024-11-20 03:33:54,377 INFO L226 Difference]: Without dead ends: 186 [2024-11-20 03:33:54,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 03:33:54,379 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 92 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 03:33:54,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 411 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 03:33:54,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-20 03:33:54,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 165. [2024-11-20 03:33:54,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 88 states have internal predecessors, (107), 74 states have call successors, (74), 2 states have call predecessors, (74), 2 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2024-11-20 03:33:54,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 255 transitions. [2024-11-20 03:33:54,436 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 255 transitions. Word has length 230 [2024-11-20 03:33:54,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:33:54,438 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 255 transitions. [2024-11-20 03:33:54,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-20 03:33:54,439 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 255 transitions. [2024-11-20 03:33:54,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-20 03:33:54,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:33:54,447 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:33:54,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 03:33:54,447 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:33:54,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:33:54,448 INFO L85 PathProgramCache]: Analyzing trace with hash -282123477, now seen corresponding path program 1 times [2024-11-20 03:33:54,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:33:54,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435137614] [2024-11-20 03:33:54,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:33:54,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:33:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:54,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:33:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:54,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 03:33:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:54,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 03:33:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:54,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 03:33:54,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:54,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 03:33:54,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:54,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 03:33:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:54,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 03:33:54,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:54,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 03:33:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:54,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 03:33:54,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:54,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 03:33:54,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:54,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 03:33:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:54,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 03:33:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:54,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 03:33:54,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:54,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 03:33:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 03:33:55,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 03:33:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 03:33:55,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 03:33:55,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 03:33:55,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 03:33:55,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 03:33:55,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 03:33:55,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 03:33:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 03:33:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 03:33:55,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-20 03:33:55,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 03:33:55,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-20 03:33:55,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-20 03:33:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-20 03:33:55,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-20 03:33:55,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-20 03:33:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-20 03:33:55,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-20 03:33:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-20 03:33:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-20 03:33:55,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-20 03:33:55,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-11-20 03:33:55,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:33:55,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435137614] [2024-11-20 03:33:55,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435137614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:33:55,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:33:55,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 03:33:55,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720100311] [2024-11-20 03:33:55,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:33:55,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 03:33:55,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:33:55,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 03:33:55,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 03:33:55,143 INFO L87 Difference]: Start difference. First operand 165 states and 255 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-20 03:33:55,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:33:55,479 INFO L93 Difference]: Finished difference Result 354 states and 546 transitions. [2024-11-20 03:33:55,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 03:33:55,480 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 231 [2024-11-20 03:33:55,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:33:55,484 INFO L225 Difference]: With dead ends: 354 [2024-11-20 03:33:55,484 INFO L226 Difference]: Without dead ends: 263 [2024-11-20 03:33:55,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 03:33:55,486 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 103 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 03:33:55,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 486 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 03:33:55,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-20 03:33:55,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 254. [2024-11-20 03:33:55,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 139 states have (on average 1.2446043165467626) internal successors, (173), 139 states have internal predecessors, (173), 111 states have call successors, (111), 3 states have call predecessors, (111), 3 states have return successors, (111), 111 states have call predecessors, (111), 111 states have call successors, (111) [2024-11-20 03:33:55,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 395 transitions. [2024-11-20 03:33:55,527 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 395 transitions. Word has length 231 [2024-11-20 03:33:55,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:33:55,528 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 395 transitions. [2024-11-20 03:33:55,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-20 03:33:55,529 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 395 transitions. [2024-11-20 03:33:55,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-20 03:33:55,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:33:55,533 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:33:55,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 03:33:55,534 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:33:55,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:33:55,534 INFO L85 PathProgramCache]: Analyzing trace with hash 412364478, now seen corresponding path program 1 times [2024-11-20 03:33:55,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:33:55,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902371414] [2024-11-20 03:33:55,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:33:55,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:33:55,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:33:55,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 03:33:55,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 03:33:55,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 03:33:55,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 03:33:55,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 03:33:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 03:33:55,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 03:33:55,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 03:33:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 03:33:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 03:33:55,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 03:33:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 03:33:55,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 03:33:55,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 03:33:55,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 03:33:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 03:33:55,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 03:33:55,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 03:33:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 03:33:55,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 03:33:55,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 03:33:55,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 03:33:55,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 03:33:55,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 03:33:55,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-20 03:33:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 03:33:55,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-20 03:33:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-20 03:33:55,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-20 03:33:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-20 03:33:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-20 03:33:55,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-20 03:33:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-20 03:33:55,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-20 03:33:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:55,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-20 03:33:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:56,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-20 03:33:56,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:56,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-11-20 03:33:56,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:33:56,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902371414] [2024-11-20 03:33:56,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902371414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:33:56,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:33:56,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 03:33:56,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268235264] [2024-11-20 03:33:56,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:33:56,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 03:33:56,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:33:56,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 03:33:56,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 03:33:56,012 INFO L87 Difference]: Start difference. First operand 254 states and 395 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-20 03:33:56,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:33:56,282 INFO L93 Difference]: Finished difference Result 614 states and 959 transitions. [2024-11-20 03:33:56,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 03:33:56,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 232 [2024-11-20 03:33:56,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:33:56,289 INFO L225 Difference]: With dead ends: 614 [2024-11-20 03:33:56,289 INFO L226 Difference]: Without dead ends: 434 [2024-11-20 03:33:56,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 03:33:56,294 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 98 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 03:33:56,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 394 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 03:33:56,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2024-11-20 03:33:56,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 432. [2024-11-20 03:33:56,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 241 states have (on average 1.2614107883817427) internal successors, (304), 241 states have internal predecessors, (304), 185 states have call successors, (185), 5 states have call predecessors, (185), 5 states have return successors, (185), 185 states have call predecessors, (185), 185 states have call successors, (185) [2024-11-20 03:33:56,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 674 transitions. [2024-11-20 03:33:56,370 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 674 transitions. Word has length 232 [2024-11-20 03:33:56,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:33:56,370 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 674 transitions. [2024-11-20 03:33:56,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-20 03:33:56,371 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 674 transitions. [2024-11-20 03:33:56,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-20 03:33:56,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:33:56,374 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:33:56,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 03:33:56,374 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:33:56,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:33:56,375 INFO L85 PathProgramCache]: Analyzing trace with hash 19337468, now seen corresponding path program 1 times [2024-11-20 03:33:56,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:33:56,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946800368] [2024-11-20 03:33:56,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:33:56,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:33:56,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:56,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:33:56,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:56,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 03:33:56,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:56,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 03:33:56,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:56,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 03:33:56,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:56,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 03:33:56,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:56,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 03:33:56,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:56,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 03:33:56,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:56,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 03:33:56,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:56,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 03:33:56,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:56,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 03:33:56,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:56,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 03:33:56,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:56,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 03:33:56,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:56,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 03:33:56,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:56,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 03:33:56,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:56,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 03:33:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:56,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 03:33:56,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:56,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 03:33:56,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:56,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 03:33:56,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:56,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 03:33:56,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:56,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 03:33:56,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:56,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 03:33:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:56,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 03:33:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:56,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 03:33:56,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:56,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 03:33:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:56,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 03:33:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:56,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-20 03:33:56,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:56,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 03:33:56,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:56,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-20 03:33:56,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:56,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-20 03:33:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:56,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-20 03:33:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:56,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-20 03:33:56,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:56,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-20 03:33:56,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:56,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-20 03:33:56,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:56,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-20 03:33:56,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:56,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-20 03:33:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:56,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-20 03:33:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:56,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-20 03:33:56,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:56,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-11-20 03:33:56,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:33:56,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946800368] [2024-11-20 03:33:56,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946800368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:33:56,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:33:56,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 03:33:56,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746633484] [2024-11-20 03:33:56,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:33:56,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 03:33:56,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:33:56,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 03:33:56,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 03:33:56,675 INFO L87 Difference]: Start difference. First operand 432 states and 674 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-20 03:33:56,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:33:56,737 INFO L93 Difference]: Finished difference Result 800 states and 1252 transitions. [2024-11-20 03:33:56,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 03:33:56,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 232 [2024-11-20 03:33:56,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:33:56,742 INFO L225 Difference]: With dead ends: 800 [2024-11-20 03:33:56,742 INFO L226 Difference]: Without dead ends: 442 [2024-11-20 03:33:56,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 03:33:56,745 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 17 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 03:33:56,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 293 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 03:33:56,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-11-20 03:33:56,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 432. [2024-11-20 03:33:56,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 241 states have (on average 1.2448132780082988) internal successors, (300), 241 states have internal predecessors, (300), 185 states have call successors, (185), 5 states have call predecessors, (185), 5 states have return successors, (185), 185 states have call predecessors, (185), 185 states have call successors, (185) [2024-11-20 03:33:56,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 670 transitions. [2024-11-20 03:33:56,848 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 670 transitions. Word has length 232 [2024-11-20 03:33:56,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:33:56,849 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 670 transitions. [2024-11-20 03:33:56,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-20 03:33:56,850 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 670 transitions. [2024-11-20 03:33:56,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-20 03:33:56,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:33:56,853 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:33:56,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 03:33:56,854 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:33:56,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:33:56,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1635973120, now seen corresponding path program 1 times [2024-11-20 03:33:56,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:33:56,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802638625] [2024-11-20 03:33:56,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:33:56,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:33:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:57,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:33:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:57,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 03:33:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:57,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 03:33:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:57,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 03:33:57,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:57,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 03:33:57,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:57,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 03:33:57,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:57,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 03:33:57,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:57,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 03:33:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:57,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 03:33:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:57,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 03:33:57,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:57,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 03:33:57,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:57,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 03:33:57,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:57,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 03:33:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:57,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 03:33:57,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:57,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 03:33:57,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:57,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 03:33:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:57,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 03:33:57,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:57,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 03:33:57,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:57,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 03:33:57,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:57,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 03:33:57,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:57,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 03:33:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:57,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 03:33:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:57,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 03:33:57,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:57,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 03:33:57,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:57,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 03:33:57,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:57,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-20 03:33:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:57,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 03:33:57,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:57,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-20 03:33:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:57,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-20 03:33:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:57,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-20 03:33:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:57,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-20 03:33:57,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:57,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-20 03:33:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:57,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-20 03:33:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:57,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-20 03:33:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:57,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-20 03:33:57,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:57,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-20 03:33:57,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:57,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-20 03:33:57,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:57,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 24 proven. 84 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2024-11-20 03:33:57,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:33:57,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802638625] [2024-11-20 03:33:57,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802638625] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 03:33:57,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143525078] [2024-11-20 03:33:57,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:33:57,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 03:33:57,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 03:33:57,265 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-20 03:33:57,266 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-20 03:33:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:57,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 03:33:57,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 03:33:57,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 948 proven. 84 refuted. 0 times theorem prover too weak. 1632 trivial. 0 not checked. [2024-11-20 03:33:57,752 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 03:33:58,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 24 proven. 84 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2024-11-20 03:33:58,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143525078] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 03:33:58,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 03:33:58,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-20 03:33:58,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389808858] [2024-11-20 03:33:58,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 03:33:58,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 03:33:58,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:33:58,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 03:33:58,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 03:33:58,065 INFO L87 Difference]: Start difference. First operand 432 states and 670 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 3 states have call successors, (93), 2 states have call predecessors, (93), 4 states have return successors, (94), 3 states have call predecessors, (94), 3 states have call successors, (94) [2024-11-20 03:33:58,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:33:58,349 INFO L93 Difference]: Finished difference Result 642 states and 975 transitions. [2024-11-20 03:33:58,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 03:33:58,350 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 3 states have call successors, (93), 2 states have call predecessors, (93), 4 states have return successors, (94), 3 states have call predecessors, (94), 3 states have call successors, (94) Word has length 233 [2024-11-20 03:33:58,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:33:58,354 INFO L225 Difference]: With dead ends: 642 [2024-11-20 03:33:58,354 INFO L226 Difference]: Without dead ends: 462 [2024-11-20 03:33:58,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 536 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-20 03:33:58,356 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 81 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 03:33:58,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 220 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 03:33:58,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-11-20 03:33:58,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 266. [2024-11-20 03:33:58,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 148 states have (on average 1.2027027027027026) internal successors, (178), 148 states have internal predecessors, (178), 111 states have call successors, (111), 6 states have call predecessors, (111), 6 states have return successors, (111), 111 states have call predecessors, (111), 111 states have call successors, (111) [2024-11-20 03:33:58,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 400 transitions. [2024-11-20 03:33:58,404 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 400 transitions. Word has length 233 [2024-11-20 03:33:58,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:33:58,404 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 400 transitions. [2024-11-20 03:33:58,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 3 states have call successors, (93), 2 states have call predecessors, (93), 4 states have return successors, (94), 3 states have call predecessors, (94), 3 states have call successors, (94) [2024-11-20 03:33:58,405 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 400 transitions. [2024-11-20 03:33:58,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-20 03:33:58,407 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:33:58,407 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:33:58,417 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-20 03:33:58,611 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-20 03:33:58,612 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:33:58,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:33:58,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1242946110, now seen corresponding path program 1 times [2024-11-20 03:33:58,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:33:58,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522569279] [2024-11-20 03:33:58,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:33:58,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:33:58,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:58,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:33:58,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:58,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 03:33:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:58,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 03:33:58,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:58,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 03:33:58,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:58,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 03:33:58,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:58,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 03:33:58,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:58,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 03:33:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:58,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 03:33:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:58,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 03:33:58,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:58,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 03:33:58,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:58,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 03:33:58,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:58,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 03:33:58,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:58,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 03:33:58,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:58,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 03:33:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:58,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 03:33:58,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:58,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 03:33:59,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:59,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 03:33:59,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:59,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 03:33:59,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:59,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 03:33:59,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:59,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 03:33:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:59,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 03:33:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:59,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 03:33:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:59,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 03:33:59,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:59,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 03:33:59,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:59,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 03:33:59,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:59,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-20 03:33:59,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:59,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 03:33:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:59,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-20 03:33:59,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:59,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-20 03:33:59,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:59,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-20 03:33:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:59,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-20 03:33:59,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:59,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-20 03:33:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:59,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-20 03:33:59,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:59,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-20 03:33:59,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:59,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-20 03:33:59,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:59,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-20 03:33:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:59,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-20 03:33:59,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:59,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 54 proven. 54 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2024-11-20 03:33:59,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:33:59,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522569279] [2024-11-20 03:33:59,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522569279] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 03:33:59,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588074692] [2024-11-20 03:33:59,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:33:59,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 03:33:59,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 03:33:59,102 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 03:33:59,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 03:33:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:33:59,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 03:33:59,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 03:33:59,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 1368 proven. 54 refuted. 0 times theorem prover too weak. 1242 trivial. 0 not checked. [2024-11-20 03:33:59,544 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 03:33:59,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 54 proven. 54 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2024-11-20 03:33:59,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588074692] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 03:33:59,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 03:33:59,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2024-11-20 03:33:59,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402760035] [2024-11-20 03:33:59,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 03:33:59,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 03:33:59,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:33:59,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 03:33:59,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-20 03:33:59,832 INFO L87 Difference]: Start difference. First operand 266 states and 400 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) [2024-11-20 03:34:00,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:34:00,786 INFO L93 Difference]: Finished difference Result 590 states and 855 transitions. [2024-11-20 03:34:00,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-20 03:34:00,786 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) Word has length 233 [2024-11-20 03:34:00,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:34:00,791 INFO L225 Difference]: With dead ends: 590 [2024-11-20 03:34:00,791 INFO L226 Difference]: Without dead ends: 495 [2024-11-20 03:34:00,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 562 GetRequests, 536 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=466, Unknown=0, NotChecked=0, Total=650 [2024-11-20 03:34:00,794 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 226 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 03:34:00,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 650 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 03:34:00,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2024-11-20 03:34:00,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 364. [2024-11-20 03:34:00,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 205 states have (on average 1.1560975609756097) internal successors, (237), 207 states have internal predecessors, (237), 145 states have call successors, (145), 13 states have call predecessors, (145), 13 states have return successors, (145), 143 states have call predecessors, (145), 145 states have call successors, (145) [2024-11-20 03:34:00,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 527 transitions. [2024-11-20 03:34:00,861 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 527 transitions. Word has length 233 [2024-11-20 03:34:00,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:34:00,862 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 527 transitions. [2024-11-20 03:34:00,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 2 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) [2024-11-20 03:34:00,862 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 527 transitions. [2024-11-20 03:34:00,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-20 03:34:00,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:34:00,865 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:34:00,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 03:34:01,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-20 03:34:01,066 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:34:01,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:34:01,067 INFO L85 PathProgramCache]: Analyzing trace with hash -68027339, now seen corresponding path program 1 times [2024-11-20 03:34:01,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:34:01,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468240420] [2024-11-20 03:34:01,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:34:01,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:34:01,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 03:34:01,202 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 03:34:01,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 03:34:01,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 03:34:01,392 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 03:34:01,393 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 03:34:01,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 03:34:01,398 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 03:34:01,561 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 03:34:01,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 03:34:01 BoogieIcfgContainer [2024-11-20 03:34:01,564 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 03:34:01,564 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 03:34:01,565 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 03:34:01,565 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 03:34:01,565 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:33:52" (3/4) ... [2024-11-20 03:34:01,568 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 03:34:01,569 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 03:34:01,569 INFO L158 Benchmark]: Toolchain (without parser) took 10614.46ms. Allocated memory was 176.2MB in the beginning and 272.6MB in the end (delta: 96.5MB). Free memory was 137.0MB in the beginning and 140.0MB in the end (delta: -3.1MB). Peak memory consumption was 93.2MB. Max. memory is 16.1GB. [2024-11-20 03:34:01,570 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 77.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 03:34:01,570 INFO L158 Benchmark]: CACSL2BoogieTranslator took 379.80ms. Allocated memory is still 176.2MB. Free memory was 137.0MB in the beginning and 120.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 03:34:01,570 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.62ms. Allocated memory is still 176.2MB. Free memory was 120.2MB in the beginning and 116.9MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 03:34:01,570 INFO L158 Benchmark]: Boogie Preprocessor took 73.22ms. Allocated memory is still 176.2MB. Free memory was 116.9MB in the beginning and 113.0MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 03:34:01,571 INFO L158 Benchmark]: RCFGBuilder took 659.54ms. Allocated memory is still 176.2MB. Free memory was 113.0MB in the beginning and 124.5MB in the end (delta: -11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-20 03:34:01,571 INFO L158 Benchmark]: TraceAbstraction took 9426.54ms. Allocated memory was 176.2MB in the beginning and 272.6MB in the end (delta: 96.5MB). Free memory was 124.1MB in the beginning and 141.1MB in the end (delta: -17.0MB). Peak memory consumption was 81.6MB. Max. memory is 16.1GB. [2024-11-20 03:34:01,571 INFO L158 Benchmark]: Witness Printer took 4.49ms. Allocated memory is still 272.6MB. Free memory is still 140.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 03:34:01,573 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.16ms. Allocated memory is still 109.1MB. Free memory is still 77.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 379.80ms. Allocated memory is still 176.2MB. Free memory was 137.0MB in the beginning and 120.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.62ms. Allocated memory is still 176.2MB. Free memory was 120.2MB in the beginning and 116.9MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.22ms. Allocated memory is still 176.2MB. Free memory was 116.9MB in the beginning and 113.0MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 659.54ms. Allocated memory is still 176.2MB. Free memory was 113.0MB in the beginning and 124.5MB in the end (delta: -11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9426.54ms. Allocated memory was 176.2MB in the beginning and 272.6MB in the end (delta: 96.5MB). Free memory was 124.1MB in the beginning and 141.1MB in the end (delta: -17.0MB). Peak memory consumption was 81.6MB. Max. memory is 16.1GB. * Witness Printer took 4.49ms. Allocated memory is still 272.6MB. Free memory is still 140.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 199, overapproximation of someBinaryFLOATComparisonOperation at line 74, overapproximation of someUnaryDOUBLEoperation at line 37. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 128; [L23] double var_1_4 = 32.3; [L24] double var_1_5 = 0.25; [L25] unsigned char var_1_7 = 2; [L26] signed char var_1_8 = -10; [L27] signed char var_1_9 = 5; [L28] signed char var_1_10 = 4; [L29] signed char var_1_11 = 100; [L30] unsigned long int var_1_12 = 8; [L31] unsigned char var_1_13 = 0; [L32] unsigned long int var_1_15 = 1114432789; [L33] double var_1_17 = 256.8; [L34] double var_1_18 = 1.25; [L35] unsigned long int var_1_19 = 16; [L36] unsigned char var_1_21 = 1; [L37] double var_1_22 = -0.5; [L38] unsigned char var_1_23 = 0; [L39] unsigned char var_1_24 = 1; [L40] float var_1_25 = -0.575; [L41] float var_1_26 = 1.5; [L42] unsigned long int var_1_27 = 64; [L43] unsigned long int var_1_28 = 2; [L44] unsigned long int var_1_29 = 25; [L45] float var_1_30 = 255.4; [L46] signed long int var_1_31 = 128; [L47] signed long int var_1_32 = -32; [L48] unsigned long int var_1_33 = 25; [L49] unsigned long int var_1_34 = 0; [L50] unsigned long int var_1_35 = 16; [L51] unsigned short int var_1_36 = 32; [L52] unsigned short int var_1_37 = 16; [L53] unsigned short int var_1_38 = 2; [L54] unsigned short int var_1_39 = 5; [L55] signed long int var_1_40 = 100000000; [L56] unsigned char last_1_var_1_1 = 128; [L57] unsigned long int last_1_var_1_12 = 8; [L58] double last_1_var_1_17 = 256.8; [L59] unsigned char last_1_var_1_21 = 1; VAL [isInitial=0, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_4=323/10, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L203] isInitial = 1 [L204] FCALL initially() [L205] COND TRUE 1 [L206] CALL updateLastVariables() [L193] last_1_var_1_1 = var_1_1 [L194] last_1_var_1_12 = var_1_12 [L195] last_1_var_1_17 = var_1_17 [L196] last_1_var_1_21 = var_1_21 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_4=323/10, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L206] RET updateLastVariables() [L207] CALL updateVariables() [L133] var_1_4 = __VERIFIER_nondet_double() [L134] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L134] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L135] var_1_5 = __VERIFIER_nondet_double() [L136] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=2, var_1_8=-10, var_1_9=5] [L136] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=2, var_1_8=-10, var_1_9=5] [L137] var_1_7 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_8=-10, var_1_9=5] [L138] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_8=-10, var_1_9=5] [L139] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=5] [L139] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=5] [L140] var_1_9 = __VERIFIER_nondet_char() [L141] CALL assume_abort_if_not(var_1_9 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L141] RET assume_abort_if_not(var_1_9 >= -1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L142] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L142] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L143] var_1_10 = __VERIFIER_nondet_char() [L144] CALL assume_abort_if_not(var_1_10 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L144] RET assume_abort_if_not(var_1_10 >= -1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L145] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L145] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L146] var_1_11 = __VERIFIER_nondet_char() [L147] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L147] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L148] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L148] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L149] var_1_13 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L150] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L151] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L151] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L152] var_1_15 = __VERIFIER_nondet_ulong() [L153] CALL assume_abort_if_not(var_1_15 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L153] RET assume_abort_if_not(var_1_15 >= 1073741823) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L154] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L154] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L155] var_1_18 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L156] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L157] var_1_22 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L158] RET assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L159] CALL assume_abort_if_not(var_1_22 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L159] RET assume_abort_if_not(var_1_22 != 0.0F) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L160] var_1_23 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L161] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L162] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L162] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L163] var_1_24 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L164] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L165] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L165] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_26=3/2, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L166] var_1_26 = __VERIFIER_nondet_float() [L167] CALL assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L167] RET assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L168] var_1_28 = __VERIFIER_nondet_ulong() [L169] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L169] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L170] CALL assume_abort_if_not(var_1_28 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=-2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=-2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L170] RET assume_abort_if_not(var_1_28 <= 4294967294) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=-2, var_1_29=25, var_1_30=1277/5, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L171] var_1_30 = __VERIFIER_nondet_float() [L172] CALL assume_abort_if_not((var_1_30 >= -922337.2036854776000e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854776000e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=-2, var_1_29=25, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=-2, var_1_29=25, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L172] RET assume_abort_if_not((var_1_30 >= -922337.2036854776000e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854776000e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=-2, var_1_29=25, var_1_31=128, var_1_32=-32, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L173] var_1_32 = __VERIFIER_nondet_long() [L174] CALL assume_abort_if_not(var_1_32 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=-2, var_1_29=25, var_1_31=128, var_1_32=2147483646, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=-2, var_1_29=25, var_1_31=128, var_1_32=2147483646, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L174] RET assume_abort_if_not(var_1_32 >= -2147483647) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=-2, var_1_29=25, var_1_31=128, var_1_32=2147483646, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L175] CALL assume_abort_if_not(var_1_32 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=-2, var_1_29=25, var_1_31=128, var_1_32=2147483646, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=-2, var_1_29=25, var_1_31=128, var_1_32=2147483646, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L175] RET assume_abort_if_not(var_1_32 <= 2147483646) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=-2, var_1_29=25, var_1_31=128, var_1_32=2147483646, var_1_33=25, var_1_34=0, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L176] var_1_34 = __VERIFIER_nondet_ulong() [L177] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=-2, var_1_29=25, var_1_31=128, var_1_32=2147483646, var_1_33=25, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=-2, var_1_29=25, var_1_31=128, var_1_32=2147483646, var_1_33=25, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L177] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=-2, var_1_29=25, var_1_31=128, var_1_32=2147483646, var_1_33=25, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L178] CALL assume_abort_if_not(var_1_34 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=-2, var_1_29=25, var_1_31=128, var_1_32=2147483646, var_1_33=25, var_1_34=-2147483649, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=-2, var_1_29=25, var_1_31=128, var_1_32=2147483646, var_1_33=25, var_1_34=-2147483649, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L178] RET assume_abort_if_not(var_1_34 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=-2, var_1_29=25, var_1_31=128, var_1_32=2147483646, var_1_33=25, var_1_34=-2147483649, var_1_35=16, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L179] var_1_35 = __VERIFIER_nondet_ulong() [L180] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=-2, var_1_29=25, var_1_31=128, var_1_32=2147483646, var_1_33=25, var_1_34=-2147483649, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=-2, var_1_29=25, var_1_31=128, var_1_32=2147483646, var_1_33=25, var_1_34=-2147483649, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L180] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=-2, var_1_29=25, var_1_31=128, var_1_32=2147483646, var_1_33=25, var_1_34=-2147483649, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L181] CALL assume_abort_if_not(var_1_35 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=-2, var_1_29=25, var_1_31=128, var_1_32=2147483646, var_1_33=25, var_1_34=-2147483649, var_1_35=2147483647, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=-2, var_1_29=25, var_1_31=128, var_1_32=2147483646, var_1_33=25, var_1_34=-2147483649, var_1_35=2147483647, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L181] RET assume_abort_if_not(var_1_35 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=-2, var_1_29=25, var_1_31=128, var_1_32=2147483646, var_1_33=25, var_1_34=-2147483649, var_1_35=2147483647, var_1_36=32, var_1_37=16, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L182] var_1_37 = __VERIFIER_nondet_ushort() [L183] CALL assume_abort_if_not(var_1_37 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=-2, var_1_29=25, var_1_31=128, var_1_32=2147483646, var_1_33=25, var_1_34=-2147483649, var_1_35=2147483647, var_1_36=32, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=-2, var_1_29=25, var_1_31=128, var_1_32=2147483646, var_1_33=25, var_1_34=-2147483649, var_1_35=2147483647, var_1_36=32, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L183] RET assume_abort_if_not(var_1_37 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=-2, var_1_29=25, var_1_31=128, var_1_32=2147483646, var_1_33=25, var_1_34=-2147483649, var_1_35=2147483647, var_1_36=32, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L184] CALL assume_abort_if_not(var_1_37 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=-2, var_1_29=25, var_1_31=128, var_1_32=2147483646, var_1_33=25, var_1_34=-2147483649, var_1_35=2147483647, var_1_36=32, var_1_37=65534, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=-2, var_1_29=25, var_1_31=128, var_1_32=2147483646, var_1_33=25, var_1_34=-2147483649, var_1_35=2147483647, var_1_36=32, var_1_37=65534, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L184] RET assume_abort_if_not(var_1_37 <= 65534) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=-2, var_1_29=25, var_1_31=128, var_1_32=2147483646, var_1_33=25, var_1_34=-2147483649, var_1_35=2147483647, var_1_36=32, var_1_37=65534, var_1_38=2, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L185] var_1_38 = __VERIFIER_nondet_ushort() [L186] CALL assume_abort_if_not(var_1_38 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=-2, var_1_29=25, var_1_31=128, var_1_32=2147483646, var_1_33=25, var_1_34=-2147483649, var_1_35=2147483647, var_1_36=32, var_1_37=65534, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=-2, var_1_29=25, var_1_31=128, var_1_32=2147483646, var_1_33=25, var_1_34=-2147483649, var_1_35=2147483647, var_1_36=32, var_1_37=65534, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L186] RET assume_abort_if_not(var_1_38 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=-2, var_1_29=25, var_1_31=128, var_1_32=2147483646, var_1_33=25, var_1_34=-2147483649, var_1_35=2147483647, var_1_36=32, var_1_37=65534, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L187] CALL assume_abort_if_not(var_1_38 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=-2, var_1_29=25, var_1_31=128, var_1_32=2147483646, var_1_33=25, var_1_34=-2147483649, var_1_35=2147483647, var_1_36=32, var_1_37=65534, var_1_38=65534, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=-2, var_1_29=25, var_1_31=128, var_1_32=2147483646, var_1_33=25, var_1_34=-2147483649, var_1_35=2147483647, var_1_36=32, var_1_37=65534, var_1_38=65534, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L187] RET assume_abort_if_not(var_1_38 <= 65534) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=-2, var_1_29=25, var_1_31=128, var_1_32=2147483646, var_1_33=25, var_1_34=-2147483649, var_1_35=2147483647, var_1_36=32, var_1_37=65534, var_1_38=65534, var_1_39=5, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L188] var_1_39 = __VERIFIER_nondet_ushort() [L189] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=-2, var_1_29=25, var_1_31=128, var_1_32=2147483646, var_1_33=25, var_1_34=-2147483649, var_1_35=2147483647, var_1_36=32, var_1_37=65534, var_1_38=65534, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=-2, var_1_29=25, var_1_31=128, var_1_32=2147483646, var_1_33=25, var_1_34=-2147483649, var_1_35=2147483647, var_1_36=32, var_1_37=65534, var_1_38=65534, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L189] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=-2, var_1_29=25, var_1_31=128, var_1_32=2147483646, var_1_33=25, var_1_34=-2147483649, var_1_35=2147483647, var_1_36=32, var_1_37=65534, var_1_38=65534, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L190] CALL assume_abort_if_not(var_1_39 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=-2, var_1_29=25, var_1_31=128, var_1_32=2147483646, var_1_33=25, var_1_34=-2147483649, var_1_35=2147483647, var_1_36=32, var_1_37=65534, var_1_38=65534, var_1_39=65534, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=-2, var_1_29=25, var_1_31=128, var_1_32=2147483646, var_1_33=25, var_1_34=-2147483649, var_1_35=2147483647, var_1_36=32, var_1_37=65534, var_1_38=65534, var_1_39=65534, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L190] RET assume_abort_if_not(var_1_39 <= 65534) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_27=64, var_1_28=-2, var_1_29=25, var_1_31=128, var_1_32=2147483646, var_1_33=25, var_1_34=-2147483649, var_1_35=2147483647, var_1_36=32, var_1_37=65534, var_1_38=65534, var_1_39=65534, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L207] RET updateVariables() [L208] CALL step() [L63] var_1_25 = var_1_26 [L64] var_1_27 = var_1_28 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2147483652, var_1_26=2147483652, var_1_27=-2, var_1_28=-2, var_1_29=25, var_1_31=128, var_1_32=2147483646, var_1_33=25, var_1_34=-2147483649, var_1_35=2147483647, var_1_36=32, var_1_37=65534, var_1_38=65534, var_1_39=65534, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L65] COND TRUE (var_1_25 + var_1_26) <= var_1_30 [L66] var_1_29 = ((((5u) < 0 ) ? -(5u) : (5u))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2147483652, var_1_26=2147483652, var_1_27=-2, var_1_28=-2, var_1_29=5, var_1_31=128, var_1_32=2147483646, var_1_33=25, var_1_34=-2147483649, var_1_35=2147483647, var_1_36=32, var_1_37=65534, var_1_38=65534, var_1_39=65534, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L70] var_1_31 = var_1_32 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2147483652, var_1_26=2147483652, var_1_27=-2, var_1_28=-2, var_1_29=5, var_1_31=2147483646, var_1_32=2147483646, var_1_33=25, var_1_34=-2147483649, var_1_35=2147483647, var_1_36=32, var_1_37=65534, var_1_38=65534, var_1_39=65534, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L71] COND TRUE var_1_32 >= var_1_29 [L72] var_1_33 = (((((((var_1_28) > ((var_1_34 + var_1_35))) ? (var_1_28) : ((var_1_34 + var_1_35)))) < 0 ) ? -((((var_1_28) > ((var_1_34 + var_1_35))) ? (var_1_28) : ((var_1_34 + var_1_35)))) : ((((var_1_28) > ((var_1_34 + var_1_35))) ? (var_1_28) : ((var_1_34 + var_1_35)))))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2147483652, var_1_26=2147483652, var_1_27=-2, var_1_28=-2, var_1_29=5, var_1_31=2147483646, var_1_32=2147483646, var_1_33=-2, var_1_34=-2147483649, var_1_35=2147483647, var_1_36=32, var_1_37=65534, var_1_38=65534, var_1_39=65534, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L74] COND TRUE var_1_25 == var_1_30 [L75] var_1_36 = ((((((((var_1_37) < (var_1_38)) ? (var_1_37) : (var_1_38)))) < (var_1_39)) ? (((((var_1_37) < (var_1_38)) ? (var_1_37) : (var_1_38)))) : (var_1_39))) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2147483652, var_1_26=2147483652, var_1_27=-2, var_1_28=-2, var_1_29=5, var_1_31=2147483646, var_1_32=2147483646, var_1_33=-2, var_1_34=-2147483649, var_1_35=2147483647, var_1_36=65534, var_1_37=65534, var_1_38=65534, var_1_39=65534, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L77] COND FALSE !(((((var_1_32) < 0 ) ? -(var_1_32) : (var_1_32))) < (~ var_1_39)) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2147483652, var_1_26=2147483652, var_1_27=-2, var_1_28=-2, var_1_29=5, var_1_31=2147483646, var_1_32=2147483646, var_1_33=-2, var_1_34=-2147483649, var_1_35=2147483647, var_1_36=65534, var_1_37=65534, var_1_38=65534, var_1_39=65534, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L80] unsigned char stepLocal_3 = ((((var_1_4) > (last_1_var_1_17)) ? (var_1_4) : (last_1_var_1_17))) > var_1_18; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_3=0, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2147483652, var_1_26=2147483652, var_1_27=-2, var_1_28=-2, var_1_29=5, var_1_31=2147483646, var_1_32=2147483646, var_1_33=-2, var_1_34=-2147483649, var_1_35=2147483647, var_1_36=65534, var_1_37=65534, var_1_38=65534, var_1_39=65534, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L81] COND TRUE last_1_var_1_21 || stepLocal_3 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2147483652, var_1_26=2147483652, var_1_27=-2, var_1_28=-2, var_1_29=5, var_1_31=2147483646, var_1_32=2147483646, var_1_33=-2, var_1_34=-2147483649, var_1_35=2147483647, var_1_36=65534, var_1_37=65534, var_1_38=65534, var_1_39=65534, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L82] COND TRUE var_1_18 > ((((last_1_var_1_17) < 0 ) ? -(last_1_var_1_17) : (last_1_var_1_17))) [L83] var_1_19 = last_1_var_1_1 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2147483652, var_1_26=2147483652, var_1_27=-2, var_1_28=-2, var_1_29=5, var_1_31=2147483646, var_1_32=2147483646, var_1_33=-2, var_1_34=-2147483649, var_1_35=2147483647, var_1_36=65534, var_1_37=65534, var_1_38=65534, var_1_39=65534, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L90] unsigned long int stepLocal_1 = last_1_var_1_12; [L91] unsigned long int stepLocal_0 = 32u; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_0=32, stepLocal_1=8, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2147483652, var_1_26=2147483652, var_1_27=-2, var_1_28=-2, var_1_29=5, var_1_31=2147483646, var_1_32=2147483646, var_1_33=-2, var_1_34=-2147483649, var_1_35=2147483647, var_1_36=65534, var_1_37=65534, var_1_38=65534, var_1_39=65534, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L92] COND TRUE stepLocal_0 >= last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_1=8, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2147483652, var_1_26=2147483652, var_1_27=-2, var_1_28=-2, var_1_29=5, var_1_31=2147483646, var_1_32=2147483646, var_1_33=-2, var_1_34=-2147483649, var_1_35=2147483647, var_1_36=65534, var_1_37=65534, var_1_38=65534, var_1_39=65534, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L93] COND TRUE stepLocal_1 <= last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2147483652, var_1_26=2147483652, var_1_27=-2, var_1_28=-2, var_1_29=5, var_1_31=2147483646, var_1_32=2147483646, var_1_33=-2, var_1_34=-2147483649, var_1_35=2147483647, var_1_36=65534, var_1_37=65534, var_1_38=65534, var_1_39=65534, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L94] COND TRUE (var_1_4 - var_1_5) >= last_1_var_1_17 [L95] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=-2, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2147483652, var_1_26=2147483652, var_1_27=-2, var_1_28=-2, var_1_29=5, var_1_31=2147483646, var_1_32=2147483646, var_1_33=-2, var_1_34=-2147483649, var_1_35=2147483647, var_1_36=65534, var_1_37=65534, var_1_38=65534, var_1_39=65534, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L101] COND FALSE !((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=-2, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2147483652, var_1_26=2147483652, var_1_27=-2, var_1_28=-2, var_1_29=5, var_1_31=2147483646, var_1_32=2147483646, var_1_33=-2, var_1_34=-2147483649, var_1_35=2147483647, var_1_36=65534, var_1_37=65534, var_1_38=65534, var_1_39=65534, var_1_40=100000000, var_1_7=-2, var_1_8=-10, var_1_9=126] [L104] COND TRUE ! (var_1_17 > var_1_5) [L105] var_1_8 = (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=-2, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2147483652, var_1_26=2147483652, var_1_27=-2, var_1_28=-2, var_1_29=5, var_1_31=2147483646, var_1_32=2147483646, var_1_33=-2, var_1_34=-2147483649, var_1_35=2147483647, var_1_36=65534, var_1_37=65534, var_1_38=65534, var_1_39=65534, var_1_40=100000000, var_1_7=-2, var_1_8=126, var_1_9=126] [L109] unsigned long int stepLocal_4 = var_1_19; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=-2, var_1_21=1, var_1_23=0, var_1_24=1, var_1_25=2147483652, var_1_26=2147483652, var_1_27=-2, var_1_28=-2, var_1_29=5, var_1_31=2147483646, var_1_32=2147483646, var_1_33=-2, var_1_34=-2147483649, var_1_35=2147483647, var_1_36=65534, var_1_37=65534, var_1_38=65534, var_1_39=65534, var_1_40=100000000, var_1_7=-2, var_1_8=126, var_1_9=126] [L110] COND FALSE !((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) [L121] var_1_21 = var_1_23 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=-2, var_1_21=0, var_1_23=0, var_1_24=1, var_1_25=2147483652, var_1_26=2147483652, var_1_27=-2, var_1_28=-2, var_1_29=5, var_1_31=2147483646, var_1_32=2147483646, var_1_33=-2, var_1_34=-2147483649, var_1_35=2147483647, var_1_36=65534, var_1_37=65534, var_1_38=65534, var_1_39=65534, var_1_40=100000000, var_1_7=-2, var_1_8=126, var_1_9=126] [L123] unsigned char stepLocal_2 = var_1_21; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_2=0, stepLocal_4=128, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=-2, var_1_21=0, var_1_23=0, var_1_24=1, var_1_25=2147483652, var_1_26=2147483652, var_1_27=-2, var_1_28=-2, var_1_29=5, var_1_31=2147483646, var_1_32=2147483646, var_1_33=-2, var_1_34=-2147483649, var_1_35=2147483647, var_1_36=65534, var_1_37=65534, var_1_38=65534, var_1_39=65534, var_1_40=100000000, var_1_7=-2, var_1_8=126, var_1_9=126] [L124] COND FALSE !(var_1_21 && stepLocal_2) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=-2, var_1_21=0, var_1_23=0, var_1_24=1, var_1_25=2147483652, var_1_26=2147483652, var_1_27=-2, var_1_28=-2, var_1_29=5, var_1_31=2147483646, var_1_32=2147483646, var_1_33=-2, var_1_34=-2147483649, var_1_35=2147483647, var_1_36=65534, var_1_37=65534, var_1_38=65534, var_1_39=65534, var_1_40=100000000, var_1_7=-2, var_1_8=126, var_1_9=126] [L127] COND FALSE !(\read(var_1_21)) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, stepLocal_4=128, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=-2, var_1_21=0, var_1_23=0, var_1_24=1, var_1_25=2147483652, var_1_26=2147483652, var_1_27=-2, var_1_28=-2, var_1_29=5, var_1_31=2147483646, var_1_32=2147483646, var_1_33=-2, var_1_34=-2147483649, var_1_35=2147483647, var_1_36=65534, var_1_37=65534, var_1_38=65534, var_1_39=65534, var_1_40=100000000, var_1_7=-2, var_1_8=126, var_1_9=126] [L208] RET step() [L209] CALL, EXPR property() [L199-L200] return ((((((32u >= last_1_var_1_12) ? ((last_1_var_1_12 <= last_1_var_1_12) ? (((var_1_4 - var_1_5) >= last_1_var_1_17) ? (var_1_1 == ((unsigned char) var_1_7)) : 1) : 1) : (var_1_1 == ((unsigned char) var_1_7))) && ((! (var_1_17 > var_1_5)) ? (var_1_8 == ((signed char) (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11))) : (var_1_8 == ((signed char) -4)))) && ((var_1_21 && var_1_21) ? (var_1_12 == ((unsigned long int) var_1_11)) : (var_1_21 ? (var_1_12 == ((unsigned long int) (((((var_1_19) > ((var_1_11 + var_1_7))) ? (var_1_19) : ((var_1_11 + var_1_7)))) + (var_1_15 - var_1_1)))) : 1))) && (((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) ? (var_1_17 == ((double) var_1_18)) : 1)) && ((last_1_var_1_21 || (((((var_1_4) > (last_1_var_1_17)) ? (var_1_4) : (last_1_var_1_17))) > var_1_18)) ? ((var_1_18 > ((((last_1_var_1_17) < 0 ) ? -(last_1_var_1_17) : (last_1_var_1_17)))) ? (var_1_19 == ((unsigned long int) last_1_var_1_1)) : (var_1_19 == ((unsigned long int) var_1_11))) : (var_1_19 == ((unsigned long int) last_1_var_1_1)))) && (((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) ? (var_1_13 ? ((var_1_1 < var_1_19) ? (var_1_21 == ((unsigned char) (! var_1_23))) : (var_1_21 == ((unsigned char) var_1_24))) : (var_1_21 == ((unsigned char) var_1_23))) : (var_1_21 == ((unsigned char) var_1_23))) ; VAL [\result=0, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=-2, var_1_21=0, var_1_23=0, var_1_24=1, var_1_25=2147483652, var_1_26=2147483652, var_1_27=-2, var_1_28=-2, var_1_29=5, var_1_31=2147483646, var_1_32=2147483646, var_1_33=-2, var_1_34=-2147483649, var_1_35=2147483647, var_1_36=65534, var_1_37=65534, var_1_38=65534, var_1_39=65534, var_1_40=100000000, var_1_7=-2, var_1_8=126, var_1_9=126] [L209] RET, EXPR property() [L209] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=-2, var_1_21=0, var_1_23=0, var_1_24=1, var_1_25=2147483652, var_1_26=2147483652, var_1_27=-2, var_1_28=-2, var_1_29=5, var_1_31=2147483646, var_1_32=2147483646, var_1_33=-2, var_1_34=-2147483649, var_1_35=2147483647, var_1_36=65534, var_1_37=65534, var_1_38=65534, var_1_39=65534, var_1_40=100000000, var_1_7=-2, var_1_8=126, var_1_9=126] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=-2, var_1_21=0, var_1_23=0, var_1_24=1, var_1_25=2147483652, var_1_26=2147483652, var_1_27=-2, var_1_28=-2, var_1_29=5, var_1_31=2147483646, var_1_32=2147483646, var_1_33=-2, var_1_34=-2147483649, var_1_35=2147483647, var_1_36=65534, var_1_37=65534, var_1_38=65534, var_1_39=65534, var_1_40=100000000, var_1_7=-2, var_1_8=126, var_1_9=126] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 98 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.2s, OverallIterations: 8, TraceHistogramMax: 37, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 644 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 617 mSDsluCounter, 2599 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1593 mSDsCounter, 552 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1071 IncrementalHoareTripleChecker+Invalid, 1623 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 552 mSolverCounterUnsat, 1006 mSDtfsCounter, 1071 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1540 GetRequests, 1493 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=432occurred in iteration=4, InterpolantAutomatonStates: 47, 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, 7 MinimizatonAttempts, 369 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 2321 NumberOfCodeBlocks, 2321 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 2542 ConstructedInterpolants, 0 QuantifiedInterpolants, 6003 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1048 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 28890/29304 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-20 03:34:01,598 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-51.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 15e4d0dfcc9ef1fdaea3d6fc81b9cee681e4ec5bdcd73e128463f69bdd9174a9 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 03:34:03,906 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 03:34:03,992 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 03:34:03,998 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 03:34:03,998 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 03:34:04,033 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 03:34:04,033 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 03:34:04,034 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 03:34:04,034 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 03:34:04,035 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 03:34:04,035 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 03:34:04,036 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 03:34:04,036 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 03:34:04,036 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 03:34:04,037 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 03:34:04,037 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 03:34:04,037 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 03:34:04,038 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 03:34:04,038 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 03:34:04,038 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 03:34:04,038 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 03:34:04,039 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 03:34:04,039 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 03:34:04,039 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 03:34:04,040 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 03:34:04,040 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 03:34:04,040 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 03:34:04,040 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 03:34:04,041 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 03:34:04,041 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 03:34:04,041 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 03:34:04,041 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 03:34:04,042 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 03:34:04,042 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 03:34:04,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 03:34:04,043 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 03:34:04,048 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 03:34:04,049 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 03:34:04,049 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 03:34:04,049 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 03:34:04,049 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 03:34:04,051 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 03:34:04,051 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 03:34:04,051 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 03:34:04,052 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 -> 15e4d0dfcc9ef1fdaea3d6fc81b9cee681e4ec5bdcd73e128463f69bdd9174a9 [2024-11-20 03:34:04,404 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 03:34:04,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 03:34:04,439 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 03:34:04,441 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 03:34:04,442 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 03:34:04,443 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-51.i [2024-11-20 03:34:06,009 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 03:34:06,257 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 03:34:06,259 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-51.i [2024-11-20 03:34:06,273 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a079af3b/44054a045b154ced99d02d325399472f/FLAG34193435e [2024-11-20 03:34:06,290 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a079af3b/44054a045b154ced99d02d325399472f [2024-11-20 03:34:06,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 03:34:06,296 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 03:34:06,298 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 03:34:06,299 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 03:34:06,304 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 03:34:06,306 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:34:06" (1/1) ... [2024-11-20 03:34:06,307 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53a8c6eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:34:06, skipping insertion in model container [2024-11-20 03:34:06,307 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:34:06" (1/1) ... [2024-11-20 03:34:06,340 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 03:34:06,536 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-51.i[915,928] [2024-11-20 03:34:06,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 03:34:06,654 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 03:34:06,670 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-51.i[915,928] [2024-11-20 03:34:06,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 03:34:06,764 INFO L204 MainTranslator]: Completed translation [2024-11-20 03:34:06,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:34:06 WrapperNode [2024-11-20 03:34:06,765 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 03:34:06,766 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 03:34:06,766 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 03:34:06,767 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 03:34:06,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:34:06" (1/1) ... [2024-11-20 03:34:06,795 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:34:06" (1/1) ... [2024-11-20 03:34:06,834 INFO L138 Inliner]: procedures = 27, calls = 50, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 219 [2024-11-20 03:34:06,835 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 03:34:06,836 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 03:34:06,836 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 03:34:06,836 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 03:34:06,851 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:34:06" (1/1) ... [2024-11-20 03:34:06,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:34:06" (1/1) ... [2024-11-20 03:34:06,862 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:34:06" (1/1) ... [2024-11-20 03:34:06,879 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-20 03:34:06,880 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:34:06" (1/1) ... [2024-11-20 03:34:06,880 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:34:06" (1/1) ... [2024-11-20 03:34:06,897 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:34:06" (1/1) ... [2024-11-20 03:34:06,908 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:34:06" (1/1) ... [2024-11-20 03:34:06,915 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:34:06" (1/1) ... [2024-11-20 03:34:06,917 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:34:06" (1/1) ... [2024-11-20 03:34:06,929 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 03:34:06,930 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 03:34:06,930 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 03:34:06,930 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 03:34:06,931 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:34:06" (1/1) ... [2024-11-20 03:34:06,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 03:34:06,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 03:34:06,975 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-20 03:34:06,983 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-20 03:34:07,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 03:34:07,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 03:34:07,028 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 03:34:07,028 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 03:34:07,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 03:34:07,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 03:34:07,113 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 03:34:07,116 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 03:34:18,284 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-20 03:34:18,284 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 03:34:18,299 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 03:34:18,299 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 03:34:18,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:34:18 BoogieIcfgContainer [2024-11-20 03:34:18,300 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 03:34:18,301 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 03:34:18,301 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 03:34:18,304 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 03:34:18,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:34:06" (1/3) ... [2024-11-20 03:34:18,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fa019b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:34:18, skipping insertion in model container [2024-11-20 03:34:18,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:34:06" (2/3) ... [2024-11-20 03:34:18,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fa019b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:34:18, skipping insertion in model container [2024-11-20 03:34:18,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:34:18" (3/3) ... [2024-11-20 03:34:18,307 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-51.i [2024-11-20 03:34:18,324 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 03:34:18,324 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 03:34:18,396 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 03:34:18,402 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;@6c815dcb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 03:34:18,402 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 03:34:18,406 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 58 states have (on average 1.3620689655172413) internal successors, (79), 59 states have internal predecessors, (79), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-20 03:34:18,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-20 03:34:18,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:34:18,422 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:34:18,422 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:34:18,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:34:18,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1588593571, now seen corresponding path program 1 times [2024-11-20 03:34:18,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 03:34:18,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1778265197] [2024-11-20 03:34:18,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:34:18,438 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-20 03:34:18,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 03:34:18,440 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-20 03:34:18,460 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-20 03:34:19,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:34:19,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 03:34:19,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 03:34:19,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 692 proven. 0 refuted. 0 times theorem prover too weak. 1972 trivial. 0 not checked. [2024-11-20 03:34:19,564 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 03:34:19,565 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 03:34:19,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1778265197] [2024-11-20 03:34:19,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1778265197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:34:19,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:34:19,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 03:34:19,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204121027] [2024-11-20 03:34:19,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:34:19,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 03:34:19,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 03:34:19,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 03:34:19,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 03:34:19,601 INFO L87 Difference]: Start difference. First operand has 98 states, 58 states have (on average 1.3620689655172413) internal successors, (79), 59 states have internal predecessors, (79), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-20 03:34:19,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:34:19,638 INFO L93 Difference]: Finished difference Result 189 states and 337 transitions. [2024-11-20 03:34:19,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 03:34:19,640 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 230 [2024-11-20 03:34:19,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:34:19,648 INFO L225 Difference]: With dead ends: 189 [2024-11-20 03:34:19,648 INFO L226 Difference]: Without dead ends: 94 [2024-11-20 03:34:19,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 229 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-20 03:34:19,655 INFO L432 NwaCegarLoop]: 146 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, 146 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-20 03:34:19,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 03:34:19,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-20 03:34:19,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-20 03:34:19,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 55 states have (on average 1.309090909090909) internal successors, (72), 55 states have internal predecessors, (72), 37 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-20 03:34:19,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 146 transitions. [2024-11-20 03:34:19,702 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 146 transitions. Word has length 230 [2024-11-20 03:34:19,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:34:19,703 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 146 transitions. [2024-11-20 03:34:19,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2024-11-20 03:34:19,704 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 146 transitions. [2024-11-20 03:34:19,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-20 03:34:19,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:34:19,709 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:34:19,735 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-20 03:34:19,909 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-20 03:34:19,910 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:34:19,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:34:19,911 INFO L85 PathProgramCache]: Analyzing trace with hash -697559261, now seen corresponding path program 1 times [2024-11-20 03:34:19,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 03:34:19,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1377981670] [2024-11-20 03:34:19,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:34:19,913 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-20 03:34:19,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 03:34:19,914 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-20 03:34:19,916 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-20 03:34:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:34:20,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 03:34:20,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 03:34:25,894 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-11-20 03:34:25,894 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 03:34:25,895 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 03:34:25,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1377981670] [2024-11-20 03:34:25,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1377981670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:34:25,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:34:25,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 03:34:25,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825474670] [2024-11-20 03:34:25,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:34:25,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 03:34:25,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 03:34:25,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 03:34:25,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 03:34:25,903 INFO L87 Difference]: Start difference. First operand 94 states and 146 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-20 03:34:30,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 03:34:34,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 03:34:38,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 03:34:43,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 03:34:47,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.32s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 03:34:51,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 03:34:51,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:34:51,580 INFO L93 Difference]: Finished difference Result 277 states and 433 transitions. [2024-11-20 03:34:51,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 03:34:51,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) Word has length 230 [2024-11-20 03:34:51,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:34:51,664 INFO L225 Difference]: With dead ends: 277 [2024-11-20 03:34:51,664 INFO L226 Difference]: Without dead ends: 186 [2024-11-20 03:34:51,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 03:34:51,668 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 91 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 75 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.5s IncrementalHoareTripleChecker+Time [2024-11-20 03:34:51,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 415 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 14 Invalid, 6 Unknown, 0 Unchecked, 25.5s Time] [2024-11-20 03:34:51,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-20 03:34:51,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 165. [2024-11-20 03:34:51,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 88 states have (on average 1.2386363636363635) internal successors, (109), 88 states have internal predecessors, (109), 74 states have call successors, (74), 2 states have call predecessors, (74), 2 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2024-11-20 03:34:51,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 257 transitions. [2024-11-20 03:34:51,723 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 257 transitions. Word has length 230 [2024-11-20 03:34:51,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:34:51,724 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 257 transitions. [2024-11-20 03:34:51,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-20 03:34:51,724 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 257 transitions. [2024-11-20 03:34:51,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-20 03:34:51,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:34:51,731 INFO L215 NwaCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:34:51,763 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-20 03:34:51,931 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-20 03:34:51,932 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:34:51,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:34:51,932 INFO L85 PathProgramCache]: Analyzing trace with hash 738944877, now seen corresponding path program 1 times [2024-11-20 03:34:51,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 03:34:51,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [751094184] [2024-11-20 03:34:51,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:34:51,934 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-20 03:34:51,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 03:34:51,935 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-20 03:34:51,936 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-20 03:34:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:34:52,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 03:34:52,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 03:34:58,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2664 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2664 trivial. 0 not checked. [2024-11-20 03:34:58,156 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 03:34:58,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 03:34:58,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [751094184] [2024-11-20 03:34:58,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [751094184] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:34:58,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:34:58,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 03:34:58,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539983793] [2024-11-20 03:34:58,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:34:58,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 03:34:58,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 03:34:58,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 03:34:58,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 03:34:58,159 INFO L87 Difference]: Start difference. First operand 165 states and 257 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (37), 1 states have call predecessors, (37), 1 states have return successors, (37), 1 states have call predecessors, (37), 1 states have call successors, (37) [2024-11-20 03:35:03,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 03:35:07,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 03:35:11,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 03:35:16,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []