./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-0.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-0.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 023b86f35045f9045adc9b783e35a535a0b6bf77ce996c404b36b9732a6bc24a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:05:47,066 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:05:47,130 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 21:05:47,134 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:05:47,135 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:05:47,168 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:05:47,169 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:05:47,169 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:05:47,169 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:05:47,170 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:05:47,170 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:05:47,170 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:05:47,171 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:05:47,172 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:05:47,174 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:05:47,175 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:05:47,175 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:05:47,175 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:05:47,175 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 21:05:47,175 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:05:47,175 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:05:47,176 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:05:47,177 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:05:47,177 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:05:47,177 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:05:47,177 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:05:47,177 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:05:47,178 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:05:47,178 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:05:47,178 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:05:47,178 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:05:47,179 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:05:47,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:05:47,179 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:05:47,180 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:05:47,180 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:05:47,180 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 21:05:47,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 21:05:47,180 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:05:47,180 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:05:47,180 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:05:47,181 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:05:47,181 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 -> 023b86f35045f9045adc9b783e35a535a0b6bf77ce996c404b36b9732a6bc24a [2024-11-08 21:05:47,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:05:47,410 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:05:47,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:05:47,413 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:05:47,413 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:05:47,414 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-0.i [2024-11-08 21:05:48,635 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:05:48,816 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:05:48,817 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-0.i [2024-11-08 21:05:48,827 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3305edcec/18eeab2062444f7d8c58e1f46464dc49/FLAGe1570349e [2024-11-08 21:05:49,217 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3305edcec/18eeab2062444f7d8c58e1f46464dc49 [2024-11-08 21:05:49,219 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:05:49,220 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:05:49,220 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:05:49,220 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:05:49,228 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:05:49,229 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:05:49" (1/1) ... [2024-11-08 21:05:49,231 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f1c1c47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:05:49, skipping insertion in model container [2024-11-08 21:05:49,236 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:05:49" (1/1) ... [2024-11-08 21:05:49,268 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:05:49,399 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-0.i[918,931] [2024-11-08 21:05:49,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:05:49,471 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:05:49,480 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-0.i[918,931] [2024-11-08 21:05:49,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:05:49,523 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:05:49,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:05:49 WrapperNode [2024-11-08 21:05:49,523 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:05:49,524 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:05:49,524 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:05:49,524 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:05:49,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:05:49" (1/1) ... [2024-11-08 21:05:49,541 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:05:49" (1/1) ... [2024-11-08 21:05:49,584 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 226 [2024-11-08 21:05:49,586 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:05:49,586 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:05:49,587 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:05:49,587 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:05:49,595 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:05:49" (1/1) ... [2024-11-08 21:05:49,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:05:49" (1/1) ... [2024-11-08 21:05:49,598 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:05:49" (1/1) ... [2024-11-08 21:05:49,618 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 21:05:49,618 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:05:49" (1/1) ... [2024-11-08 21:05:49,618 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:05:49" (1/1) ... [2024-11-08 21:05:49,630 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:05:49" (1/1) ... [2024-11-08 21:05:49,633 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:05:49" (1/1) ... [2024-11-08 21:05:49,636 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:05:49" (1/1) ... [2024-11-08 21:05:49,640 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:05:49" (1/1) ... [2024-11-08 21:05:49,643 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:05:49,646 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:05:49,646 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:05:49,647 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:05:49,647 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:05:49" (1/1) ... [2024-11-08 21:05:49,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:05:49,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:05:49,675 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 21:05:49,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 21:05:49,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:05:49,715 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:05:49,715 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:05:49,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 21:05:49,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:05:49,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:05:49,804 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:05:49,805 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:05:50,107 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-08 21:05:50,108 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:05:50,121 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:05:50,121 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:05:50,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:05:50 BoogieIcfgContainer [2024-11-08 21:05:50,121 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:05:50,123 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:05:50,123 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:05:50,126 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:05:50,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:05:49" (1/3) ... [2024-11-08 21:05:50,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@194cf92d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:05:50, skipping insertion in model container [2024-11-08 21:05:50,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:05:49" (2/3) ... [2024-11-08 21:05:50,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@194cf92d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:05:50, skipping insertion in model container [2024-11-08 21:05:50,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:05:50" (3/3) ... [2024-11-08 21:05:50,128 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-0.i [2024-11-08 21:05:50,140 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:05:50,140 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:05:50,185 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:05:50,190 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;@62ff1596, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:05:50,190 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:05:50,194 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 64 states have (on average 1.4375) internal successors, (92), 65 states have internal predecessors, (92), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 21:05:50,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-08 21:05:50,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:05:50,212 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:05:50,212 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:05:50,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:05:50,216 INFO L85 PathProgramCache]: Analyzing trace with hash 636203853, now seen corresponding path program 1 times [2024-11-08 21:05:50,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:05:50,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700259809] [2024-11-08 21:05:50,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:05:50,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:05:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:50,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:05:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:50,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:05:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:50,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:05:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:50,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:05:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:50,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:05:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:50,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:05:50,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:50,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:05:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:50,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 21:05:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:50,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:05:50,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:50,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:05:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:50,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:05:50,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:50,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:05:50,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:50,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:05:50,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:50,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:05:50,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:50,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 21:05:50,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:50,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:05:50,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:50,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 21:05:50,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:50,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:05:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:50,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:05:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:50,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:05:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:50,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:05:50,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:50,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:05:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:50,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:05:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:50,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:05:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:50,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:05:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:50,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:05:50,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:50,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:05:50,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:50,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:05:50,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:50,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:05:50,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:50,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:05:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:50,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 21:05:50,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:05:50,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700259809] [2024-11-08 21:05:50,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700259809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:05:50,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:05:50,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:05:50,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355103708] [2024-11-08 21:05:50,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:05:50,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:05:50,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:05:50,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:05:50,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:05:50,708 INFO L87 Difference]: Start difference. First operand has 97 states, 64 states have (on average 1.4375) internal successors, (92), 65 states have internal predecessors, (92), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-08 21:05:50,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:05:50,734 INFO L93 Difference]: Finished difference Result 187 states and 328 transitions. [2024-11-08 21:05:50,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:05:50,738 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 198 [2024-11-08 21:05:50,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:05:50,744 INFO L225 Difference]: With dead ends: 187 [2024-11-08 21:05:50,744 INFO L226 Difference]: Without dead ends: 93 [2024-11-08 21:05:50,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:05:50,749 INFO L432 NwaCegarLoop]: 144 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, 144 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:05:50,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:05:50,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-08 21:05:50,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-08 21:05:50,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 61 states have internal predecessors, (84), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 21:05:50,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 144 transitions. [2024-11-08 21:05:50,785 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 144 transitions. Word has length 198 [2024-11-08 21:05:50,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:05:50,785 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 144 transitions. [2024-11-08 21:05:50,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-08 21:05:50,786 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 144 transitions. [2024-11-08 21:05:50,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-08 21:05:50,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:05:50,789 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:05:50,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 21:05:50,789 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:05:50,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:05:50,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1156611903, now seen corresponding path program 1 times [2024-11-08 21:05:50,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:05:50,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371612738] [2024-11-08 21:05:50,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:05:50,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:05:50,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:51,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:05:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:51,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:05:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:51,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:05:51,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:51,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:05:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:51,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:05:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:51,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:05:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:51,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:05:51,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:51,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 21:05:51,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:51,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:05:51,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:51,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:05:51,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:51,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:05:51,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:51,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:05:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:51,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:05:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:51,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:05:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:51,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 21:05:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:51,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:05:51,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:51,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 21:05:51,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:51,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:05:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:51,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:05:51,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:51,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:05:51,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:51,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:05:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:51,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:05:51,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:51,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:05:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:51,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:05:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:51,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:05:51,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:51,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:05:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:51,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:05:51,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:51,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:05:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:51,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:05:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:51,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:05:51,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:51,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 21:05:51,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:05:51,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371612738] [2024-11-08 21:05:51,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371612738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:05:51,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:05:51,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 21:05:51,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54675200] [2024-11-08 21:05:51,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:05:51,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 21:05:51,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:05:51,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 21:05:51,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 21:05:51,544 INFO L87 Difference]: Start difference. First operand 93 states and 144 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:05:51,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:05:51,945 INFO L93 Difference]: Finished difference Result 365 states and 570 transitions. [2024-11-08 21:05:51,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 21:05:51,945 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 198 [2024-11-08 21:05:51,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:05:51,950 INFO L225 Difference]: With dead ends: 365 [2024-11-08 21:05:51,952 INFO L226 Difference]: Without dead ends: 275 [2024-11-08 21:05:51,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 21:05:51,955 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 263 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 21:05:51,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 646 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 21:05:51,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-08 21:05:51,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 172. [2024-11-08 21:05:51,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 109 states have (on average 1.385321100917431) internal successors, (151), 109 states have internal predecessors, (151), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-08 21:05:51,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 271 transitions. [2024-11-08 21:05:51,991 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 271 transitions. Word has length 198 [2024-11-08 21:05:51,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:05:51,992 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 271 transitions. [2024-11-08 21:05:51,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:05:51,992 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 271 transitions. [2024-11-08 21:05:51,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-08 21:05:51,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:05:51,994 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:05:51,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 21:05:51,995 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:05:51,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:05:51,995 INFO L85 PathProgramCache]: Analyzing trace with hash -347265277, now seen corresponding path program 1 times [2024-11-08 21:05:51,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:05:51,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441104683] [2024-11-08 21:05:51,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:05:51,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:05:52,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:52,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:05:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:52,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:05:52,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:52,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:05:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:52,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:05:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:52,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:05:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:52,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:05:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:52,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:05:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:52,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 21:05:52,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:52,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:05:52,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:52,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:05:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:52,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:05:52,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:52,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:05:52,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:52,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:05:52,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:52,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:05:52,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:52,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 21:05:52,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:52,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:05:52,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:52,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 21:05:52,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:52,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:05:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:52,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:05:52,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:52,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:05:52,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:52,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:05:52,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:52,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:05:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:52,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:05:52,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:52,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:05:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:52,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:05:52,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:52,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:05:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:52,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:05:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:52,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:05:52,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:52,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:05:52,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:52,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:05:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:52,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 21:05:52,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:05:52,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441104683] [2024-11-08 21:05:52,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441104683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:05:52,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:05:52,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:05:52,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694701675] [2024-11-08 21:05:52,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:05:52,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:05:52,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:05:52,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:05:52,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:05:52,454 INFO L87 Difference]: Start difference. First operand 172 states and 271 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:05:52,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:05:52,594 INFO L93 Difference]: Finished difference Result 427 states and 677 transitions. [2024-11-08 21:05:52,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:05:52,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 198 [2024-11-08 21:05:52,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:05:52,600 INFO L225 Difference]: With dead ends: 427 [2024-11-08 21:05:52,600 INFO L226 Difference]: Without dead ends: 312 [2024-11-08 21:05:52,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 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-08 21:05:52,601 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 149 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:05:52,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 441 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:05:52,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-11-08 21:05:52,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 279. [2024-11-08 21:05:52,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 185 states have (on average 1.4162162162162162) internal successors, (262), 185 states have internal predecessors, (262), 90 states have call successors, (90), 3 states have call predecessors, (90), 3 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-08 21:05:52,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 442 transitions. [2024-11-08 21:05:52,655 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 442 transitions. Word has length 198 [2024-11-08 21:05:52,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:05:52,655 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 442 transitions. [2024-11-08 21:05:52,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:05:52,655 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 442 transitions. [2024-11-08 21:05:52,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-08 21:05:52,657 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:05:52,657 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:05:52,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 21:05:52,658 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:05:52,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:05:52,662 INFO L85 PathProgramCache]: Analyzing trace with hash -285225663, now seen corresponding path program 1 times [2024-11-08 21:05:52,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:05:52,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728917196] [2024-11-08 21:05:52,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:05:52,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:05:52,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:05:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:05:53,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:05:53,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:05:53,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:05:53,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:05:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:05:53,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 21:05:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:05:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:05:53,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:05:53,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:05:53,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:05:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:05:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 21:05:53,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:05:53,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 21:05:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:05:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:05:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:05:53,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:05:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:05:53,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:05:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:05:53,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:05:53,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:05:53,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:05:53,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:05:53,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:05:53,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:05:53,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 21:05:53,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:05:53,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728917196] [2024-11-08 21:05:53,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728917196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:05:53,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:05:53,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 21:05:53,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157281835] [2024-11-08 21:05:53,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:05:53,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:05:53,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:05:53,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:05:53,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:05:53,291 INFO L87 Difference]: Start difference. First operand 279 states and 442 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:05:53,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:05:53,457 INFO L93 Difference]: Finished difference Result 651 states and 1029 transitions. [2024-11-08 21:05:53,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:05:53,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 198 [2024-11-08 21:05:53,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:05:53,465 INFO L225 Difference]: With dead ends: 651 [2024-11-08 21:05:53,465 INFO L226 Difference]: Without dead ends: 473 [2024-11-08 21:05:53,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:05:53,467 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 249 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:05:53,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 461 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:05:53,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-11-08 21:05:53,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 411. [2024-11-08 21:05:53,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 286 states have (on average 1.4545454545454546) internal successors, (416), 286 states have internal predecessors, (416), 120 states have call successors, (120), 4 states have call predecessors, (120), 4 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2024-11-08 21:05:53,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 656 transitions. [2024-11-08 21:05:53,495 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 656 transitions. Word has length 198 [2024-11-08 21:05:53,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:05:53,496 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 656 transitions. [2024-11-08 21:05:53,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:05:53,496 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 656 transitions. [2024-11-08 21:05:53,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-08 21:05:53,498 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:05:53,498 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:05:53,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 21:05:53,499 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:05:53,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:05:53,499 INFO L85 PathProgramCache]: Analyzing trace with hash -283378621, now seen corresponding path program 1 times [2024-11-08 21:05:53,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:05:53,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865597401] [2024-11-08 21:05:53,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:05:53,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:05:53,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:05:53,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:05:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:05:53,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:05:53,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:05:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:05:53,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:05:53,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 21:05:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:05:53,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:05:53,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:05:53,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:05:53,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:05:53,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:05:53,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 21:05:53,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:05:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 21:05:53,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:05:53,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:05:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:05:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:05:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:05:53,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:05:53,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:05:53,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:05:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:05:53,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:05:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:05:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:05:53,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:05:53,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 6 proven. 81 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-08 21:05:53,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:05:53,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865597401] [2024-11-08 21:05:53,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865597401] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:05:53,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093503564] [2024-11-08 21:05:53,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:05:53,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:05:53,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:05:53,795 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 21:05:53,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 21:05:53,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:53,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 21:05:53,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:05:54,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 249 proven. 81 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2024-11-08 21:05:54,237 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:05:54,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 6 proven. 81 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-08 21:05:54,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093503564] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 21:05:54,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 21:05:54,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-08 21:05:54,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82692297] [2024-11-08 21:05:54,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 21:05:54,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 21:05:54,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:05:54,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 21:05:54,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:05:54,479 INFO L87 Difference]: Start difference. First operand 411 states and 656 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (58), 2 states have call predecessors, (58), 2 states have call successors, (58) [2024-11-08 21:05:54,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:05:54,664 INFO L93 Difference]: Finished difference Result 757 states and 1189 transitions. [2024-11-08 21:05:54,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 21:05:54,665 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (58), 2 states have call predecessors, (58), 2 states have call successors, (58) Word has length 198 [2024-11-08 21:05:54,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:05:54,667 INFO L225 Difference]: With dead ends: 757 [2024-11-08 21:05:54,668 INFO L226 Difference]: Without dead ends: 437 [2024-11-08 21:05:54,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 452 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-08 21:05:54,669 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 48 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:05:54,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 255 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:05:54,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2024-11-08 21:05:54,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 427. [2024-11-08 21:05:54,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 298 states have (on average 1.3657718120805369) internal successors, (407), 298 states have internal predecessors, (407), 120 states have call successors, (120), 8 states have call predecessors, (120), 8 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2024-11-08 21:05:54,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 647 transitions. [2024-11-08 21:05:54,707 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 647 transitions. Word has length 198 [2024-11-08 21:05:54,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:05:54,708 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 647 transitions. [2024-11-08 21:05:54,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (58), 2 states have call predecessors, (58), 2 states have call successors, (58) [2024-11-08 21:05:54,708 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 647 transitions. [2024-11-08 21:05:54,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-08 21:05:54,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:05:54,710 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:05:54,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 21:05:54,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:05:54,911 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:05:54,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:05:54,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1511175835, now seen corresponding path program 1 times [2024-11-08 21:05:54,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:05:54,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918642495] [2024-11-08 21:05:54,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:05:54,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:05:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:54,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:05:54,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:54,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:05:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:05:55,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:05:55,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:05:55,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:05:55,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:05:55,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 21:05:55,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:05:55,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:05:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:05:55,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:05:55,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:05:55,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:05:55,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 21:05:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:05:55,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 21:05:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:05:55,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:05:55,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:05:55,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:05:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:05:55,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:05:55,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:05:55,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:05:55,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:05:55,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:05:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:05:55,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:05:55,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:05:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 21:05:55,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:05:55,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918642495] [2024-11-08 21:05:55,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918642495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:05:55,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:05:55,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:05:55,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230863170] [2024-11-08 21:05:55,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:05:55,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:05:55,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:05:55,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:05:55,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:05:55,054 INFO L87 Difference]: Start difference. First operand 427 states and 647 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:05:55,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:05:55,234 INFO L93 Difference]: Finished difference Result 1134 states and 1714 transitions. [2024-11-08 21:05:55,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:05:55,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 199 [2024-11-08 21:05:55,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:05:55,238 INFO L225 Difference]: With dead ends: 1134 [2024-11-08 21:05:55,238 INFO L226 Difference]: Without dead ends: 802 [2024-11-08 21:05:55,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:05:55,242 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 81 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:05:55,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 334 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:05:55,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2024-11-08 21:05:55,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 800. [2024-11-08 21:05:55,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 572 states have (on average 1.3531468531468531) internal successors, (774), 572 states have internal predecessors, (774), 210 states have call successors, (210), 17 states have call predecessors, (210), 17 states have return successors, (210), 210 states have call predecessors, (210), 210 states have call successors, (210) [2024-11-08 21:05:55,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1194 transitions. [2024-11-08 21:05:55,291 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1194 transitions. Word has length 199 [2024-11-08 21:05:55,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:05:55,294 INFO L471 AbstractCegarLoop]: Abstraction has 800 states and 1194 transitions. [2024-11-08 21:05:55,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:05:55,294 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1194 transitions. [2024-11-08 21:05:55,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-08 21:05:55,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:05:55,296 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:05:55,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 21:05:55,296 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:05:55,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:05:55,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1645189341, now seen corresponding path program 1 times [2024-11-08 21:05:55,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:05:55,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208495997] [2024-11-08 21:05:55,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:05:55,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:05:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:05:55,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:05:55,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:05:55,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:05:55,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:05:55,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:05:55,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:05:55,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 21:05:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:05:55,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:05:55,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:05:55,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:05:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:05:55,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:05:55,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 21:05:55,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:05:55,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 21:05:55,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:05:55,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:05:55,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:05:55,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:05:55,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:05:55,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:05:55,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:05:55,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:05:55,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:05:55,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:05:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:05:55,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:05:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:05:55,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 21:05:55,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:05:55,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208495997] [2024-11-08 21:05:55,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208495997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:05:55,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:05:55,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 21:05:55,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873242390] [2024-11-08 21:05:55,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:05:55,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:05:55,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:05:55,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:05:55,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:05:55,531 INFO L87 Difference]: Start difference. First operand 800 states and 1194 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:05:55,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:05:55,735 INFO L93 Difference]: Finished difference Result 1197 states and 1785 transitions. [2024-11-08 21:05:55,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 21:05:55,736 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 199 [2024-11-08 21:05:55,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:05:55,740 INFO L225 Difference]: With dead ends: 1197 [2024-11-08 21:05:55,740 INFO L226 Difference]: Without dead ends: 834 [2024-11-08 21:05:55,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:05:55,742 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 77 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:05:55,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 457 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:05:55,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2024-11-08 21:05:55,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 747. [2024-11-08 21:05:55,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 519 states have (on average 1.325626204238921) internal successors, (688), 519 states have internal predecessors, (688), 210 states have call successors, (210), 17 states have call predecessors, (210), 17 states have return successors, (210), 210 states have call predecessors, (210), 210 states have call successors, (210) [2024-11-08 21:05:55,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1108 transitions. [2024-11-08 21:05:55,796 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1108 transitions. Word has length 199 [2024-11-08 21:05:55,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:05:55,797 INFO L471 AbstractCegarLoop]: Abstraction has 747 states and 1108 transitions. [2024-11-08 21:05:55,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:05:55,797 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1108 transitions. [2024-11-08 21:05:55,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-08 21:05:55,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:05:55,799 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:05:55,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 21:05:55,799 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:05:55,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:05:55,799 INFO L85 PathProgramCache]: Analyzing trace with hash -258547592, now seen corresponding path program 1 times [2024-11-08 21:05:55,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:05:55,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336807816] [2024-11-08 21:05:55,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:05:55,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:05:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:05:55,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:05:55,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:05:55,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:05:55,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:05:55,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:05:55,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:05:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 21:05:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:05:55,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:05:55,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:05:55,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:05:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:05:55,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:05:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:55,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 21:05:55,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:05:56,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 21:05:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:05:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:05:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:05:56,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:05:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:05:56,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:05:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:05:56,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:05:56,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:05:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:05:56,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:05:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:05:56,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:05:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 33 proven. 54 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-08 21:05:56,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:05:56,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336807816] [2024-11-08 21:05:56,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336807816] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:05:56,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764303002] [2024-11-08 21:05:56,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:05:56,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:05:56,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:05:56,059 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 21:05:56,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 21:05:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:56,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 21:05:56,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:05:56,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 843 proven. 54 refuted. 0 times theorem prover too weak. 843 trivial. 0 not checked. [2024-11-08 21:05:56,413 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:05:56,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 33 proven. 54 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-08 21:05:56,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764303002] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 21:05:56,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 21:05:56,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-08 21:05:56,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450036601] [2024-11-08 21:05:56,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 21:05:56,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 21:05:56,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:05:56,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 21:05:56,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:05:56,600 INFO L87 Difference]: Start difference. First operand 747 states and 1108 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2024-11-08 21:05:56,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:05:56,808 INFO L93 Difference]: Finished difference Result 1467 states and 2139 transitions. [2024-11-08 21:05:56,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 21:05:56,808 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) Word has length 200 [2024-11-08 21:05:56,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:05:56,812 INFO L225 Difference]: With dead ends: 1467 [2024-11-08 21:05:56,812 INFO L226 Difference]: Without dead ends: 808 [2024-11-08 21:05:56,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 456 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-08 21:05:56,814 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 144 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:05:56,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 227 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:05:56,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2024-11-08 21:05:56,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 718. [2024-11-08 21:05:56,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 483 states have (on average 1.2629399585921326) internal successors, (610), 483 states have internal predecessors, (610), 210 states have call successors, (210), 24 states have call predecessors, (210), 24 states have return successors, (210), 210 states have call predecessors, (210), 210 states have call successors, (210) [2024-11-08 21:05:56,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1030 transitions. [2024-11-08 21:05:56,879 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1030 transitions. Word has length 200 [2024-11-08 21:05:56,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:05:56,880 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 1030 transitions. [2024-11-08 21:05:56,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2024-11-08 21:05:56,880 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1030 transitions. [2024-11-08 21:05:56,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-08 21:05:56,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:05:56,883 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:05:56,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 21:05:57,083 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,SelfDestructingSolverStorable7 [2024-11-08 21:05:57,084 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:05:57,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:05:57,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1732216935, now seen corresponding path program 1 times [2024-11-08 21:05:57,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:05:57,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647911981] [2024-11-08 21:05:57,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:05:57,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:05:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:05:57,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:05:57,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:05:57,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:05:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:05:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:05:57,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:05:57,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 21:05:57,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:05:57,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:05:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:05:57,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:05:57,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:05:57,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 21:05:57,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 21:05:57,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 21:05:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 21:05:57,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 21:05:57,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 21:05:57,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 21:05:57,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 21:05:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 21:05:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 21:05:57,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 21:05:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 21:05:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 21:05:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 21:05:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 21:05:57,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 21:05:57,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 21:05:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:05:57,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 21:05:57,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:05:57,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647911981] [2024-11-08 21:05:57,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647911981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:05:57,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:05:57,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:05:57,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612476921] [2024-11-08 21:05:57,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:05:57,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:05:57,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:05:57,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:05:57,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:05:57,238 INFO L87 Difference]: Start difference. First operand 718 states and 1030 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:05:57,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:05:57,334 INFO L93 Difference]: Finished difference Result 1386 states and 1989 transitions. [2024-11-08 21:05:57,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:05:57,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 202 [2024-11-08 21:05:57,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:05:57,338 INFO L225 Difference]: With dead ends: 1386 [2024-11-08 21:05:57,338 INFO L226 Difference]: Without dead ends: 720 [2024-11-08 21:05:57,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 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-08 21:05:57,342 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 76 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:05:57,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 354 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:05:57,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2024-11-08 21:05:57,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 718. [2024-11-08 21:05:57,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 483 states have (on average 1.2546583850931676) internal successors, (606), 483 states have internal predecessors, (606), 210 states have call successors, (210), 24 states have call predecessors, (210), 24 states have return successors, (210), 210 states have call predecessors, (210), 210 states have call successors, (210) [2024-11-08 21:05:57,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1026 transitions. [2024-11-08 21:05:57,386 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1026 transitions. Word has length 202 [2024-11-08 21:05:57,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:05:57,386 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 1026 transitions. [2024-11-08 21:05:57,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:05:57,386 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1026 transitions. [2024-11-08 21:05:57,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-08 21:05:57,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:05:57,388 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:05:57,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 21:05:57,388 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:05:57,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:05:57,389 INFO L85 PathProgramCache]: Analyzing trace with hash -79345418, now seen corresponding path program 1 times [2024-11-08 21:05:57,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:05:57,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466573740] [2024-11-08 21:05:57,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:05:57,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:05:57,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 21:05:57,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1655392199] [2024-11-08 21:05:57,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:05:57,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:05:57,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:05:57,507 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 21:05:57,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 21:05:57,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:05:57,660 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 21:05:57,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:05:57,803 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 21:05:57,803 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 21:05:57,804 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 21:05:57,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 21:05:58,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:05:58,009 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:05:58,117 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 21:05:58,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 09:05:58 BoogieIcfgContainer [2024-11-08 21:05:58,120 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 21:05:58,121 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 21:05:58,121 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 21:05:58,121 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 21:05:58,121 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:05:50" (3/4) ... [2024-11-08 21:05:58,123 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 21:05:58,124 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 21:05:58,124 INFO L158 Benchmark]: Toolchain (without parser) took 8904.67ms. Allocated memory was 180.4MB in the beginning and 314.6MB in the end (delta: 134.2MB). Free memory was 148.9MB in the beginning and 208.5MB in the end (delta: -59.6MB). Peak memory consumption was 74.0MB. Max. memory is 16.1GB. [2024-11-08 21:05:58,124 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 132.1MB. Free memory is still 95.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 21:05:58,125 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.25ms. Allocated memory is still 180.4MB. Free memory was 148.7MB in the beginning and 134.5MB in the end (delta: 14.2MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2024-11-08 21:05:58,125 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.85ms. Allocated memory is still 180.4MB. Free memory was 134.5MB in the beginning and 131.6MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 21:05:58,125 INFO L158 Benchmark]: Boogie Preprocessor took 59.18ms. Allocated memory is still 180.4MB. Free memory was 131.6MB in the beginning and 127.4MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 21:05:58,125 INFO L158 Benchmark]: RCFGBuilder took 474.95ms. Allocated memory is still 180.4MB. Free memory was 127.4MB in the beginning and 101.0MB in the end (delta: 26.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-08 21:05:58,125 INFO L158 Benchmark]: TraceAbstraction took 7996.72ms. Allocated memory was 180.4MB in the beginning and 314.6MB in the end (delta: 134.2MB). Free memory was 100.2MB in the beginning and 208.5MB in the end (delta: -108.3MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. [2024-11-08 21:05:58,126 INFO L158 Benchmark]: Witness Printer took 3.21ms. Allocated memory is still 314.6MB. Free memory is still 208.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 21:05:58,127 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 132.1MB. Free memory is still 95.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 303.25ms. Allocated memory is still 180.4MB. Free memory was 148.7MB in the beginning and 134.5MB in the end (delta: 14.2MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.85ms. Allocated memory is still 180.4MB. Free memory was 134.5MB in the beginning and 131.6MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.18ms. Allocated memory is still 180.4MB. Free memory was 131.6MB in the beginning and 127.4MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 474.95ms. Allocated memory is still 180.4MB. Free memory was 127.4MB in the beginning and 101.0MB in the end (delta: 26.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 7996.72ms. Allocated memory was 180.4MB in the beginning and 314.6MB in the end (delta: 134.2MB). Free memory was 100.2MB in the beginning and 208.5MB in the end (delta: -108.3MB). Peak memory consumption was 25.4MB. Max. memory is 16.1GB. * Witness Printer took 3.21ms. Allocated memory is still 314.6MB. Free memory is still 208.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 193, overapproximation of someBinaryArithmeticDOUBLEoperation at line 105, overapproximation of someUnaryDOUBLEoperation at line 105, overapproximation of bitwiseAnd at line 124, overapproximation of someBinaryDOUBLEComparisonOperation at line 193. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 0; [L23] signed long int var_1_5 = 2; [L24] signed short int var_1_6 = -10; [L25] unsigned long int var_1_7 = 1; [L26] unsigned char var_1_8 = 0; [L27] unsigned long int var_1_9 = 3470417420; [L28] unsigned char var_1_10 = 0; [L29] double var_1_12 = 25.6; [L30] double var_1_13 = 1.75; [L31] float var_1_14 = 5.4; [L32] float var_1_15 = 127.5; [L33] float var_1_16 = 3.5; [L34] signed long int var_1_17 = 64; [L35] double var_1_19 = 0.0; [L36] unsigned short int var_1_20 = 10; [L37] double var_1_21 = 4.75; [L38] double var_1_22 = 4.6; [L39] unsigned char var_1_23 = 0; [L40] signed long int var_1_28 = 8; [L41] signed long int var_1_30 = 5; [L42] signed long int var_1_31 = 100; [L43] float var_1_34 = 31.8; [L44] unsigned char var_1_35 = 0; [L45] unsigned char var_1_36 = 0; [L46] unsigned long int var_1_37 = 1; [L47] signed long int var_1_38 = 500; [L48] unsigned long int var_1_39 = 2882328056; [L49] unsigned short int var_1_40 = 5; [L50] unsigned short int var_1_41 = 2; [L51] unsigned short int var_1_42 = 50; [L52] unsigned short int var_1_43 = 4; [L53] unsigned char var_1_44 = 0; [L54] signed long int last_1_var_1_1 = 0; [L55] signed long int last_1_var_1_5 = 2; [L56] signed short int last_1_var_1_6 = -10; [L57] unsigned long int last_1_var_1_7 = 1; [L58] float last_1_var_1_14 = 5.4; [L59] signed long int last_1_var_1_17 = 64; VAL [isInitial=0, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L197] isInitial = 1 [L198] FCALL initially() [L199] COND TRUE 1 [L200] CALL updateLastVariables() [L185] last_1_var_1_1 = var_1_1 [L186] last_1_var_1_5 = var_1_5 [L187] last_1_var_1_6 = var_1_6 [L188] last_1_var_1_7 = var_1_7 [L189] last_1_var_1_14 = var_1_14 [L190] last_1_var_1_17 = var_1_17 VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L200] RET updateLastVariables() [L201] CALL updateVariables() [L136] var_1_9 = __VERIFIER_nondet_ulong() [L137] CALL assume_abort_if_not(var_1_9 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L137] RET assume_abort_if_not(var_1_9 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L138] CALL assume_abort_if_not(var_1_9 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L138] RET assume_abort_if_not(var_1_9 <= 4294967295) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L139] var_1_10 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L140] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L141] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L141] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L142] var_1_12 = __VERIFIER_nondet_double() [L143] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L143] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L144] CALL assume_abort_if_not(var_1_12 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L144] RET assume_abort_if_not(var_1_12 != 0.0F) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L145] var_1_13 = __VERIFIER_nondet_double() [L146] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L146] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L147] var_1_15 = __VERIFIER_nondet_float() [L148] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L148] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L149] var_1_16 = __VERIFIER_nondet_float() [L150] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L150] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L151] var_1_20 = __VERIFIER_nondet_ushort() [L152] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L152] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L153] CALL assume_abort_if_not(var_1_20 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L153] RET assume_abort_if_not(var_1_20 <= 65535) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L154] CALL assume_abort_if_not(var_1_20 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L154] RET assume_abort_if_not(var_1_20 != 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L155] var_1_21 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L156] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L157] var_1_22 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L158] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L159] var_1_30 = __VERIFIER_nondet_long() [L160] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L160] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L161] CALL assume_abort_if_not(var_1_30 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L161] RET assume_abort_if_not(var_1_30 <= 2147483646) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L162] var_1_31 = __VERIFIER_nondet_long() [L163] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L163] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L164] CALL assume_abort_if_not(var_1_31 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L164] RET assume_abort_if_not(var_1_31 <= 2147483646) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L165] var_1_36 = __VERIFIER_nondet_uchar() [L166] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L166] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L167] CALL assume_abort_if_not(var_1_36 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L167] RET assume_abort_if_not(var_1_36 <= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L168] var_1_38 = __VERIFIER_nondet_long() [L169] CALL assume_abort_if_not(var_1_38 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L169] RET assume_abort_if_not(var_1_38 >= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L170] CALL assume_abort_if_not(var_1_38 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L170] RET assume_abort_if_not(var_1_38 <= 1073741823) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L171] var_1_39 = __VERIFIER_nondet_ulong() [L172] CALL assume_abort_if_not(var_1_39 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L172] RET assume_abort_if_not(var_1_39 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L173] CALL assume_abort_if_not(var_1_39 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L173] RET assume_abort_if_not(var_1_39 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L174] var_1_41 = __VERIFIER_nondet_ushort() [L175] CALL assume_abort_if_not(var_1_41 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L175] RET assume_abort_if_not(var_1_41 >= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L176] CALL assume_abort_if_not(var_1_41 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L176] RET assume_abort_if_not(var_1_41 <= 32767) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L177] var_1_42 = __VERIFIER_nondet_ushort() [L178] CALL assume_abort_if_not(var_1_42 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L178] RET assume_abort_if_not(var_1_42 >= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L179] CALL assume_abort_if_not(var_1_42 <= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L179] RET assume_abort_if_not(var_1_42 <= 16384) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L180] var_1_43 = __VERIFIER_nondet_ushort() [L181] CALL assume_abort_if_not(var_1_43 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L181] RET assume_abort_if_not(var_1_43 >= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L182] CALL assume_abort_if_not(var_1_43 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L182] RET assume_abort_if_not(var_1_43 <= 16383) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L201] RET updateVariables() [L202] CALL step() [L63] COND FALSE !(last_1_var_1_7 > (- last_1_var_1_5)) [L66] var_1_1 = (((((1 - last_1_var_1_7)) < (16)) ? ((1 - last_1_var_1_7)) : (16))) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L68] COND TRUE ((last_1_var_1_14 + last_1_var_1_14) / 9.2) < ((((last_1_var_1_14) < (var_1_16)) ? (last_1_var_1_14) : (var_1_16))) [L69] var_1_17 = ((((last_1_var_1_1) > (last_1_var_1_6)) ? (last_1_var_1_1) : (last_1_var_1_6))) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L73] signed long int stepLocal_1 = - last_1_var_1_1; VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_1=0, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L74] COND FALSE !(last_1_var_1_17 < stepLocal_1) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L77] signed long int stepLocal_3 = var_1_1; [L78] signed long int stepLocal_2 = var_1_17; VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_2=0, stepLocal_3=0, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L79] COND FALSE !(var_1_17 > stepLocal_2) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L84] unsigned long int stepLocal_5 = var_1_9; VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=2147483647, var_1_10=1, var_1_14=27/5, var_1_17=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L85] COND FALSE !((var_1_12 * last_1_var_1_14) > var_1_13) [L92] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=2147483647, var_1_10=1, var_1_14=2, var_1_16=2, var_1_17=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L94] signed long int stepLocal_0 = var_1_17; VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_0=0, stepLocal_3=0, stepLocal_5=2147483647, var_1_10=1, var_1_14=2, var_1_16=2, var_1_17=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L95] COND TRUE var_1_6 < stepLocal_0 [L96] var_1_5 = ((var_1_17 - var_1_6) + var_1_6) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=2147483647, var_1_10=1, var_1_14=2, var_1_16=2, var_1_17=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L98] unsigned long int stepLocal_4 = var_1_9 - var_1_6; VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_4=2147483657, stepLocal_5=2147483647, var_1_10=1, var_1_14=2, var_1_16=2, var_1_17=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L99] COND TRUE (- 8u) >= stepLocal_4 [L100] var_1_8 = (! var_1_10) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=2147483647, var_1_10=1, var_1_14=2, var_1_16=2, var_1_17=0, var_1_19=0, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L104] COND TRUE (32 / var_1_20) > -500 [L105] var_1_19 = ((((var_1_21 - var_1_22) < 0 ) ? -(var_1_21 - var_1_22) : (var_1_21 - var_1_22))) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=2147483647, var_1_10=1, var_1_14=2, var_1_16=2, var_1_17=0, var_1_19=3, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L107] COND TRUE \read(var_1_10) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=2147483647, var_1_10=1, var_1_14=2, var_1_16=2, var_1_17=0, var_1_19=3, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L108] COND TRUE var_1_10 && (1 >= var_1_6) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=2147483647, var_1_10=1, var_1_14=2, var_1_16=2, var_1_17=0, var_1_19=3, var_1_1=0, var_1_20=1, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L109] COND TRUE \read(var_1_10) [L110] var_1_23 = var_1_10 VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=2147483647, var_1_10=1, var_1_14=2, var_1_16=2, var_1_17=0, var_1_19=3, var_1_1=0, var_1_20=1, var_1_23=1, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L114] EXPR var_1_20 & var_1_6 VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=2147483647, var_1_10=1, var_1_14=2, var_1_16=2, var_1_17=0, var_1_19=3, var_1_1=0, var_1_20=1, var_1_23=1, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L114] COND TRUE (var_1_20 & var_1_6) >= var_1_1 [L115] var_1_28 = (((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20))) < 0 ) ? -((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20))) : ((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20))))) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=2147483647, var_1_10=1, var_1_14=2, var_1_16=2, var_1_17=0, var_1_19=3, var_1_1=0, var_1_20=1, var_1_23=1, var_1_28=1, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L121] COND TRUE var_1_31 > var_1_7 [L122] var_1_34 = var_1_22 VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=2147483647, var_1_10=1, var_1_14=2, var_1_16=2, var_1_17=0, var_1_19=3, var_1_1=0, var_1_20=1, var_1_22=4, var_1_23=1, var_1_28=1, var_1_30=0, var_1_31=2147483646, var_1_34=4, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L124] EXPR var_1_20 & -100 VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=2147483647, var_1_10=1, var_1_14=2, var_1_16=2, var_1_17=0, var_1_19=3, var_1_1=0, var_1_20=1, var_1_22=4, var_1_23=1, var_1_28=1, var_1_30=0, var_1_31=2147483646, var_1_34=4, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L124] COND FALSE !((var_1_20 & -100) <= var_1_17) [L127] COND TRUE (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))) - (var_1_20 + var_1_38)) <= var_1_17 [L128] var_1_37 = ((((var_1_30) > (((((var_1_38) < ((var_1_39 - var_1_31))) ? (var_1_38) : ((var_1_39 - var_1_31)))))) ? (var_1_30) : (((((var_1_38) < ((var_1_39 - var_1_31))) ? (var_1_38) : ((var_1_39 - var_1_31))))))) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=2147483647, var_1_10=1, var_1_14=2, var_1_16=2, var_1_17=0, var_1_19=3, var_1_1=0, var_1_20=1, var_1_22=4, var_1_23=1, var_1_28=1, var_1_30=0, var_1_31=2147483646, var_1_34=4, var_1_35=0, var_1_36=0, var_1_37=4294967297, var_1_38=9, var_1_39=6442450943, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L130] var_1_40 = (var_1_41 + (var_1_42 + var_1_43)) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=2147483647, var_1_10=1, var_1_14=2, var_1_16=2, var_1_17=0, var_1_19=3, var_1_1=0, var_1_20=1, var_1_22=4, var_1_23=1, var_1_28=1, var_1_30=0, var_1_31=2147483646, var_1_34=4, var_1_35=0, var_1_36=0, var_1_37=4294967297, var_1_38=9, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L131] COND FALSE !(var_1_7 <= var_1_1) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=2147483647, var_1_10=1, var_1_14=2, var_1_16=2, var_1_17=0, var_1_19=3, var_1_1=0, var_1_20=1, var_1_22=4, var_1_23=1, var_1_28=1, var_1_30=0, var_1_31=2147483646, var_1_34=4, var_1_35=0, var_1_36=0, var_1_37=4294967297, var_1_38=9, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L202] RET step() [L203] CALL, EXPR property() [L193-L194] return (((((((last_1_var_1_7 > (- last_1_var_1_5)) ? (var_1_1 == ((signed long int) ((((last_1_var_1_5) > ((last_1_var_1_7 + last_1_var_1_6))) ? (last_1_var_1_5) : ((last_1_var_1_7 + last_1_var_1_6)))))) : (var_1_1 == ((signed long int) (((((1 - last_1_var_1_7)) < (16)) ? ((1 - last_1_var_1_7)) : (16)))))) && ((var_1_6 < var_1_17) ? (var_1_5 == ((signed long int) ((var_1_17 - var_1_6) + var_1_6))) : 1)) && ((last_1_var_1_17 < (- last_1_var_1_1)) ? (var_1_6 == ((signed short int) (32 - last_1_var_1_6))) : 1)) && ((var_1_17 > var_1_17) ? ((var_1_6 <= var_1_1) ? (var_1_7 == ((unsigned long int) ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))))) : 1) : 1)) && (((- 8u) >= (var_1_9 - var_1_6)) ? (var_1_8 == ((unsigned char) (! var_1_10))) : (var_1_8 == ((unsigned char) (((var_1_14 / var_1_12) >= var_1_14) || var_1_10))))) && (((var_1_12 * last_1_var_1_14) > var_1_13) ? ((var_1_9 < var_1_7) ? (var_1_14 == ((float) var_1_15)) : (var_1_14 == ((float) var_1_15))) : (var_1_14 == ((float) var_1_16)))) && ((((last_1_var_1_14 + last_1_var_1_14) / 9.2) < ((((last_1_var_1_14) < (var_1_16)) ? (last_1_var_1_14) : (var_1_16)))) ? (var_1_17 == ((signed long int) ((((last_1_var_1_1) > (last_1_var_1_6)) ? (last_1_var_1_1) : (last_1_var_1_6))))) : (var_1_17 == ((signed long int) last_1_var_1_6))) ; VAL [\result=0, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=2, var_1_16=2, var_1_17=0, var_1_19=3, var_1_1=0, var_1_20=1, var_1_22=4, var_1_23=1, var_1_28=1, var_1_30=0, var_1_31=2147483646, var_1_34=4, var_1_35=0, var_1_36=0, var_1_37=4294967297, var_1_38=9, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L203] RET, EXPR property() [L203] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=2, var_1_16=2, var_1_17=0, var_1_19=3, var_1_1=0, var_1_20=1, var_1_22=4, var_1_23=1, var_1_28=1, var_1_30=0, var_1_31=2147483646, var_1_34=4, var_1_35=0, var_1_36=0, var_1_37=4294967297, var_1_38=9, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=2, var_1_16=2, var_1_17=0, var_1_19=3, var_1_1=0, var_1_20=1, var_1_22=4, var_1_23=1, var_1_28=1, var_1_30=0, var_1_31=2147483646, var_1_34=4, var_1_35=0, var_1_36=0, var_1_37=4294967297, var_1_38=9, var_1_39=6442450943, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=0, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.8s, OverallIterations: 10, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1098 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1087 mSDsluCounter, 3319 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2035 mSDsCounter, 368 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 955 IncrementalHoareTripleChecker+Invalid, 1323 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 368 mSolverCounterUnsat, 1284 mSDtfsCounter, 955 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1417 GetRequests, 1374 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=800occurred in iteration=6, InterpolantAutomatonStates: 48, 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, 9 MinimizatonAttempts, 389 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 2596 NumberOfCodeBlocks, 2596 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2573 ConstructedInterpolants, 0 QuantifiedInterpolants, 7029 SizeOfPredicates, 1 NumberOfNonLiveVariables, 952 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 22215/22620 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 21:05:58,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-0.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 023b86f35045f9045adc9b783e35a535a0b6bf77ce996c404b36b9732a6bc24a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:05:59,981 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:06:00,046 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 21:06:00,052 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:06:00,052 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:06:00,078 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:06:00,080 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:06:00,080 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:06:00,080 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:06:00,081 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:06:00,081 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:06:00,082 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:06:00,082 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:06:00,082 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:06:00,083 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:06:00,083 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:06:00,085 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:06:00,085 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:06:00,085 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:06:00,085 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:06:00,085 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:06:00,086 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:06:00,088 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:06:00,088 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 21:06:00,088 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 21:06:00,089 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:06:00,089 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 21:06:00,089 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:06:00,089 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:06:00,089 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:06:00,089 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:06:00,090 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:06:00,090 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:06:00,094 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:06:00,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:06:00,094 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:06:00,095 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:06:00,095 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:06:00,095 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 21:06:00,095 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 21:06:00,095 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:06:00,099 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:06:00,099 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:06:00,099 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:06:00,100 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 -> 023b86f35045f9045adc9b783e35a535a0b6bf77ce996c404b36b9732a6bc24a [2024-11-08 21:06:00,356 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:06:00,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:06:00,376 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:06:00,377 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:06:00,377 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:06:00,378 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-0.i [2024-11-08 21:06:01,560 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:06:01,731 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:06:01,732 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-0.i [2024-11-08 21:06:01,739 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57574d315/d506fcb9cf38481c93e9fca0c99b1105/FLAG09e325d44 [2024-11-08 21:06:02,130 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57574d315/d506fcb9cf38481c93e9fca0c99b1105 [2024-11-08 21:06:02,132 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:06:02,133 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:06:02,134 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:06:02,134 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:06:02,139 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:06:02,139 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:06:02" (1/1) ... [2024-11-08 21:06:02,140 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@371c5f02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:06:02, skipping insertion in model container [2024-11-08 21:06:02,142 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:06:02" (1/1) ... [2024-11-08 21:06:02,180 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:06:02,317 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-0.i[918,931] [2024-11-08 21:06:02,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:06:02,406 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:06:02,417 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-0.i[918,931] [2024-11-08 21:06:02,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:06:02,476 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:06:02,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:06:02 WrapperNode [2024-11-08 21:06:02,477 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:06:02,479 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:06:02,479 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:06:02,480 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:06:02,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:06:02" (1/1) ... [2024-11-08 21:06:02,500 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:06:02" (1/1) ... [2024-11-08 21:06:02,535 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 205 [2024-11-08 21:06:02,539 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:06:02,540 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:06:02,540 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:06:02,540 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:06:02,552 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:06:02" (1/1) ... [2024-11-08 21:06:02,553 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:06:02" (1/1) ... [2024-11-08 21:06:02,558 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:06:02" (1/1) ... [2024-11-08 21:06:02,592 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 21:06:02,592 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:06:02" (1/1) ... [2024-11-08 21:06:02,593 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:06:02" (1/1) ... [2024-11-08 21:06:02,606 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:06:02" (1/1) ... [2024-11-08 21:06:02,613 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:06:02" (1/1) ... [2024-11-08 21:06:02,619 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:06:02" (1/1) ... [2024-11-08 21:06:02,621 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:06:02" (1/1) ... [2024-11-08 21:06:02,624 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:06:02,629 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:06:02,629 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:06:02,629 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:06:02,630 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:06:02" (1/1) ... [2024-11-08 21:06:02,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:06:02,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:06:02,658 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 21:06:02,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 21:06:02,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:06:02,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 21:06:02,694 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:06:02,694 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:06:02,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:06:02,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:06:02,772 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:06:02,777 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:06:25,541 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-08 21:06:25,543 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:06:25,556 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:06:25,556 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:06:25,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:06:25 BoogieIcfgContainer [2024-11-08 21:06:25,556 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:06:25,558 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:06:25,558 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:06:25,560 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:06:25,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:06:02" (1/3) ... [2024-11-08 21:06:25,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b40384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:06:25, skipping insertion in model container [2024-11-08 21:06:25,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:06:02" (2/3) ... [2024-11-08 21:06:25,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b40384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:06:25, skipping insertion in model container [2024-11-08 21:06:25,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:06:25" (3/3) ... [2024-11-08 21:06:25,562 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-0.i [2024-11-08 21:06:25,578 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:06:25,579 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:06:25,643 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:06:25,649 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;@d4f9d35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:06:25,649 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:06:25,652 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 59 states have internal predecessors, (82), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-08 21:06:25,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-08 21:06:25,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:06:25,667 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:06:25,667 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:06:25,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:06:25,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1562080012, now seen corresponding path program 1 times [2024-11-08 21:06:25,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:06:25,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [803079820] [2024-11-08 21:06:25,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:06:25,685 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:06:25,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:06:25,687 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 21:06:25,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 21:06:27,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:27,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 21:06:27,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:06:46,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-08 21:06:46,067 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:06:46,068 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:06:46,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [803079820] [2024-11-08 21:06:46,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [803079820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:06:46,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:06:46,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:06:46,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627444131] [2024-11-08 21:06:46,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:06:46,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:06:46,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:06:46,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:06:46,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:06:46,094 INFO L87 Difference]: Start difference. First operand has 91 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 59 states have internal predecessors, (82), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:06:51,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.65s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:06:55,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:06:59,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:07:04,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.61s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:07:08,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 21:07:08,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:07:08,966 INFO L93 Difference]: Finished difference Result 284 states and 516 transitions. [2024-11-08 21:07:09,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:07:09,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 196 [2024-11-08 21:07:09,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:07:09,238 INFO L225 Difference]: With dead ends: 284 [2024-11-08 21:07:09,238 INFO L226 Difference]: Without dead ends: 196 [2024-11-08 21:07:09,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:07:09,243 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 126 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 61 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.5s IncrementalHoareTripleChecker+Time [2024-11-08 21:07:09,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 402 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 20 Invalid, 5 Unknown, 0 Unchecked, 22.5s Time] [2024-11-08 21:07:09,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-08 21:07:09,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 169. [2024-11-08 21:07:09,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 106 states have (on average 1.349056603773585) internal successors, (143), 106 states have internal predecessors, (143), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-08 21:07:09,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 263 transitions. [2024-11-08 21:07:09,309 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 263 transitions. Word has length 196 [2024-11-08 21:07:09,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:07:09,311 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 263 transitions. [2024-11-08 21:07:09,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-08 21:07:09,311 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 263 transitions. [2024-11-08 21:07:09,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-08 21:07:09,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:07:09,315 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:07:09,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-08 21:07:09,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:07:09,517 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:07:09,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:07:09,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1428066506, now seen corresponding path program 1 times [2024-11-08 21:07:09,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:07:09,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1484781398] [2024-11-08 21:07:09,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:07:09,518 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 21:07:09,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:07:09,523 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 21:07:09,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 21:07:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:11,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 21:07:11,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:07:21,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 249 proven. 81 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2024-11-08 21:07:21,285 INFO L311 TraceCheckSpWp]: Computing backward predicates...