/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-97.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 19:23:55,381 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 19:23:55,447 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-20 19:23:55,451 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 19:23:55,452 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 19:23:55,473 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 19:23:55,474 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 19:23:55,474 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 19:23:55,474 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 19:23:55,477 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 19:23:55,477 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 19:23:55,477 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 19:23:55,478 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 19:23:55,479 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 19:23:55,479 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 19:23:55,479 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 19:23:55,479 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 19:23:55,479 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 19:23:55,479 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 19:23:55,480 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 19:23:55,480 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 19:23:55,481 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 19:23:55,481 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 19:23:55,481 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 19:23:55,481 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 19:23:55,481 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 19:23:55,481 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 19:23:55,481 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 19:23:55,482 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 19:23:55,482 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 19:23:55,482 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 19:23:55,483 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 19:23:55,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 19:23:55,483 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 19:23:55,483 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 19:23:55,483 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 19:23:55,483 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 19:23:55,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 19:23:55,483 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 19:23:55,484 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 19:23:55,484 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 19:23:55,484 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 19:23:55,484 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 19:23:55,484 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: Use bitabs translation -> false [2023-12-20 19:23:55,670 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 19:23:55,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 19:23:55,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 19:23:55,689 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 19:23:55,689 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 19:23:55,690 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-97.i [2023-12-20 19:23:56,735 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 19:23:56,887 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 19:23:56,888 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-97.i [2023-12-20 19:23:56,895 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6fd4b93f/712075d3ffa54ba1b9616c85cfeee0ae/FLAG99641d80a [2023-12-20 19:23:56,913 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6fd4b93f/712075d3ffa54ba1b9616c85cfeee0ae [2023-12-20 19:23:56,916 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 19:23:56,917 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 19:23:56,919 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 19:23:56,919 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 19:23:56,922 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 19:23:56,923 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 07:23:56" (1/1) ... [2023-12-20 19:23:56,924 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29adbfe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:23:56, skipping insertion in model container [2023-12-20 19:23:56,924 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 07:23:56" (1/1) ... [2023-12-20 19:23:56,956 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 19:23:57,053 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-97.i[915,928] [2023-12-20 19:23:57,102 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 19:23:57,111 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 19:23:57,119 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-97.i[915,928] [2023-12-20 19:23:57,144 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 19:23:57,160 INFO L206 MainTranslator]: Completed translation [2023-12-20 19:23:57,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:23:57 WrapperNode [2023-12-20 19:23:57,161 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 19:23:57,162 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 19:23:57,162 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 19:23:57,162 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 19:23:57,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:23:57" (1/1) ... [2023-12-20 19:23:57,173 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:23:57" (1/1) ... [2023-12-20 19:23:57,221 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 215 [2023-12-20 19:23:57,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 19:23:57,222 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 19:23:57,222 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 19:23:57,222 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 19:23:57,231 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:23:57" (1/1) ... [2023-12-20 19:23:57,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:23:57" (1/1) ... [2023-12-20 19:23:57,240 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:23:57" (1/1) ... [2023-12-20 19:23:57,253 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]. [2023-12-20 19:23:57,253 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:23:57" (1/1) ... [2023-12-20 19:23:57,254 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:23:57" (1/1) ... [2023-12-20 19:23:57,279 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:23:57" (1/1) ... [2023-12-20 19:23:57,281 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:23:57" (1/1) ... [2023-12-20 19:23:57,283 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:23:57" (1/1) ... [2023-12-20 19:23:57,284 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:23:57" (1/1) ... [2023-12-20 19:23:57,287 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 19:23:57,287 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 19:23:57,288 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 19:23:57,288 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 19:23:57,288 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:23:57" (1/1) ... [2023-12-20 19:23:57,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 19:23:57,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 19:23:57,326 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) [2023-12-20 19:23:57,345 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 [2023-12-20 19:23:57,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 19:23:57,350 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-20 19:23:57,351 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-20 19:23:57,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 19:23:57,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 19:23:57,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 19:23:57,422 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 19:23:57,424 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 19:23:57,664 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 19:23:57,686 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 19:23:57,687 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-20 19:23:57,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 07:23:57 BoogieIcfgContainer [2023-12-20 19:23:57,687 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 19:23:57,689 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 19:23:57,689 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 19:23:57,691 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 19:23:57,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 07:23:56" (1/3) ... [2023-12-20 19:23:57,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e712eb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 07:23:57, skipping insertion in model container [2023-12-20 19:23:57,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:23:57" (2/3) ... [2023-12-20 19:23:57,692 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e712eb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 07:23:57, skipping insertion in model container [2023-12-20 19:23:57,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 07:23:57" (3/3) ... [2023-12-20 19:23:57,692 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-97.i [2023-12-20 19:23:57,703 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 19:23:57,704 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 19:23:57,735 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 19:23:57,739 INFO L357 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, mHoare=true, 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;@59770d64, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 19:23:57,740 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 19:23:57,742 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 50 states have internal predecessors, (69), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2023-12-20 19:23:57,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-12-20 19:23:57,753 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:23:57,754 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 19:23:57,754 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:23:57,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:23:57,758 INFO L85 PathProgramCache]: Analyzing trace with hash 391236374, now seen corresponding path program 1 times [2023-12-20 19:23:57,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:23:57,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575415122] [2023-12-20 19:23:57,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:23:57,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:23:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:57,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:23:58,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-20 19:23:58,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 19:23:58,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 19:23:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 19:23:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 19:23:58,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 19:23:58,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 19:23:58,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-20 19:23:58,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-20 19:23:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 19:23:58,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 19:23:58,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 19:23:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-20 19:23:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 19:23:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-20 19:23:58,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 19:23:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-20 19:23:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-20 19:23:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 19:23:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 19:23:58,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-20 19:23:58,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-20 19:23:58,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-20 19:23:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-20 19:23:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-20 19:23:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-20 19:23:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-20 19:23:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-12-20 19:23:58,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2023-12-20 19:23:58,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:23:58,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575415122] [2023-12-20 19:23:58,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575415122] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:23:58,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:23:58,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 19:23:58,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481688774] [2023-12-20 19:23:58,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:23:58,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-20 19:23:58,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:23:58,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-20 19:23:58,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 19:23:58,216 INFO L87 Difference]: Start difference. First operand has 81 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 50 states have internal predecessors, (69), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2023-12-20 19:23:58,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:23:58,269 INFO L93 Difference]: Finished difference Result 159 states and 281 transitions. [2023-12-20 19:23:58,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-20 19:23:58,271 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 179 [2023-12-20 19:23:58,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:23:58,277 INFO L225 Difference]: With dead ends: 159 [2023-12-20 19:23:58,277 INFO L226 Difference]: Without dead ends: 79 [2023-12-20 19:23:58,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 19:23:58,282 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 19:23:58,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 19:23:58,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-12-20 19:23:58,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-12-20 19:23:58,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 48 states have internal predecessors, (64), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2023-12-20 19:23:58,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 122 transitions. [2023-12-20 19:23:58,322 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 122 transitions. Word has length 179 [2023-12-20 19:23:58,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:23:58,323 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 122 transitions. [2023-12-20 19:23:58,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2023-12-20 19:23:58,323 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 122 transitions. [2023-12-20 19:23:58,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-12-20 19:23:58,331 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:23:58,331 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 19:23:58,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 19:23:58,331 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:23:58,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:23:58,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1298552028, now seen corresponding path program 1 times [2023-12-20 19:23:58,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:23:58,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599833737] [2023-12-20 19:23:58,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:23:58,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:23:58,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:23:58,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-20 19:23:58,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 19:23:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 19:23:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 19:23:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 19:23:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 19:23:58,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 19:23:58,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-20 19:23:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-20 19:23:58,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 19:23:58,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 19:23:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 19:23:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-20 19:23:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 19:23:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-20 19:23:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 19:23:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-20 19:23:58,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-20 19:23:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 19:23:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 19:23:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-20 19:23:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-20 19:23:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-20 19:23:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-20 19:23:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-20 19:23:58,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-20 19:23:58,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-20 19:23:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-12-20 19:23:58,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:58,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2023-12-20 19:23:58,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:23:58,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599833737] [2023-12-20 19:23:58,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599833737] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:23:58,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:23:58,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 19:23:58,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208716974] [2023-12-20 19:23:58,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:23:58,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 19:23:58,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:23:58,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 19:23:58,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 19:23:58,631 INFO L87 Difference]: Start difference. First operand 79 states and 122 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-12-20 19:23:58,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:23:58,713 INFO L93 Difference]: Finished difference Result 232 states and 358 transitions. [2023-12-20 19:23:58,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 19:23:58,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 179 [2023-12-20 19:23:58,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:23:58,721 INFO L225 Difference]: With dead ends: 232 [2023-12-20 19:23:58,721 INFO L226 Difference]: Without dead ends: 154 [2023-12-20 19:23:58,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 19:23:58,725 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 111 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 19:23:58,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 323 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 19:23:58,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-12-20 19:23:58,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 92. [2023-12-20 19:23:58,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 61 states have internal predecessors, (82), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2023-12-20 19:23:58,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 140 transitions. [2023-12-20 19:23:58,742 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 140 transitions. Word has length 179 [2023-12-20 19:23:58,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:23:58,744 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 140 transitions. [2023-12-20 19:23:58,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-12-20 19:23:58,745 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 140 transitions. [2023-12-20 19:23:58,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-12-20 19:23:58,747 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:23:58,748 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 19:23:58,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 19:23:58,749 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:23:58,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:23:58,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1556717466, now seen corresponding path program 1 times [2023-12-20 19:23:58,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:23:58,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397057237] [2023-12-20 19:23:58,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:23:58,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:23:58,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:23:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-20 19:23:59,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 19:23:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 19:23:59,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 19:23:59,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 19:23:59,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 19:23:59,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 19:23:59,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-20 19:23:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-20 19:23:59,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 19:23:59,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 19:23:59,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 19:23:59,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-20 19:23:59,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 19:23:59,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-20 19:23:59,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 19:23:59,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-20 19:23:59,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-20 19:23:59,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 19:23:59,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 19:23:59,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-20 19:23:59,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-20 19:23:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-20 19:23:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-20 19:23:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-20 19:23:59,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-20 19:23:59,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-20 19:23:59,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-12-20 19:23:59,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2023-12-20 19:23:59,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:23:59,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397057237] [2023-12-20 19:23:59,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397057237] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:23:59,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:23:59,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 19:23:59,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756726493] [2023-12-20 19:23:59,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:23:59,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 19:23:59,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:23:59,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 19:23:59,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-20 19:23:59,197 INFO L87 Difference]: Start difference. First operand 92 states and 140 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-12-20 19:23:59,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:23:59,463 INFO L93 Difference]: Finished difference Result 327 states and 502 transitions. [2023-12-20 19:23:59,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 19:23:59,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 179 [2023-12-20 19:23:59,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:23:59,467 INFO L225 Difference]: With dead ends: 327 [2023-12-20 19:23:59,467 INFO L226 Difference]: Without dead ends: 236 [2023-12-20 19:23:59,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-20 19:23:59,471 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 180 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 19:23:59,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 430 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 19:23:59,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2023-12-20 19:23:59,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 179. [2023-12-20 19:23:59,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 118 states have (on average 1.3389830508474576) internal successors, (158), 118 states have internal predecessors, (158), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2023-12-20 19:23:59,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 274 transitions. [2023-12-20 19:23:59,507 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 274 transitions. Word has length 179 [2023-12-20 19:23:59,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:23:59,507 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 274 transitions. [2023-12-20 19:23:59,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-12-20 19:23:59,507 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 274 transitions. [2023-12-20 19:23:59,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2023-12-20 19:23:59,508 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:23:59,509 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 19:23:59,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-20 19:23:59,509 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:23:59,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:23:59,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1862194008, now seen corresponding path program 1 times [2023-12-20 19:23:59,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:23:59,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221399716] [2023-12-20 19:23:59,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:23:59,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:23:59,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:23:59,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-20 19:23:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 19:23:59,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 19:23:59,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 19:23:59,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 19:23:59,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 19:23:59,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 19:23:59,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-20 19:23:59,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-20 19:23:59,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 19:23:59,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 19:23:59,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 19:23:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-20 19:23:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 19:23:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-20 19:23:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 19:23:59,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-20 19:23:59,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-20 19:23:59,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 19:23:59,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 19:23:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-20 19:23:59,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-20 19:23:59,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-20 19:23:59,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-20 19:23:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-20 19:23:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-20 19:23:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-20 19:23:59,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-12-20 19:23:59,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:23:59,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2023-12-20 19:23:59,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:23:59,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221399716] [2023-12-20 19:23:59,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221399716] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:23:59,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:23:59,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 19:23:59,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595435199] [2023-12-20 19:23:59,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:23:59,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 19:23:59,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:23:59,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 19:23:59,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-20 19:23:59,786 INFO L87 Difference]: Start difference. First operand 179 states and 274 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-12-20 19:24:00,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:24:00,068 INFO L93 Difference]: Finished difference Result 402 states and 614 transitions. [2023-12-20 19:24:00,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-20 19:24:00,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 180 [2023-12-20 19:24:00,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:24:00,073 INFO L225 Difference]: With dead ends: 402 [2023-12-20 19:24:00,073 INFO L226 Difference]: Without dead ends: 311 [2023-12-20 19:24:00,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-20 19:24:00,077 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 185 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 19:24:00,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 775 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 19:24:00,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2023-12-20 19:24:00,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 182. [2023-12-20 19:24:00,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 121 states have (on average 1.3388429752066116) internal successors, (162), 121 states have internal predecessors, (162), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2023-12-20 19:24:00,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 278 transitions. [2023-12-20 19:24:00,114 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 278 transitions. Word has length 180 [2023-12-20 19:24:00,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:24:00,115 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 278 transitions. [2023-12-20 19:24:00,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-12-20 19:24:00,115 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 278 transitions. [2023-12-20 19:24:00,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2023-12-20 19:24:00,117 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:24:00,117 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 19:24:00,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-20 19:24:00,117 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:24:00,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:24:00,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1606798259, now seen corresponding path program 1 times [2023-12-20 19:24:00,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:24:00,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9533773] [2023-12-20 19:24:00,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:24:00,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:24:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:24:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-20 19:24:00,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 19:24:00,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 19:24:00,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 19:24:00,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 19:24:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 19:24:00,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 19:24:00,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-20 19:24:00,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-20 19:24:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 19:24:00,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 19:24:00,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 19:24:00,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-20 19:24:00,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 19:24:00,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-20 19:24:00,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 19:24:00,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-20 19:24:00,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-20 19:24:00,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 19:24:00,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 19:24:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-20 19:24:00,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-20 19:24:00,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-20 19:24:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-20 19:24:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-20 19:24:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-20 19:24:00,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-20 19:24:00,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-12-20 19:24:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2023-12-20 19:24:00,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:24:00,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9533773] [2023-12-20 19:24:00,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9533773] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:24:00,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:24:00,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-20 19:24:00,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797956471] [2023-12-20 19:24:00,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:24:00,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-20 19:24:00,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:24:00,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-20 19:24:00,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-20 19:24:00,462 INFO L87 Difference]: Start difference. First operand 182 states and 278 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-12-20 19:24:00,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:24:00,691 INFO L93 Difference]: Finished difference Result 468 states and 711 transitions. [2023-12-20 19:24:00,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-20 19:24:00,692 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 180 [2023-12-20 19:24:00,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:24:00,693 INFO L225 Difference]: With dead ends: 468 [2023-12-20 19:24:00,693 INFO L226 Difference]: Without dead ends: 287 [2023-12-20 19:24:00,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-12-20 19:24:00,694 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 101 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 19:24:00,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 500 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 19:24:00,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2023-12-20 19:24:00,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 275. [2023-12-20 19:24:00,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 184 states have (on average 1.315217391304348) internal successors, (242), 184 states have internal predecessors, (242), 87 states have call successors, (87), 3 states have call predecessors, (87), 3 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2023-12-20 19:24:00,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 416 transitions. [2023-12-20 19:24:00,726 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 416 transitions. Word has length 180 [2023-12-20 19:24:00,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:24:00,726 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 416 transitions. [2023-12-20 19:24:00,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-12-20 19:24:00,727 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 416 transitions. [2023-12-20 19:24:00,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2023-12-20 19:24:00,728 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:24:00,728 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 19:24:00,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-20 19:24:00,728 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:24:00,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:24:00,728 INFO L85 PathProgramCache]: Analyzing trace with hash -31376005, now seen corresponding path program 1 times [2023-12-20 19:24:00,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:24:00,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025393041] [2023-12-20 19:24:00,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:24:00,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:24:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:24:00,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-20 19:24:00,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 19:24:00,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 19:24:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 19:24:00,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 19:24:00,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 19:24:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 19:24:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-20 19:24:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-20 19:24:00,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 19:24:00,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 19:24:00,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 19:24:00,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-20 19:24:00,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 19:24:00,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-20 19:24:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 19:24:00,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-20 19:24:00,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-20 19:24:00,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 19:24:00,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 19:24:00,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:00,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-20 19:24:01,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-20 19:24:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-20 19:24:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-20 19:24:01,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-20 19:24:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-20 19:24:01,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-20 19:24:01,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-12-20 19:24:01,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2023-12-20 19:24:01,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:24:01,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025393041] [2023-12-20 19:24:01,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025393041] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:24:01,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:24:01,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 19:24:01,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807098410] [2023-12-20 19:24:01,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:24:01,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 19:24:01,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:24:01,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 19:24:01,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 19:24:01,029 INFO L87 Difference]: Start difference. First operand 275 states and 416 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-12-20 19:24:01,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:24:01,111 INFO L93 Difference]: Finished difference Result 604 states and 917 transitions. [2023-12-20 19:24:01,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 19:24:01,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 181 [2023-12-20 19:24:01,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:24:01,113 INFO L225 Difference]: With dead ends: 604 [2023-12-20 19:24:01,113 INFO L226 Difference]: Without dead ends: 330 [2023-12-20 19:24:01,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-20 19:24:01,115 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 108 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 19:24:01,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 489 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 19:24:01,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2023-12-20 19:24:01,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 275. [2023-12-20 19:24:01,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 184 states have (on average 1.2717391304347827) internal successors, (234), 184 states have internal predecessors, (234), 87 states have call successors, (87), 3 states have call predecessors, (87), 3 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2023-12-20 19:24:01,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 408 transitions. [2023-12-20 19:24:01,166 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 408 transitions. Word has length 181 [2023-12-20 19:24:01,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:24:01,169 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 408 transitions. [2023-12-20 19:24:01,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-12-20 19:24:01,169 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 408 transitions. [2023-12-20 19:24:01,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2023-12-20 19:24:01,170 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:24:01,170 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 19:24:01,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-20 19:24:01,170 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:24:01,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:24:01,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1758162646, now seen corresponding path program 1 times [2023-12-20 19:24:01,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:24:01,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232399484] [2023-12-20 19:24:01,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:24:01,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:24:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:24:01,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-20 19:24:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 19:24:01,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 19:24:01,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 19:24:01,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 19:24:01,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 19:24:01,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 19:24:01,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-20 19:24:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-20 19:24:01,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 19:24:01,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 19:24:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 19:24:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-20 19:24:01,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 19:24:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-20 19:24:01,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 19:24:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-20 19:24:01,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-20 19:24:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 19:24:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 19:24:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-20 19:24:01,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-20 19:24:01,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-20 19:24:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-20 19:24:01,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-20 19:24:01,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-20 19:24:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-20 19:24:01,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-12-20 19:24:01,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2023-12-20 19:24:01,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:24:01,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232399484] [2023-12-20 19:24:01,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232399484] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:24:01,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:24:01,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 19:24:01,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107731153] [2023-12-20 19:24:01,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:24:01,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 19:24:01,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:24:01,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 19:24:01,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-20 19:24:01,403 INFO L87 Difference]: Start difference. First operand 275 states and 408 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-12-20 19:24:01,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:24:01,812 INFO L93 Difference]: Finished difference Result 693 states and 1017 transitions. [2023-12-20 19:24:01,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-20 19:24:01,813 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 184 [2023-12-20 19:24:01,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:24:01,816 INFO L225 Difference]: With dead ends: 693 [2023-12-20 19:24:01,816 INFO L226 Difference]: Without dead ends: 599 [2023-12-20 19:24:01,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-20 19:24:01,817 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 202 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 19:24:01,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 510 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 19:24:01,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2023-12-20 19:24:01,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 460. [2023-12-20 19:24:01,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 309 states have (on average 1.2815533980582525) internal successors, (396), 309 states have internal predecessors, (396), 145 states have call successors, (145), 5 states have call predecessors, (145), 5 states have return successors, (145), 145 states have call predecessors, (145), 145 states have call successors, (145) [2023-12-20 19:24:01,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 686 transitions. [2023-12-20 19:24:01,931 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 686 transitions. Word has length 184 [2023-12-20 19:24:01,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:24:01,933 INFO L495 AbstractCegarLoop]: Abstraction has 460 states and 686 transitions. [2023-12-20 19:24:01,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-12-20 19:24:01,933 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 686 transitions. [2023-12-20 19:24:01,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-12-20 19:24:01,934 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:24:01,934 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 19:24:01,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-20 19:24:01,934 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:24:01,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:24:01,935 INFO L85 PathProgramCache]: Analyzing trace with hash 494485958, now seen corresponding path program 1 times [2023-12-20 19:24:01,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:24:01,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087740207] [2023-12-20 19:24:01,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:24:01,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:24:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:24:01,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-20 19:24:01,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 19:24:01,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 19:24:01,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 19:24:01,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 19:24:01,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 19:24:01,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 19:24:01,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-20 19:24:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-20 19:24:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:01,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 19:24:02,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:02,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 19:24:02,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:02,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 19:24:02,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:02,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-20 19:24:02,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:02,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 19:24:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:02,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-20 19:24:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:02,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 19:24:02,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:02,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-20 19:24:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:02,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-20 19:24:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:02,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 19:24:02,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:02,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 19:24:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:02,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-20 19:24:02,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:02,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-20 19:24:02,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:02,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-20 19:24:02,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:02,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-20 19:24:02,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:02,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-20 19:24:02,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:02,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-20 19:24:02,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:02,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-20 19:24:02,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:02,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-12-20 19:24:02,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:02,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2023-12-20 19:24:02,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:24:02,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087740207] [2023-12-20 19:24:02,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087740207] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:24:02,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:24:02,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 19:24:02,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465401642] [2023-12-20 19:24:02,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:24:02,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 19:24:02,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:24:02,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 19:24:02,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 19:24:02,026 INFO L87 Difference]: Start difference. First operand 460 states and 686 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-12-20 19:24:02,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:24:02,236 INFO L93 Difference]: Finished difference Result 994 states and 1491 transitions. [2023-12-20 19:24:02,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 19:24:02,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 185 [2023-12-20 19:24:02,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:24:02,239 INFO L225 Difference]: With dead ends: 994 [2023-12-20 19:24:02,239 INFO L226 Difference]: Without dead ends: 535 [2023-12-20 19:24:02,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 19:24:02,241 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 99 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 19:24:02,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 219 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 19:24:02,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2023-12-20 19:24:02,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 412. [2023-12-20 19:24:02,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 261 states have (on average 1.206896551724138) internal successors, (315), 261 states have internal predecessors, (315), 145 states have call successors, (145), 5 states have call predecessors, (145), 5 states have return successors, (145), 145 states have call predecessors, (145), 145 states have call successors, (145) [2023-12-20 19:24:02,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 605 transitions. [2023-12-20 19:24:02,362 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 605 transitions. Word has length 185 [2023-12-20 19:24:02,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:24:02,362 INFO L495 AbstractCegarLoop]: Abstraction has 412 states and 605 transitions. [2023-12-20 19:24:02,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-12-20 19:24:02,362 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 605 transitions. [2023-12-20 19:24:02,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-12-20 19:24:02,364 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:24:02,364 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 19:24:02,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-20 19:24:02,364 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:24:02,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:24:02,364 INFO L85 PathProgramCache]: Analyzing trace with hash 551744260, now seen corresponding path program 1 times [2023-12-20 19:24:02,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:24:02,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502025859] [2023-12-20 19:24:02,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:24:02,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:24:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:18,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:24:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:18,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-20 19:24:18,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:18,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 19:24:18,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:18,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 19:24:18,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:18,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 19:24:18,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:18,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 19:24:18,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:18,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 19:24:18,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:18,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 19:24:18,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:18,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-20 19:24:18,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:18,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-20 19:24:18,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:18,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 19:24:18,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:18,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 19:24:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:18,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 19:24:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:18,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-20 19:24:18,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:18,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 19:24:18,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:18,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-20 19:24:18,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:18,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 19:24:18,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:18,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-20 19:24:18,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:18,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-20 19:24:18,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:18,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 19:24:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:18,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 19:24:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:18,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-20 19:24:18,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:18,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-20 19:24:18,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:18,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-20 19:24:18,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:18,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-20 19:24:18,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:18,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-20 19:24:18,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:18,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-20 19:24:18,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:18,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-20 19:24:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:18,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-12-20 19:24:18,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:24:18,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2023-12-20 19:24:18,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:24:18,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502025859] [2023-12-20 19:24:18,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502025859] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:24:18,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:24:18,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-20 19:24:18,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084916389] [2023-12-20 19:24:18,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:24:18,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-20 19:24:18,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:24:18,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-20 19:24:18,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2023-12-20 19:24:18,878 INFO L87 Difference]: Start difference. First operand 412 states and 605 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-12-20 19:24:24,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:24:24,094 INFO L93 Difference]: Finished difference Result 645 states and 883 transitions. [2023-12-20 19:24:24,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-20 19:24:24,095 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 185 [2023-12-20 19:24:24,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:24:24,097 INFO L225 Difference]: With dead ends: 645 [2023-12-20 19:24:24,097 INFO L226 Difference]: Without dead ends: 643 [2023-12-20 19:24:24,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2023-12-20 19:24:24,098 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 125 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-20 19:24:24,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 540 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-20 19:24:24,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2023-12-20 19:24:24,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 592. [2023-12-20 19:24:24,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 426 states have (on average 1.2112676056338028) internal successors, (516), 431 states have internal predecessors, (516), 155 states have call successors, (155), 10 states have call predecessors, (155), 10 states have return successors, (155), 150 states have call predecessors, (155), 155 states have call successors, (155) [2023-12-20 19:24:24,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 826 transitions. [2023-12-20 19:24:24,195 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 826 transitions. Word has length 185 [2023-12-20 19:24:24,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:24:24,195 INFO L495 AbstractCegarLoop]: Abstraction has 592 states and 826 transitions. [2023-12-20 19:24:24,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2023-12-20 19:24:24,196 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 826 transitions. [2023-12-20 19:24:24,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-12-20 19:24:24,197 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:24:24,197 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 19:24:24,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-20 19:24:24,197 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:24:24,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:24:24,197 INFO L85 PathProgramCache]: Analyzing trace with hash -265904190, now seen corresponding path program 1 times [2023-12-20 19:24:24,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:24:24,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751861954] [2023-12-20 19:24:24,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:24:24,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:24:24,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 19:24:24,268 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-20 19:24:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 19:24:24,362 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-20 19:24:24,362 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-20 19:24:24,363 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-20 19:24:24,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-20 19:24:24,366 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 19:24:24,369 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 19:24:24,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 07:24:24 BoogieIcfgContainer [2023-12-20 19:24:24,463 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 19:24:24,464 INFO L158 Benchmark]: Toolchain (without parser) took 27547.07ms. Allocated memory was 260.0MB in the beginning and 709.9MB in the end (delta: 449.8MB). Free memory was 215.5MB in the beginning and 291.3MB in the end (delta: -75.7MB). Peak memory consumption was 374.1MB. Max. memory is 8.0GB. [2023-12-20 19:24:24,464 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 216.0MB. Free memory was 163.4MB in the beginning and 163.2MB in the end (delta: 189.0kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 19:24:24,464 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.55ms. Allocated memory is still 260.0MB. Free memory was 215.0MB in the beginning and 200.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-20 19:24:24,464 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.60ms. Allocated memory is still 260.0MB. Free memory was 200.2MB in the beginning and 196.1MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-20 19:24:24,464 INFO L158 Benchmark]: Boogie Preprocessor took 65.09ms. Allocated memory is still 260.0MB. Free memory was 196.1MB in the beginning and 189.3MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-20 19:24:24,464 INFO L158 Benchmark]: RCFGBuilder took 399.56ms. Allocated memory is still 260.0MB. Free memory was 189.3MB in the beginning and 162.6MB in the end (delta: 26.7MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2023-12-20 19:24:24,465 INFO L158 Benchmark]: TraceAbstraction took 26774.65ms. Allocated memory was 260.0MB in the beginning and 709.9MB in the end (delta: 449.8MB). Free memory was 161.5MB in the beginning and 291.3MB in the end (delta: -129.8MB). Peak memory consumption was 319.6MB. Max. memory is 8.0GB. [2023-12-20 19:24:24,466 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.11ms. Allocated memory is still 216.0MB. Free memory was 163.4MB in the beginning and 163.2MB in the end (delta: 189.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 242.55ms. Allocated memory is still 260.0MB. Free memory was 215.0MB in the beginning and 200.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.60ms. Allocated memory is still 260.0MB. Free memory was 200.2MB in the beginning and 196.1MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 65.09ms. Allocated memory is still 260.0MB. Free memory was 196.1MB in the beginning and 189.3MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 399.56ms. Allocated memory is still 260.0MB. Free memory was 189.3MB in the beginning and 162.6MB in the end (delta: 26.7MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * TraceAbstraction took 26774.65ms. Allocated memory was 260.0MB in the beginning and 709.9MB in the end (delta: 449.8MB). Free memory was 161.5MB in the beginning and 291.3MB in the end (delta: -129.8MB). Peak memory consumption was 319.6MB. Max. memory is 8.0GB. * 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 165, overapproximation of bitwise operation at line 165. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 2; [L23] signed long int var_1_5 = 5; [L24] unsigned char var_1_8 = 0; [L25] float var_1_9 = 128.6; [L26] float var_1_10 = 32.5; [L27] unsigned char var_1_11 = 16; [L28] unsigned char var_1_12 = 64; [L29] unsigned char var_1_13 = 4; [L30] unsigned char var_1_14 = 4; [L31] unsigned long int var_1_15 = 0; [L32] signed short int var_1_16 = 0; [L33] signed char var_1_17 = 1; [L34] signed char var_1_18 = -1; [L35] signed char var_1_19 = 0; [L36] signed long int var_1_20 = -64; [L37] unsigned char var_1_22 = 0; [L38] unsigned char var_1_23 = 0; [L39] signed short int var_1_24 = -4; [L40] unsigned char var_1_25 = 1; [L41] signed char var_1_26 = 50; [L42] signed char var_1_27 = 4; [L43] signed char var_1_28 = -10; [L44] signed char var_1_29 = -64; [L45] signed char var_1_30 = -8; [L46] signed long int var_1_31 = 1; [L47] float var_1_32 = 3.75; [L48] float var_1_33 = 8.5; [L49] unsigned char var_1_34 = 0; [L50] unsigned char var_1_35 = 8; [L51] unsigned short int var_1_36 = 5; [L52] signed long int last_1_var_1_5 = 5; [L169] isInitial = 1 [L170] FCALL initially() [L171] COND TRUE 1 [L172] CALL updateLastVariables() [L162] last_1_var_1_5 = var_1_5 [L172] RET updateLastVariables() [L173] CALL updateVariables() [L115] var_1_9 = __VERIFIER_nondet_float() [L116] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L116] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L117] var_1_10 = __VERIFIER_nondet_float() [L118] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L118] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L119] var_1_11 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L120] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L121] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L121] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L122] var_1_12 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_12 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L123] RET assume_abort_if_not(var_1_12 >= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L124] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L124] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L125] var_1_13 = __VERIFIER_nondet_uchar() [L126] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L126] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L127] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L127] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L128] var_1_14 = __VERIFIER_nondet_uchar() [L129] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L129] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L130] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L130] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L131] var_1_18 = __VERIFIER_nondet_char() [L132] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L132] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L133] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L133] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L134] var_1_19 = __VERIFIER_nondet_char() [L135] CALL assume_abort_if_not(var_1_19 >= -15) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L135] RET assume_abort_if_not(var_1_19 >= -15) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L136] CALL assume_abort_if_not(var_1_19 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L136] RET assume_abort_if_not(var_1_19 <= 16) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L137] var_1_23 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L138] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L139] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L139] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=1, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L140] var_1_25 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L141] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L142] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L142] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=50, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L143] var_1_26 = __VERIFIER_nondet_char() [L144] CALL assume_abort_if_not(var_1_26 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L144] RET assume_abort_if_not(var_1_26 >= -128) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L145] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L145] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=4, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L146] var_1_27 = __VERIFIER_nondet_char() [L147] CALL assume_abort_if_not(var_1_27 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L147] RET assume_abort_if_not(var_1_27 >= -128) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L148] CALL assume_abort_if_not(var_1_27 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L148] RET assume_abort_if_not(var_1_27 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-10, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L149] var_1_28 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_28 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L150] RET assume_abort_if_not(var_1_28 >= -128) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L151] CALL assume_abort_if_not(var_1_28 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L151] RET assume_abort_if_not(var_1_28 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=-8, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L152] var_1_30 = __VERIFIER_nondet_char() [L153] CALL assume_abort_if_not(var_1_30 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L153] RET assume_abort_if_not(var_1_30 >= -127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L154] CALL assume_abort_if_not(var_1_30 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L154] RET assume_abort_if_not(var_1_30 <= 126) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_33=17/2, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L155] var_1_33 = __VERIFIER_nondet_float() [L156] CALL assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L156] RET assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_35=8, var_1_36=5, var_1_5=5, var_1_8=0] [L157] var_1_35 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_36=5, var_1_5=5, var_1_8=0] [L158] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_36=5, var_1_5=5, var_1_8=0] [L159] CALL assume_abort_if_not(var_1_35 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_35=254, var_1_36=5, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_35=254, var_1_36=5, var_1_5=5, var_1_8=0] [L159] RET assume_abort_if_not(var_1_35 <= 254) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_35=254, var_1_36=5, var_1_5=5, var_1_8=0] [L173] RET updateVariables() [L174] CALL step() [L56] COND FALSE !(\read(var_1_25)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=-64, var_1_30=126, var_1_31=1, var_1_32=15/4, var_1_34=0, var_1_35=254, var_1_36=5, var_1_5=5, var_1_8=0] [L61] var_1_29 = var_1_30 [L62] var_1_31 = var_1_29 [L63] var_1_32 = var_1_33 [L64] var_1_34 = var_1_35 [L65] var_1_36 = var_1_35 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=301, var_1_33=301, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L66] COND FALSE !(var_1_9 > var_1_10) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=301, var_1_33=301, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L69] var_1_20 = var_1_8 [L70] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=301, var_1_33=301, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L71] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=301, var_1_33=301, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L74] var_1_16 = (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=-109, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=301, var_1_33=301, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L75] COND FALSE !(\read(var_1_22)) [L82] var_1_17 = -32 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=-109, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=301, var_1_33=301, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L84] unsigned long int stepLocal_1 = var_1_20 + var_1_15; [L85] signed long int stepLocal_0 = var_1_20; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=-109, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=301, var_1_33=301, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L86] COND TRUE stepLocal_1 < -200 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=-109, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=301, var_1_33=301, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L87] COND FALSE !(\read(var_1_22)) [L94] var_1_1 = var_1_20 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=-109, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=301, var_1_33=301, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L99] signed long int stepLocal_4 = 256; [L100] unsigned char stepLocal_3 = var_1_22; [L101] unsigned long int stepLocal_2 = var_1_15; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=256, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=-109, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=301, var_1_33=301, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L102] COND FALSE !(stepLocal_4 > (var_1_15 - (last_1_var_1_5 + var_1_8))) VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=256, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=-109, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=301, var_1_33=301, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=5, var_1_8=0] [L105] COND FALSE !(stepLocal_3 || var_1_22) [L110] var_1_5 = -10000 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=256, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=-109, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=301, var_1_33=301, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=-10000, var_1_8=0] [L174] RET step() [L175] CALL, EXPR property() [L165] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=-109, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=301, var_1_33=301, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=-10000, var_1_8=0] [L165] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=-109, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=301, var_1_33=301, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=-10000, var_1_8=0] [L165] EXPR (var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=-109, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=301, var_1_33=301, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=-10000, var_1_8=0] [L165] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=-109, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=301, var_1_33=301, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=-10000, var_1_8=0] [L165] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=-109, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=301, var_1_33=301, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=-10000, var_1_8=0] [L165-L166] return (((((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32)))) && (var_1_20 == ((signed long int) var_1_8))) && (var_1_22 == ((unsigned char) var_1_23)) ; [L175] RET, EXPR property() [L175] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=-109, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=301, var_1_33=301, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=-10000, var_1_8=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_5=5, var_1_11=109, var_1_12=63, var_1_13=40, var_1_14=127, var_1_15=0, var_1_16=-109, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=126, var_1_30=126, var_1_31=126, var_1_32=301, var_1_33=301, var_1_34=254, var_1_35=254, var_1_36=254, var_1_5=-10000, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.6s, OverallIterations: 10, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1111 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1111 mSDsluCounter, 3905 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2384 mSDsCounter, 407 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1028 IncrementalHoareTripleChecker+Invalid, 1435 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 407 mSolverCounterUnsat, 1521 mSDtfsCounter, 1028 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 618 GetRequests, 575 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 9.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=592occurred in iteration=9, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 628 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 18.4s InterpolantComputationTime, 1817 NumberOfCodeBlocks, 1817 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1623 ConstructedInterpolants, 0 QuantifiedInterpolants, 14554 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 14616/14616 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 [2023-12-20 19:24:24,500 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...