/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-25_file-10.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 19:40:28,415 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 19:40:28,481 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:40:28,484 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 19:40:28,484 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 19:40:28,505 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 19:40:28,506 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 19:40:28,506 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 19:40:28,507 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 19:40:28,510 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 19:40:28,510 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 19:40:28,510 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 19:40:28,511 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 19:40:28,512 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 19:40:28,512 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 19:40:28,512 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 19:40:28,512 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 19:40:28,512 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 19:40:28,512 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 19:40:28,513 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 19:40:28,513 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 19:40:28,513 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 19:40:28,513 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 19:40:28,513 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 19:40:28,513 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 19:40:28,514 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 19:40:28,514 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 19:40:28,514 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 19:40:28,514 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 19:40:28,514 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 19:40:28,515 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 19:40:28,515 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 19:40:28,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 19:40:28,515 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 19:40:28,516 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 19:40:28,516 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 19:40:28,516 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 19:40:28,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 19:40:28,516 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 19:40:28,516 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 19:40:28,516 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 19:40:28,516 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 19:40:28,516 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 19:40:28,517 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:40:28,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 19:40:28,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 19:40:28,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 19:40:28,714 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 19:40:28,715 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 19:40:28,715 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-25_file-10.i [2023-12-20 19:40:29,722 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 19:40:29,892 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 19:40:29,892 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-10.i [2023-12-20 19:40:29,898 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b838e40d9/9a15279842c945f2a64ee9cfee5f4c8f/FLAGa5f711d15 [2023-12-20 19:40:29,908 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b838e40d9/9a15279842c945f2a64ee9cfee5f4c8f [2023-12-20 19:40:29,909 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 19:40:29,910 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 19:40:29,911 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 19:40:29,911 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 19:40:29,914 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 19:40:29,914 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 07:40:29" (1/1) ... [2023-12-20 19:40:29,915 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c5f9c6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:40:29, skipping insertion in model container [2023-12-20 19:40:29,915 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 07:40:29" (1/1) ... [2023-12-20 19:40:29,940 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 19:40:30,032 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-25_file-10.i[915,928] [2023-12-20 19:40:30,086 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 19:40:30,094 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 19:40:30,101 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-25_file-10.i[915,928] [2023-12-20 19:40:30,126 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 19:40:30,136 INFO L206 MainTranslator]: Completed translation [2023-12-20 19:40:30,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:40:30 WrapperNode [2023-12-20 19:40:30,137 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 19:40:30,138 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 19:40:30,138 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 19:40:30,138 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 19:40:30,142 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:40:30" (1/1) ... [2023-12-20 19:40:30,158 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:40:30" (1/1) ... [2023-12-20 19:40:30,217 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 226 [2023-12-20 19:40:30,217 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 19:40:30,218 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 19:40:30,218 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 19:40:30,218 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 19:40:30,226 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:40:30" (1/1) ... [2023-12-20 19:40:30,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:40:30" (1/1) ... [2023-12-20 19:40:30,238 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:40:30" (1/1) ... [2023-12-20 19:40:30,252 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:40:30,252 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:40:30" (1/1) ... [2023-12-20 19:40:30,252 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:40:30" (1/1) ... [2023-12-20 19:40:30,272 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:40:30" (1/1) ... [2023-12-20 19:40:30,274 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:40:30" (1/1) ... [2023-12-20 19:40:30,277 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:40:30" (1/1) ... [2023-12-20 19:40:30,279 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:40:30" (1/1) ... [2023-12-20 19:40:30,292 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 19:40:30,293 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 19:40:30,293 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 19:40:30,293 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 19:40:30,293 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:40:30" (1/1) ... [2023-12-20 19:40:30,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 19:40:30,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 19:40:30,315 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:40:30,331 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:40:30,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 19:40:30,335 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-20 19:40:30,335 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-20 19:40:30,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 19:40:30,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 19:40:30,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 19:40:30,432 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 19:40:30,433 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 19:40:30,689 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 19:40:30,707 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 19:40:30,707 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-20 19:40:30,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 07:40:30 BoogieIcfgContainer [2023-12-20 19:40:30,708 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 19:40:30,709 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 19:40:30,709 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 19:40:30,711 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 19:40:30,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 07:40:29" (1/3) ... [2023-12-20 19:40:30,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d1bf706 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 07:40:30, skipping insertion in model container [2023-12-20 19:40:30,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 07:40:30" (2/3) ... [2023-12-20 19:40:30,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d1bf706 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 07:40:30, skipping insertion in model container [2023-12-20 19:40:30,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 07:40:30" (3/3) ... [2023-12-20 19:40:30,713 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-10.i [2023-12-20 19:40:30,724 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 19:40:30,724 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 19:40:30,755 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 19:40:30,759 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;@6457d75, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 19:40:30,759 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 19:40:30,762 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 56 states have internal predecessors, (76), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-20 19:40:30,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2023-12-20 19:40:30,772 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:40:30,772 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:30,773 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:40:30,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:40:30,776 INFO L85 PathProgramCache]: Analyzing trace with hash -29664266, now seen corresponding path program 1 times [2023-12-20 19:40:30,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:40:30,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620938112] [2023-12-20 19:40:30,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:40:30,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:40:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:40:31,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 19:40:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 19:40:31,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 19:40:31,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 19:40:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 19:40:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 19:40:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 19:40:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 19:40:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 19:40:31,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 19:40:31,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 19:40:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 19:40:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 19:40:31,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 19:40:31,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 19:40:31,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 19:40:31,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 19:40:31,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 19:40:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 19:40:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 19:40:31,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-20 19:40:31,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-20 19:40:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-20 19:40:31,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-20 19:40:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-20 19:40:31,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-12-20 19:40:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-20 19:40:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-12-20 19:40:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-12-20 19:40:31,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-20 19:40:31,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-12-20 19:40:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-12-20 19:40:31,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:40:31,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620938112] [2023-12-20 19:40:31,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620938112] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:40:31,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:40:31,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 19:40:31,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523146705] [2023-12-20 19:40:31,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:40:31,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-20 19:40:31,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:40:31,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-20 19:40:31,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 19:40:31,232 INFO L87 Difference]: Start difference. First operand has 90 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 56 states have internal predecessors, (76), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2023-12-20 19:40:31,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:40:31,285 INFO L93 Difference]: Finished difference Result 177 states and 310 transitions. [2023-12-20 19:40:31,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-20 19:40:31,287 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 204 [2023-12-20 19:40:31,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:40:31,292 INFO L225 Difference]: With dead ends: 177 [2023-12-20 19:40:31,292 INFO L226 Difference]: Without dead ends: 88 [2023-12-20 19:40:31,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 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:40:31,297 INFO L413 NwaCegarLoop]: 132 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, 132 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:40:31,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 19:40:31,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-12-20 19:40:31,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-12-20 19:40:31,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 54 states have internal predecessors, (71), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-20 19:40:31,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 135 transitions. [2023-12-20 19:40:31,334 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 135 transitions. Word has length 204 [2023-12-20 19:40:31,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:40:31,335 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 135 transitions. [2023-12-20 19:40:31,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2023-12-20 19:40:31,335 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 135 transitions. [2023-12-20 19:40:31,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2023-12-20 19:40:31,338 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:40:31,338 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:31,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 19:40:31,338 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:40:31,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:40:31,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1510760566, now seen corresponding path program 1 times [2023-12-20 19:40:31,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:40:31,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999654633] [2023-12-20 19:40:31,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:40:31,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:40:31,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:40:31,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 19:40:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 19:40:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 19:40:31,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 19:40:31,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 19:40:31,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 19:40:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 19:40:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 19:40:31,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 19:40:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 19:40:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 19:40:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 19:40:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 19:40:31,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 19:40:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 19:40:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 19:40:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 19:40:31,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 19:40:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 19:40:31,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 19:40:31,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-20 19:40:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-20 19:40:31,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-20 19:40:31,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-20 19:40:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-20 19:40:31,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-12-20 19:40:31,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-20 19:40:31,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-12-20 19:40:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-12-20 19:40:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-20 19:40:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-12-20 19:40:31,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:31,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-12-20 19:40:31,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:40:31,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999654633] [2023-12-20 19:40:31,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999654633] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:40:31,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:40:31,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 19:40:31,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913044993] [2023-12-20 19:40:31,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:40:31,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 19:40:31,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:40:31,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 19:40:31,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-20 19:40:31,905 INFO L87 Difference]: Start difference. First operand 88 states and 135 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-12-20 19:40:32,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:40:32,107 INFO L93 Difference]: Finished difference Result 263 states and 404 transitions. [2023-12-20 19:40:32,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-20 19:40:32,108 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 204 [2023-12-20 19:40:32,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:40:32,116 INFO L225 Difference]: With dead ends: 263 [2023-12-20 19:40:32,116 INFO L226 Difference]: Without dead ends: 176 [2023-12-20 19:40:32,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-20 19:40:32,120 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 105 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 19:40:32,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 510 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 19:40:32,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2023-12-20 19:40:32,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 152. [2023-12-20 19:40:32,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 85 states have (on average 1.2470588235294118) internal successors, (106), 85 states have internal predecessors, (106), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2023-12-20 19:40:32,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 234 transitions. [2023-12-20 19:40:32,159 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 234 transitions. Word has length 204 [2023-12-20 19:40:32,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:40:32,160 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 234 transitions. [2023-12-20 19:40:32,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-12-20 19:40:32,160 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 234 transitions. [2023-12-20 19:40:32,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2023-12-20 19:40:32,167 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:40:32,168 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:32,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 19:40:32,168 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:40:32,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:40:32,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1791963892, now seen corresponding path program 1 times [2023-12-20 19:40:32,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:40:32,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796411741] [2023-12-20 19:40:32,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:40:32,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:40:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:44,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:40:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:44,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 19:40:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:44,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 19:40:44,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:44,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 19:40:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:44,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 19:40:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:44,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 19:40:44,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:44,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 19:40:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:44,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 19:40:44,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:44,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 19:40:44,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:44,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 19:40:44,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:44,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 19:40:44,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:44,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 19:40:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:44,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 19:40:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:44,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 19:40:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:44,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 19:40:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:44,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 19:40:44,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:44,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 19:40:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:44,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 19:40:44,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:44,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 19:40:44,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:44,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 19:40:44,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:44,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 19:40:44,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:44,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-20 19:40:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:44,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-20 19:40:44,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:44,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-20 19:40:44,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:44,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-20 19:40:44,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:44,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-20 19:40:44,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:44,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-12-20 19:40:44,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:44,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-20 19:40:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:44,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-12-20 19:40:44,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:44,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-12-20 19:40:44,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:44,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-20 19:40:44,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:44,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-12-20 19:40:44,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:40:44,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-12-20 19:40:44,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:40:44,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796411741] [2023-12-20 19:40:44,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796411741] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:40:44,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:40:44,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-20 19:40:44,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010086554] [2023-12-20 19:40:44,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:40:44,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-20 19:40:44,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:40:44,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-20 19:40:44,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-12-20 19:40:44,746 INFO L87 Difference]: Start difference. First operand 152 states and 234 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-12-20 19:40:46,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:40:46,514 INFO L93 Difference]: Finished difference Result 397 states and 597 transitions. [2023-12-20 19:40:46,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-20 19:40:46,516 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 205 [2023-12-20 19:40:46,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:40:46,521 INFO L225 Difference]: With dead ends: 397 [2023-12-20 19:40:46,521 INFO L226 Difference]: Without dead ends: 310 [2023-12-20 19:40:46,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2023-12-20 19:40:46,527 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 287 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-20 19:40:46,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 837 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-20 19:40:46,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2023-12-20 19:40:46,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 244. [2023-12-20 19:40:46,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 143 states have (on average 1.2447552447552448) internal successors, (178), 144 states have internal predecessors, (178), 96 states have call successors, (96), 4 states have call predecessors, (96), 4 states have return successors, (96), 95 states have call predecessors, (96), 96 states have call successors, (96) [2023-12-20 19:40:46,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 370 transitions. [2023-12-20 19:40:46,566 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 370 transitions. Word has length 205 [2023-12-20 19:40:46,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:40:46,567 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 370 transitions. [2023-12-20 19:40:46,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-12-20 19:40:46,567 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 370 transitions. [2023-12-20 19:40:46,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2023-12-20 19:40:46,570 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:40:46,570 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:46,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-20 19:40:46,570 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:40:46,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:40:46,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1985850380, now seen corresponding path program 1 times [2023-12-20 19:40:46,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:40:46,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500860356] [2023-12-20 19:40:46,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:40:46,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:40:46,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:41:12,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:41:12,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:41:12,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 19:41:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:41:12,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 19:41:12,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:41:12,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 19:41:12,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:41:12,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 19:41:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:41:12,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 19:41:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:41:12,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 19:41:12,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:41:12,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 19:41:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:41:12,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 19:41:12,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:41:12,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 19:41:12,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:41:12,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 19:41:12,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:41:12,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 19:41:12,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:41:12,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 19:41:12,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:41:12,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 19:41:12,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:41:12,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 19:41:12,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:41:12,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 19:41:12,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:41:12,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 19:41:12,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:41:12,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 19:41:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:41:12,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 19:41:12,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:41:12,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 19:41:12,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:41:12,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 19:41:12,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:41:12,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-20 19:41:12,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:41:12,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-20 19:41:12,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:41:12,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-20 19:41:12,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:41:12,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-20 19:41:12,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:41:12,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-20 19:41:12,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:41:12,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-12-20 19:41:12,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:41:12,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-20 19:41:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:41:12,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-12-20 19:41:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:41:12,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-12-20 19:41:12,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:41:12,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-20 19:41:12,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:41:12,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-12-20 19:41:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:41:12,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-12-20 19:41:12,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:41:12,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500860356] [2023-12-20 19:41:12,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500860356] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:41:12,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:41:12,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-12-20 19:41:12,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940676527] [2023-12-20 19:41:12,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:41:12,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-20 19:41:12,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:41:12,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-20 19:41:12,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2023-12-20 19:41:12,340 INFO L87 Difference]: Start difference. First operand 244 states and 370 transitions. Second operand has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 3 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2023-12-20 19:41:19,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 19:41:23,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:41:23,005 INFO L93 Difference]: Finished difference Result 587 states and 862 transitions. [2023-12-20 19:41:23,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-20 19:41:23,005 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 3 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) Word has length 205 [2023-12-20 19:41:23,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:41:23,007 INFO L225 Difference]: With dead ends: 587 [2023-12-20 19:41:23,008 INFO L226 Difference]: Without dead ends: 400 [2023-12-20 19:41:23,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=402, Invalid=1320, Unknown=0, NotChecked=0, Total=1722 [2023-12-20 19:41:23,009 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 546 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 1142 mSolverCounterSat, 158 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 1301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 1142 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2023-12-20 19:41:23,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 828 Invalid, 1301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 1142 Invalid, 1 Unknown, 0 Unchecked, 6.2s Time] [2023-12-20 19:41:23,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2023-12-20 19:41:23,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 292. [2023-12-20 19:41:23,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 189 states have (on average 1.2857142857142858) internal successors, (243), 189 states have internal predecessors, (243), 96 states have call successors, (96), 6 states have call predecessors, (96), 6 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2023-12-20 19:41:23,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 435 transitions. [2023-12-20 19:41:23,062 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 435 transitions. Word has length 205 [2023-12-20 19:41:23,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:41:23,062 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 435 transitions. [2023-12-20 19:41:23,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 17 states have internal predecessors, (48), 3 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2023-12-20 19:41:23,062 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 435 transitions. [2023-12-20 19:41:23,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2023-12-20 19:41:23,064 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:41:23,064 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:23,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-20 19:41:23,064 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:41:23,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:41:23,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1176503754, now seen corresponding path program 1 times [2023-12-20 19:41:23,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:41:23,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392451919] [2023-12-20 19:41:23,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:41:23,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:41:23,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:43:59,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:43:59,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:43:59,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 19:43:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:43:59,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 19:43:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:43:59,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 19:43:59,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:43:59,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 19:43:59,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:43:59,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 19:43:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:43:59,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 19:43:59,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:43:59,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 19:43:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:43:59,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 19:43:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:43:59,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 19:43:59,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:43:59,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 19:43:59,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:43:59,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 19:43:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:43:59,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 19:43:59,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:43:59,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 19:43:59,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:43:59,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 19:43:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:43:59,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 19:43:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:43:59,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 19:43:59,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:43:59,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 19:43:59,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:43:59,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 19:43:59,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:43:59,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 19:43:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:43:59,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 19:43:59,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:43:59,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-20 19:43:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:43:59,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-20 19:43:59,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:43:59,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-20 19:43:59,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:43:59,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-20 19:43:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:43:59,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-20 19:43:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:43:59,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-12-20 19:43:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:43:59,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-20 19:43:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:43:59,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-12-20 19:43:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:43:59,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-12-20 19:43:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:43:59,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-20 19:43:59,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:43:59,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-12-20 19:43:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:43:59,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-12-20 19:43:59,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:43:59,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392451919] [2023-12-20 19:43:59,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392451919] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:43:59,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:43:59,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-12-20 19:43:59,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694062365] [2023-12-20 19:43:59,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:43:59,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-20 19:43:59,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:43:59,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-20 19:43:59,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2023-12-20 19:43:59,831 INFO L87 Difference]: Start difference. First operand 292 states and 435 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2023-12-20 19:44:04,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 19:44:12,462 WARN L293 SmtUtils]: Spent 6.55s on a formula simplification. DAG size of input: 203 DAG size of output: 183 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 19:44:19,006 WARN L293 SmtUtils]: Spent 5.59s on a formula simplification. DAG size of input: 201 DAG size of output: 180 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 19:44:23,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:44:23,272 INFO L93 Difference]: Finished difference Result 444 states and 655 transitions. [2023-12-20 19:44:23,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-20 19:44:23,273 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 205 [2023-12-20 19:44:23,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:44:23,275 INFO L225 Difference]: With dead ends: 444 [2023-12-20 19:44:23,275 INFO L226 Difference]: Without dead ends: 357 [2023-12-20 19:44:23,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 24.4s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2023-12-20 19:44:23,276 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 410 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 122 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2023-12-20 19:44:23,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 806 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 822 Invalid, 1 Unknown, 0 Unchecked, 6.6s Time] [2023-12-20 19:44:23,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2023-12-20 19:44:23,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 293. [2023-12-20 19:44:23,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 190 states have (on average 1.2894736842105263) internal successors, (245), 190 states have internal predecessors, (245), 96 states have call successors, (96), 6 states have call predecessors, (96), 6 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2023-12-20 19:44:23,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 437 transitions. [2023-12-20 19:44:23,300 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 437 transitions. Word has length 205 [2023-12-20 19:44:23,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:44:23,301 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 437 transitions. [2023-12-20 19:44:23,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2023-12-20 19:44:23,301 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 437 transitions. [2023-12-20 19:44:23,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2023-12-20 19:44:23,302 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:44:23,302 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:23,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-20 19:44:23,303 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:44:23,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:44:23,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1608052338, now seen corresponding path program 1 times [2023-12-20 19:44:23,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:44:23,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186177818] [2023-12-20 19:44:23,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:44:23,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:44:23,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:31,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:44:31,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:31,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 19:44:31,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:31,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 19:44:31,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:31,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 19:44:31,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:31,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 19:44:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:31,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 19:44:31,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:31,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 19:44:31,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:31,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 19:44:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:31,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 19:44:31,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:31,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 19:44:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:31,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 19:44:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:31,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 19:44:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:31,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 19:44:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:31,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 19:44:31,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:31,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 19:44:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:31,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 19:44:31,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:31,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 19:44:31,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:31,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 19:44:31,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:31,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 19:44:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:31,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 19:44:31,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:31,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 19:44:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:31,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-20 19:44:31,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:31,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-20 19:44:31,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:31,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-20 19:44:31,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:31,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-20 19:44:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:31,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-20 19:44:31,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:31,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-12-20 19:44:31,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:31,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-20 19:44:31,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:31,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-12-20 19:44:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:31,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-12-20 19:44:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:31,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-20 19:44:31,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:31,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-12-20 19:44:31,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:31,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-12-20 19:44:31,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:44:31,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186177818] [2023-12-20 19:44:31,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186177818] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:44:31,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:44:31,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-20 19:44:31,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505576903] [2023-12-20 19:44:31,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:44:31,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-20 19:44:31,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:44:31,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-20 19:44:31,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-20 19:44:31,443 INFO L87 Difference]: Start difference. First operand 293 states and 437 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-12-20 19:44:33,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:44:33,076 INFO L93 Difference]: Finished difference Result 510 states and 741 transitions. [2023-12-20 19:44:33,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-20 19:44:33,076 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 205 [2023-12-20 19:44:33,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:44:33,078 INFO L225 Difference]: With dead ends: 510 [2023-12-20 19:44:33,078 INFO L226 Difference]: Without dead ends: 423 [2023-12-20 19:44:33,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=191, Invalid=511, Unknown=0, NotChecked=0, Total=702 [2023-12-20 19:44:33,080 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 342 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-20 19:44:33,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 738 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-20 19:44:33,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2023-12-20 19:44:33,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 293. [2023-12-20 19:44:33,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 190 states have (on average 1.2894736842105263) internal successors, (245), 190 states have internal predecessors, (245), 96 states have call successors, (96), 6 states have call predecessors, (96), 6 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2023-12-20 19:44:33,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 437 transitions. [2023-12-20 19:44:33,117 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 437 transitions. Word has length 205 [2023-12-20 19:44:33,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:44:33,119 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 437 transitions. [2023-12-20 19:44:33,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-12-20 19:44:33,119 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 437 transitions. [2023-12-20 19:44:33,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2023-12-20 19:44:33,122 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:44:33,122 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:33,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-20 19:44:33,123 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:44:33,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:44:33,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1399044366, now seen corresponding path program 1 times [2023-12-20 19:44:33,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:44:33,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869971161] [2023-12-20 19:44:33,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:44:33,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:44:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:50,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:44:50,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:50,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 19:44:50,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:50,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 19:44:50,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:50,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 19:44:50,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:50,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 19:44:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:50,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 19:44:50,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:50,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 19:44:50,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:50,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 19:44:50,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:50,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 19:44:50,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:50,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 19:44:50,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:50,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 19:44:50,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:50,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 19:44:50,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:50,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 19:44:50,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:50,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 19:44:50,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:50,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 19:44:50,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:50,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 19:44:50,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:50,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 19:44:50,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:50,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 19:44:50,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:50,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 19:44:50,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:50,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 19:44:50,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:50,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 19:44:50,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:50,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-20 19:44:50,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:50,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-20 19:44:50,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:50,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-20 19:44:50,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:50,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-20 19:44:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:50,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-20 19:44:50,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:50,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-12-20 19:44:50,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:50,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-20 19:44:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:50,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-12-20 19:44:50,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:50,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-12-20 19:44:50,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:50,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-20 19:44:50,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:50,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-12-20 19:44:50,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:44:50,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-12-20 19:44:50,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:44:50,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869971161] [2023-12-20 19:44:50,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869971161] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:44:50,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:44:50,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-20 19:44:50,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750184995] [2023-12-20 19:44:50,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:44:50,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-20 19:44:50,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:44:50,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-20 19:44:50,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-12-20 19:44:50,182 INFO L87 Difference]: Start difference. First operand 293 states and 437 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-12-20 19:44:54,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.90s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 19:45:00,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:45:00,209 INFO L93 Difference]: Finished difference Result 461 states and 676 transitions. [2023-12-20 19:45:00,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-20 19:45:00,209 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 205 [2023-12-20 19:45:00,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:45:00,211 INFO L225 Difference]: With dead ends: 461 [2023-12-20 19:45:00,211 INFO L226 Difference]: Without dead ends: 374 [2023-12-20 19:45:00,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2023-12-20 19:45:00,212 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 204 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2023-12-20 19:45:00,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 703 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2023-12-20 19:45:00,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2023-12-20 19:45:00,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 286. [2023-12-20 19:45:00,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 183 states have (on average 1.278688524590164) internal successors, (234), 183 states have internal predecessors, (234), 96 states have call successors, (96), 6 states have call predecessors, (96), 6 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2023-12-20 19:45:00,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 426 transitions. [2023-12-20 19:45:00,229 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 426 transitions. Word has length 205 [2023-12-20 19:45:00,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:45:00,229 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 426 transitions. [2023-12-20 19:45:00,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-12-20 19:45:00,229 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 426 transitions. [2023-12-20 19:45:00,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2023-12-20 19:45:00,230 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:45:00,231 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:00,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-20 19:45:00,231 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:45:00,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:45:00,231 INFO L85 PathProgramCache]: Analyzing trace with hash 413793100, now seen corresponding path program 1 times [2023-12-20 19:45:00,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:45:00,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445647047] [2023-12-20 19:45:00,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:45:00,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:45:00,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:00,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:47:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:00,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 19:47:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:00,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 19:47:00,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:00,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 19:47:00,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:00,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 19:47:00,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:00,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 19:47:00,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:00,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 19:47:00,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:00,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 19:47:00,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:00,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 19:47:00,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:00,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 19:47:00,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:00,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 19:47:00,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:00,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 19:47:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:00,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 19:47:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:00,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 19:47:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:00,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 19:47:00,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:00,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 19:47:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:00,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 19:47:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:00,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 19:47:00,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:00,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 19:47:00,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:00,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 19:47:00,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:00,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 19:47:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:00,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-20 19:47:00,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:00,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-20 19:47:00,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:00,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-20 19:47:00,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:00,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-20 19:47:00,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:00,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-20 19:47:00,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:00,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-12-20 19:47:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:00,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-20 19:47:00,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:00,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-12-20 19:47:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:00,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-12-20 19:47:00,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:00,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-20 19:47:00,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:00,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-12-20 19:47:00,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:00,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-12-20 19:47:00,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:47:00,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445647047] [2023-12-20 19:47:00,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445647047] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:47:00,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:47:00,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-20 19:47:00,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501064641] [2023-12-20 19:47:00,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:47:00,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-20 19:47:00,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:47:00,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-20 19:47:00,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2023-12-20 19:47:00,530 INFO L87 Difference]: Start difference. First operand 286 states and 426 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2023-12-20 19:47:05,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:47:05,324 INFO L93 Difference]: Finished difference Result 550 states and 807 transitions. [2023-12-20 19:47:05,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-20 19:47:05,334 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 205 [2023-12-20 19:47:05,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:47:05,336 INFO L225 Difference]: With dead ends: 550 [2023-12-20 19:47:05,336 INFO L226 Difference]: Without dead ends: 362 [2023-12-20 19:47:05,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=290, Invalid=702, Unknown=0, NotChecked=0, Total=992 [2023-12-20 19:47:05,337 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 294 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-20 19:47:05,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 910 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-20 19:47:05,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2023-12-20 19:47:05,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 286. [2023-12-20 19:47:05,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 182 states have (on average 1.2637362637362637) internal successors, (230), 182 states have internal predecessors, (230), 96 states have call successors, (96), 7 states have call predecessors, (96), 7 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2023-12-20 19:47:05,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 422 transitions. [2023-12-20 19:47:05,365 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 422 transitions. Word has length 205 [2023-12-20 19:47:05,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:47:05,366 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 422 transitions. [2023-12-20 19:47:05,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2023-12-20 19:47:05,366 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 422 transitions. [2023-12-20 19:47:05,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2023-12-20 19:47:05,367 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:47:05,367 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:05,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-20 19:47:05,367 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:47:05,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:47:05,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1114857678, now seen corresponding path program 1 times [2023-12-20 19:47:05,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:47:05,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174767266] [2023-12-20 19:47:05,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:47:05,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:47:05,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:33,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:47:33,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:33,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 19:47:33,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:33,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 19:47:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:33,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 19:47:33,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:33,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 19:47:33,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:33,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 19:47:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:33,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 19:47:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:33,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 19:47:33,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:33,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 19:47:33,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:33,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 19:47:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:33,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 19:47:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:33,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 19:47:33,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:33,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 19:47:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:33,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 19:47:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:33,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 19:47:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:33,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 19:47:33,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:33,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 19:47:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:33,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 19:47:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:33,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 19:47:33,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:33,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 19:47:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:33,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 19:47:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:33,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-20 19:47:33,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:33,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-20 19:47:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:33,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-20 19:47:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:33,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-20 19:47:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:33,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-20 19:47:33,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:33,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-12-20 19:47:33,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:33,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-20 19:47:33,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:33,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-12-20 19:47:33,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:33,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-12-20 19:47:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:33,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-20 19:47:33,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:33,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-12-20 19:47:33,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:47:33,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-12-20 19:47:33,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:47:33,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174767266] [2023-12-20 19:47:33,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174767266] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:47:33,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:47:33,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-20 19:47:33,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527303875] [2023-12-20 19:47:33,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:47:33,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-20 19:47:33,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:47:33,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-20 19:47:33,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-12-20 19:47:33,305 INFO L87 Difference]: Start difference. First operand 286 states and 422 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-12-20 19:47:34,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:47:34,414 INFO L93 Difference]: Finished difference Result 555 states and 805 transitions. [2023-12-20 19:47:34,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-20 19:47:34,414 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 205 [2023-12-20 19:47:34,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:47:34,416 INFO L225 Difference]: With dead ends: 555 [2023-12-20 19:47:34,416 INFO L226 Difference]: Without dead ends: 352 [2023-12-20 19:47:34,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=218, Unknown=0, NotChecked=0, Total=342 [2023-12-20 19:47:34,418 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 225 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-20 19:47:34,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 728 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-20 19:47:34,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2023-12-20 19:47:34,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 280. [2023-12-20 19:47:34,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 176 states have (on average 1.2613636363636365) internal successors, (222), 176 states have internal predecessors, (222), 96 states have call successors, (96), 7 states have call predecessors, (96), 7 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2023-12-20 19:47:34,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 414 transitions. [2023-12-20 19:47:34,475 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 414 transitions. Word has length 205 [2023-12-20 19:47:34,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:47:34,475 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 414 transitions. [2023-12-20 19:47:34,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-12-20 19:47:34,475 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 414 transitions. [2023-12-20 19:47:34,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2023-12-20 19:47:34,476 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:47:34,477 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:34,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-20 19:47:34,477 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:47:34,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:47:34,477 INFO L85 PathProgramCache]: Analyzing trace with hash 914655502, now seen corresponding path program 1 times [2023-12-20 19:47:34,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:47:34,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401739156] [2023-12-20 19:47:34,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:47:34,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:47:34,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:48:34,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:48:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:48:34,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 19:48:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:48:34,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 19:48:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:48:34,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 19:48:34,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:48:34,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 19:48:34,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:48:34,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 19:48:34,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:48:34,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 19:48:34,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:48:34,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 19:48:34,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:48:34,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 19:48:34,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:48:34,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 19:48:34,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:48:34,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 19:48:34,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:48:34,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 19:48:34,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:48:34,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 19:48:34,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:48:34,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 19:48:34,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:48:34,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 19:48:34,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:48:34,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 19:48:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:48:34,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 19:48:34,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:48:34,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 19:48:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:48:34,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 19:48:34,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:48:34,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 19:48:34,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:48:34,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 19:48:34,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:48:34,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-20 19:48:34,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:48:34,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-20 19:48:34,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:48:34,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-20 19:48:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:48:34,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-20 19:48:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:48:34,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-20 19:48:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:48:34,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-12-20 19:48:34,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:48:34,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-20 19:48:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:48:34,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-12-20 19:48:34,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:48:34,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-12-20 19:48:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:48:34,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-20 19:48:34,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:48:34,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-12-20 19:48:34,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:48:34,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-12-20 19:48:34,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:48:34,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401739156] [2023-12-20 19:48:34,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401739156] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:48:34,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:48:34,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-20 19:48:34,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466625050] [2023-12-20 19:48:34,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:48:34,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-20 19:48:34,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:48:34,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-20 19:48:34,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-12-20 19:48:34,771 INFO L87 Difference]: Start difference. First operand 280 states and 414 transitions. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2023-12-20 19:48:36,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:48:36,681 INFO L93 Difference]: Finished difference Result 493 states and 730 transitions. [2023-12-20 19:48:36,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-20 19:48:36,682 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 205 [2023-12-20 19:48:36,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:48:36,684 INFO L225 Difference]: With dead ends: 493 [2023-12-20 19:48:36,684 INFO L226 Difference]: Without dead ends: 406 [2023-12-20 19:48:36,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=192, Invalid=510, Unknown=0, NotChecked=0, Total=702 [2023-12-20 19:48:36,685 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 336 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-20 19:48:36,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 795 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-20 19:48:36,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2023-12-20 19:48:36,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 363. [2023-12-20 19:48:36,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 224 states have (on average 1.2410714285714286) internal successors, (278), 225 states have internal predecessors, (278), 128 states have call successors, (128), 10 states have call predecessors, (128), 10 states have return successors, (128), 127 states have call predecessors, (128), 128 states have call successors, (128) [2023-12-20 19:48:36,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 534 transitions. [2023-12-20 19:48:36,710 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 534 transitions. Word has length 205 [2023-12-20 19:48:36,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:48:36,710 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 534 transitions. [2023-12-20 19:48:36,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2023-12-20 19:48:36,710 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 534 transitions. [2023-12-20 19:48:36,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2023-12-20 19:48:36,711 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:48:36,711 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:36,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-20 19:48:36,711 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:48:36,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:48:36,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1174554802, now seen corresponding path program 1 times [2023-12-20 19:48:36,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:48:36,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081693709] [2023-12-20 19:48:36,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:48:36,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:48:36,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:17,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:49:17,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:17,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 19:49:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:17,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 19:49:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:17,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 19:49:17,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:17,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 19:49:17,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:17,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 19:49:17,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:17,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 19:49:17,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:17,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 19:49:17,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:17,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 19:49:17,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:17,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 19:49:17,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:17,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 19:49:17,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:17,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 19:49:17,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:17,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 19:49:17,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:17,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 19:49:17,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:17,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 19:49:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:17,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 19:49:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:17,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 19:49:17,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:17,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 19:49:17,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:17,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 19:49:17,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:17,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 19:49:17,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:17,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 19:49:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:17,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-20 19:49:17,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:17,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-20 19:49:17,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:17,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-20 19:49:17,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:17,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-20 19:49:17,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:17,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-20 19:49:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:17,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-12-20 19:49:17,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:17,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-20 19:49:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:17,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-12-20 19:49:17,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:17,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-12-20 19:49:17,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:17,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-20 19:49:17,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:17,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-12-20 19:49:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:17,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-12-20 19:49:17,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:49:17,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081693709] [2023-12-20 19:49:17,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081693709] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:49:17,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:49:17,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-20 19:49:17,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584925354] [2023-12-20 19:49:17,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:49:17,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-20 19:49:17,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:49:17,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-20 19:49:17,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-12-20 19:49:17,208 INFO L87 Difference]: Start difference. First operand 363 states and 534 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-12-20 19:49:19,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:49:19,572 INFO L93 Difference]: Finished difference Result 584 states and 856 transitions. [2023-12-20 19:49:19,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-20 19:49:19,573 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 205 [2023-12-20 19:49:19,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:49:19,578 INFO L225 Difference]: With dead ends: 584 [2023-12-20 19:49:19,578 INFO L226 Difference]: Without dead ends: 392 [2023-12-20 19:49:19,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2023-12-20 19:49:19,580 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 160 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-20 19:49:19,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 703 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-20 19:49:19,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-12-20 19:49:19,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 365. [2023-12-20 19:49:19,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 226 states have (on average 1.238938053097345) internal successors, (280), 227 states have internal predecessors, (280), 128 states have call successors, (128), 10 states have call predecessors, (128), 10 states have return successors, (128), 127 states have call predecessors, (128), 128 states have call successors, (128) [2023-12-20 19:49:19,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 536 transitions. [2023-12-20 19:49:19,629 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 536 transitions. Word has length 205 [2023-12-20 19:49:19,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:49:19,629 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 536 transitions. [2023-12-20 19:49:19,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-12-20 19:49:19,629 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 536 transitions. [2023-12-20 19:49:19,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2023-12-20 19:49:19,630 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:49:19,630 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:19,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-20 19:49:19,630 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:49:19,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:49:19,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1559252251, now seen corresponding path program 1 times [2023-12-20 19:49:19,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:49:19,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454004462] [2023-12-20 19:49:19,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:49:19,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:49:19,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:58,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:49:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:58,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 19:49:58,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:58,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 19:49:58,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:58,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 19:49:58,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:58,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 19:49:58,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:58,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 19:49:58,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:58,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 19:49:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:58,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 19:49:58,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:58,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 19:49:58,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:58,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 19:49:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:58,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 19:49:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:58,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 19:49:58,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:58,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 19:49:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:58,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 19:49:58,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:58,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 19:49:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:58,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 19:49:58,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:58,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 19:49:58,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:58,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 19:49:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:58,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 19:49:58,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:58,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 19:49:58,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:58,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 19:49:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:58,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-20 19:49:58,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:58,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-20 19:49:58,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:58,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-20 19:49:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:58,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-20 19:49:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:58,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-20 19:49:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:58,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-12-20 19:49:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:58,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-20 19:49:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:58,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-12-20 19:49:58,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:58,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-12-20 19:49:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:58,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-20 19:49:58,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:58,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-12-20 19:49:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:49:58,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-12-20 19:49:58,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:49:58,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454004462] [2023-12-20 19:49:58,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454004462] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:49:58,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:49:58,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-12-20 19:49:58,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925080238] [2023-12-20 19:49:58,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:49:58,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-20 19:49:58,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:49:58,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-20 19:49:58,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2023-12-20 19:49:58,530 INFO L87 Difference]: Start difference. First operand 365 states and 536 transitions. Second operand has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2023-12-20 19:50:02,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:50:02,969 INFO L93 Difference]: Finished difference Result 520 states and 757 transitions. [2023-12-20 19:50:02,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-20 19:50:02,970 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 206 [2023-12-20 19:50:02,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:50:02,972 INFO L225 Difference]: With dead ends: 520 [2023-12-20 19:50:02,972 INFO L226 Difference]: Without dead ends: 433 [2023-12-20 19:50:02,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=239, Invalid=753, Unknown=0, NotChecked=0, Total=992 [2023-12-20 19:50:02,973 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 356 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-20 19:50:02,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 830 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-20 19:50:02,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2023-12-20 19:50:02,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 365. [2023-12-20 19:50:02,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 226 states have (on average 1.238938053097345) internal successors, (280), 227 states have internal predecessors, (280), 128 states have call successors, (128), 10 states have call predecessors, (128), 10 states have return successors, (128), 127 states have call predecessors, (128), 128 states have call successors, (128) [2023-12-20 19:50:03,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 536 transitions. [2023-12-20 19:50:03,001 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 536 transitions. Word has length 206 [2023-12-20 19:50:03,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:50:03,001 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 536 transitions. [2023-12-20 19:50:03,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2023-12-20 19:50:03,001 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 536 transitions. [2023-12-20 19:50:03,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2023-12-20 19:50:03,002 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:50:03,002 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:03,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-20 19:50:03,003 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:50:03,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:50:03,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1218242267, now seen corresponding path program 1 times [2023-12-20 19:50:03,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:50:03,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676354756] [2023-12-20 19:50:03,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:50:03,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:50:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:50:56,956 WARN L293 SmtUtils]: Spent 6.00s on a formula simplification. DAG size of input: 179 DAG size of output: 162 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 19:50:56,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:50:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:50:56,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 19:50:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:50:56,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 19:50:56,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:50:56,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 19:50:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:50:56,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 19:50:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:50:56,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 19:50:56,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:50:56,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 19:50:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:50:56,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 19:50:56,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:50:56,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 19:50:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:50:56,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 19:50:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:50:56,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 19:50:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:50:56,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 19:50:56,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:50:56,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 19:50:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:50:56,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 19:50:57,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:50:57,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 19:50:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:50:57,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 19:50:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:50:57,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 19:50:57,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:50:57,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 19:50:57,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:50:57,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 19:50:57,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:50:57,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 19:50:57,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:50:57,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 19:50:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:50:57,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-20 19:50:57,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:50:57,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-20 19:50:57,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:50:57,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-20 19:50:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:50:57,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-20 19:50:57,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:50:57,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-20 19:50:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:50:57,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-12-20 19:50:57,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:50:57,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-20 19:50:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:50:57,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-12-20 19:50:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:50:57,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-12-20 19:50:57,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:50:57,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-20 19:50:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:50:57,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-12-20 19:50:57,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:50:57,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-12-20 19:50:57,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:50:57,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676354756] [2023-12-20 19:50:57,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676354756] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:50:57,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:50:57,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-20 19:50:57,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499200795] [2023-12-20 19:50:57,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:50:57,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-20 19:50:57,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:50:57,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-20 19:50:57,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2023-12-20 19:50:57,076 INFO L87 Difference]: Start difference. First operand 365 states and 536 transitions. Second operand has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2023-12-20 19:51:05,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 19:51:07,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:51:07,397 INFO L93 Difference]: Finished difference Result 768 states and 1108 transitions. [2023-12-20 19:51:07,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-20 19:51:07,398 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 206 [2023-12-20 19:51:07,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:51:07,399 INFO L225 Difference]: With dead ends: 768 [2023-12-20 19:51:07,400 INFO L226 Difference]: Without dead ends: 468 [2023-12-20 19:51:07,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=230, Invalid=526, Unknown=0, NotChecked=0, Total=756 [2023-12-20 19:51:07,401 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 259 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 111 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2023-12-20 19:51:07,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 918 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 764 Invalid, 1 Unknown, 0 Unchecked, 5.5s Time] [2023-12-20 19:51:07,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2023-12-20 19:51:07,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 372. [2023-12-20 19:51:07,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 233 states have (on average 1.240343347639485) internal successors, (289), 234 states have internal predecessors, (289), 128 states have call successors, (128), 10 states have call predecessors, (128), 10 states have return successors, (128), 127 states have call predecessors, (128), 128 states have call successors, (128) [2023-12-20 19:51:07,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 545 transitions. [2023-12-20 19:51:07,428 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 545 transitions. Word has length 206 [2023-12-20 19:51:07,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:51:07,429 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 545 transitions. [2023-12-20 19:51:07,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 13 states have internal predecessors, (49), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2023-12-20 19:51:07,430 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 545 transitions. [2023-12-20 19:51:07,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2023-12-20 19:51:07,430 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:51:07,431 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:07,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-20 19:51:07,431 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:51:07,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:51:07,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1476407705, now seen corresponding path program 1 times [2023-12-20 19:51:07,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:51:07,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139059526] [2023-12-20 19:51:07,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:51:07,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:51:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:51:07,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:51:07,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:51:07,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 19:51:07,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:51:07,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 19:51:07,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:51:07,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 19:51:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:51:07,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 19:51:07,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:51:07,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 19:51:07,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:51:07,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 19:51:07,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:51:07,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 19:51:07,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:51:07,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 19:51:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:51:07,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 19:51:07,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:51:07,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 19:51:07,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:51:07,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 19:51:07,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:51:07,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 19:51:07,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:51:07,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 19:51:07,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:51:07,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 19:51:07,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:51:07,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 19:51:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:51:07,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 19:51:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:51:07,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 19:51:07,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:51:07,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 19:51:07,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:51:07,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 19:51:07,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:51:07,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 19:51:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:51:07,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-20 19:51:07,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:51:07,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-20 19:51:07,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:51:07,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-20 19:51:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:51:07,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-20 19:51:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:51:07,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-20 19:51:07,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:51:07,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-12-20 19:51:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:51:07,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-20 19:51:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:51:07,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-12-20 19:51:07,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:51:07,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-12-20 19:51:07,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:51:07,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-20 19:51:07,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:51:07,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-12-20 19:51:07,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:51:07,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-12-20 19:51:07,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:51:07,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139059526] [2023-12-20 19:51:07,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139059526] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:51:07,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:51:07,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 19:51:07,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161326885] [2023-12-20 19:51:07,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:51:07,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 19:51:07,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:51:07,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 19:51:07,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 19:51:07,590 INFO L87 Difference]: Start difference. First operand 372 states and 545 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-12-20 19:51:07,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:51:07,701 INFO L93 Difference]: Finished difference Result 766 states and 1107 transitions. [2023-12-20 19:51:07,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 19:51:07,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 206 [2023-12-20 19:51:07,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:51:07,704 INFO L225 Difference]: With dead ends: 766 [2023-12-20 19:51:07,704 INFO L226 Difference]: Without dead ends: 459 [2023-12-20 19:51:07,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 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:51:07,705 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 31 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 19:51:07,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 417 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 19:51:07,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2023-12-20 19:51:07,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 448. [2023-12-20 19:51:07,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 292 states have (on average 1.2294520547945205) internal successors, (359), 296 states have internal predecessors, (359), 140 states have call successors, (140), 15 states have call predecessors, (140), 15 states have return successors, (140), 136 states have call predecessors, (140), 140 states have call successors, (140) [2023-12-20 19:51:07,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 639 transitions. [2023-12-20 19:51:07,739 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 639 transitions. Word has length 206 [2023-12-20 19:51:07,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:51:07,740 INFO L495 AbstractCegarLoop]: Abstraction has 448 states and 639 transitions. [2023-12-20 19:51:07,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-12-20 19:51:07,740 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 639 transitions. [2023-12-20 19:51:07,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2023-12-20 19:51:07,741 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:51:07,741 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:07,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-20 19:51:07,741 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:51:07,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:51:07,741 INFO L85 PathProgramCache]: Analyzing trace with hash -434892455, now seen corresponding path program 1 times [2023-12-20 19:51:07,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:51:07,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184879002] [2023-12-20 19:51:07,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:51:07,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:51:07,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:52:26,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:52:26,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:52:26,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 19:52:26,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:52:26,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 19:52:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:52:26,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 19:52:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:52:26,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 19:52:26,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:52:26,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 19:52:26,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:52:26,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 19:52:26,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:52:26,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 19:52:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:52:26,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 19:52:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:52:26,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 19:52:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:52:26,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 19:52:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:52:26,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 19:52:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:52:26,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 19:52:26,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:52:26,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 19:52:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:52:26,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 19:52:26,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:52:26,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 19:52:26,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:52:26,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 19:52:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:52:26,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 19:52:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:52:26,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 19:52:26,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:52:26,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 19:52:26,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:52:26,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 19:52:26,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:52:26,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-20 19:52:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:52:26,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-20 19:52:26,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:52:26,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-20 19:52:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:52:26,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-20 19:52:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:52:26,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-20 19:52:26,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:52:26,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-12-20 19:52:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:52:26,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-20 19:52:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:52:26,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-12-20 19:52:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:52:26,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-12-20 19:52:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:52:26,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-20 19:52:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:52:26,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-12-20 19:52:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:52:26,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-12-20 19:52:26,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:52:26,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184879002] [2023-12-20 19:52:26,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184879002] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:52:26,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:52:26,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-20 19:52:26,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330341530] [2023-12-20 19:52:26,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:52:26,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-20 19:52:26,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:52:26,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-20 19:52:26,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2023-12-20 19:52:26,494 INFO L87 Difference]: Start difference. First operand 448 states and 639 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2023-12-20 19:52:33,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 19:52:37,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 19:52:42,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 19:52:47,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:52:47,633 INFO L93 Difference]: Finished difference Result 868 states and 1217 transitions. [2023-12-20 19:52:47,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-20 19:52:47,634 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 206 [2023-12-20 19:52:47,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:52:47,637 INFO L225 Difference]: With dead ends: 868 [2023-12-20 19:52:47,637 INFO L226 Difference]: Without dead ends: 758 [2023-12-20 19:52:47,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2023-12-20 19:52:47,640 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 265 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 123 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2023-12-20 19:52:47,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 958 Invalid, 1072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 946 Invalid, 3 Unknown, 0 Unchecked, 13.5s Time] [2023-12-20 19:52:47,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2023-12-20 19:52:47,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 577. [2023-12-20 19:52:47,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 384 states have (on average 1.2421875) internal successors, (477), 387 states have internal predecessors, (477), 172 states have call successors, (172), 20 states have call predecessors, (172), 20 states have return successors, (172), 169 states have call predecessors, (172), 172 states have call successors, (172) [2023-12-20 19:52:47,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 821 transitions. [2023-12-20 19:52:47,690 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 821 transitions. Word has length 206 [2023-12-20 19:52:47,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:52:47,690 INFO L495 AbstractCegarLoop]: Abstraction has 577 states and 821 transitions. [2023-12-20 19:52:47,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2023-12-20 19:52:47,690 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 821 transitions. [2023-12-20 19:52:47,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2023-12-20 19:52:47,691 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:52:47,691 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:47,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-20 19:52:47,692 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:52:47,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:52:47,692 INFO L85 PathProgramCache]: Analyzing trace with hash -377634153, now seen corresponding path program 1 times [2023-12-20 19:52:47,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:52:47,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310336911] [2023-12-20 19:52:47,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:52:47,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:52:47,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:53:16,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:53:16,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:53:16,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 19:53:16,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:53:16,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 19:53:16,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:53:16,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 19:53:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:53:16,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 19:53:16,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:53:16,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 19:53:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:53:16,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 19:53:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:53:16,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 19:53:16,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:53:16,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 19:53:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:53:16,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 19:53:16,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:53:16,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 19:53:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:53:16,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 19:53:16,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:53:16,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 19:53:16,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:53:16,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 19:53:16,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:53:16,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 19:53:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:53:16,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 19:53:16,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:53:16,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 19:53:16,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:53:16,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 19:53:16,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:53:16,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 19:53:16,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:53:16,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 19:53:16,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:53:16,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 19:53:16,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:53:16,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-20 19:53:16,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:53:16,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-20 19:53:16,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:53:16,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-20 19:53:16,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:53:16,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-20 19:53:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:53:16,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-20 19:53:16,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:53:16,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-12-20 19:53:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:53:16,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-20 19:53:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:53:16,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-12-20 19:53:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:53:16,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-12-20 19:53:16,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:53:16,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-20 19:53:16,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:53:16,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-12-20 19:53:16,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:53:16,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-12-20 19:53:16,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:53:16,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310336911] [2023-12-20 19:53:16,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310336911] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:53:16,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:53:16,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-20 19:53:16,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049962870] [2023-12-20 19:53:16,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:53:16,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-20 19:53:16,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:53:16,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-20 19:53:16,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-12-20 19:53:16,520 INFO L87 Difference]: Start difference. First operand 577 states and 821 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2023-12-20 19:53:20,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 19:53:21,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:53:21,611 INFO L93 Difference]: Finished difference Result 917 states and 1273 transitions. [2023-12-20 19:53:21,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-20 19:53:21,611 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 206 [2023-12-20 19:53:21,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:53:21,614 INFO L225 Difference]: With dead ends: 917 [2023-12-20 19:53:21,614 INFO L226 Difference]: Without dead ends: 807 [2023-12-20 19:53:21,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=286, Invalid=974, Unknown=0, NotChecked=0, Total=1260 [2023-12-20 19:53:21,615 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 337 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-12-20 19:53:21,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 907 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-12-20 19:53:21,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2023-12-20 19:53:21,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 603. [2023-12-20 19:53:21,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 603 states, 408 states have (on average 1.2524509803921569) internal successors, (511), 411 states have internal predecessors, (511), 172 states have call successors, (172), 22 states have call predecessors, (172), 22 states have return successors, (172), 169 states have call predecessors, (172), 172 states have call successors, (172) [2023-12-20 19:53:21,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 855 transitions. [2023-12-20 19:53:21,667 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 855 transitions. Word has length 206 [2023-12-20 19:53:21,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:53:21,667 INFO L495 AbstractCegarLoop]: Abstraction has 603 states and 855 transitions. [2023-12-20 19:53:21,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2023-12-20 19:53:21,667 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 855 transitions. [2023-12-20 19:53:21,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2023-12-20 19:53:21,669 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:53:21,669 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:21,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-20 19:53:21,669 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:53:21,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:53:21,670 INFO L85 PathProgramCache]: Analyzing trace with hash -775902439, now seen corresponding path program 1 times [2023-12-20 19:53:21,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:53:21,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481187941] [2023-12-20 19:53:21,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:53:21,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:53:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:04,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:54:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:04,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 19:54:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:04,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 19:54:04,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:04,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 19:54:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:04,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 19:54:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:04,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 19:54:04,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:04,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 19:54:04,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:04,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 19:54:04,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:04,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 19:54:04,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:04,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 19:54:04,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:04,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 19:54:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:04,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 19:54:04,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:04,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 19:54:04,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:04,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 19:54:04,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:04,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 19:54:04,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:04,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 19:54:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:04,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 19:54:04,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:04,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 19:54:04,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:04,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 19:54:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:04,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 19:54:04,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:04,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 19:54:04,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:04,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-20 19:54:04,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:04,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-20 19:54:04,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:04,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-20 19:54:04,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:04,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-20 19:54:04,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:04,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-20 19:54:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:04,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-12-20 19:54:04,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:04,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-20 19:54:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:04,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-12-20 19:54:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:04,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-12-20 19:54:04,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:04,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-20 19:54:04,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:04,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-12-20 19:54:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:04,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-12-20 19:54:04,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:54:04,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481187941] [2023-12-20 19:54:04,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481187941] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:54:04,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:54:04,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-12-20 19:54:04,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304142476] [2023-12-20 19:54:04,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:54:04,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-20 19:54:04,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:54:04,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-20 19:54:04,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2023-12-20 19:54:04,942 INFO L87 Difference]: Start difference. First operand 603 states and 855 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2023-12-20 19:54:08,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:54:08,929 INFO L93 Difference]: Finished difference Result 1168 states and 1638 transitions. [2023-12-20 19:54:08,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-20 19:54:08,929 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 206 [2023-12-20 19:54:08,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:54:08,947 INFO L225 Difference]: With dead ends: 1168 [2023-12-20 19:54:08,947 INFO L226 Difference]: Without dead ends: 792 [2023-12-20 19:54:08,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=383, Invalid=1023, Unknown=0, NotChecked=0, Total=1406 [2023-12-20 19:54:08,948 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 278 mSDsluCounter, 926 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-20 19:54:08,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 1081 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-20 19:54:08,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2023-12-20 19:54:08,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 601. [2023-12-20 19:54:09,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 406 states have (on average 1.251231527093596) internal successors, (508), 409 states have internal predecessors, (508), 172 states have call successors, (172), 22 states have call predecessors, (172), 22 states have return successors, (172), 169 states have call predecessors, (172), 172 states have call successors, (172) [2023-12-20 19:54:09,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 852 transitions. [2023-12-20 19:54:09,003 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 852 transitions. Word has length 206 [2023-12-20 19:54:09,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:54:09,004 INFO L495 AbstractCegarLoop]: Abstraction has 601 states and 852 transitions. [2023-12-20 19:54:09,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2023-12-20 19:54:09,004 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 852 transitions. [2023-12-20 19:54:09,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2023-12-20 19:54:09,005 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:54:09,005 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:09,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-20 19:54:09,005 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:54:09,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:54:09,005 INFO L85 PathProgramCache]: Analyzing trace with hash -150222543, now seen corresponding path program 1 times [2023-12-20 19:54:09,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:54:09,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331373612] [2023-12-20 19:54:09,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:54:09,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:54:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:11,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:54:11,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:11,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 19:54:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:11,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 19:54:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:11,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 19:54:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:11,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 19:54:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:11,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 19:54:11,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:11,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 19:54:11,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:11,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 19:54:11,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:11,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 19:54:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:11,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 19:54:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:11,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 19:54:11,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:11,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 19:54:11,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:11,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 19:54:11,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:11,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 19:54:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:11,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 19:54:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:11,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 19:54:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:11,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 19:54:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:11,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 19:54:11,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:11,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 19:54:11,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:11,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 19:54:11,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:11,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 19:54:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:11,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-20 19:54:11,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:11,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-20 19:54:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:11,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-20 19:54:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:11,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-20 19:54:11,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:11,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-20 19:54:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:11,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-12-20 19:54:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:11,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-20 19:54:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:11,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-12-20 19:54:11,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:11,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-12-20 19:54:11,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:11,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-20 19:54:11,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:11,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-12-20 19:54:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:11,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-12-20 19:54:11,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:54:11,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331373612] [2023-12-20 19:54:11,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331373612] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:54:11,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:54:11,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-20 19:54:11,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352211486] [2023-12-20 19:54:11,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:54:11,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-20 19:54:11,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:54:11,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-20 19:54:11,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-12-20 19:54:11,325 INFO L87 Difference]: Start difference. First operand 601 states and 852 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-12-20 19:54:12,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:54:12,534 INFO L93 Difference]: Finished difference Result 930 states and 1325 transitions. [2023-12-20 19:54:12,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-20 19:54:12,534 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 207 [2023-12-20 19:54:12,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:54:12,548 INFO L225 Difference]: With dead ends: 930 [2023-12-20 19:54:12,548 INFO L226 Difference]: Without dead ends: 815 [2023-12-20 19:54:12,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2023-12-20 19:54:12,550 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 199 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-20 19:54:12,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 1001 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-20 19:54:12,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2023-12-20 19:54:12,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 770. [2023-12-20 19:54:12,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 549 states have (on average 1.2914389799635702) internal successors, (709), 556 states have internal predecessors, (709), 194 states have call successors, (194), 26 states have call predecessors, (194), 26 states have return successors, (194), 187 states have call predecessors, (194), 194 states have call successors, (194) [2023-12-20 19:54:12,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1097 transitions. [2023-12-20 19:54:12,651 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1097 transitions. Word has length 207 [2023-12-20 19:54:12,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:54:12,652 INFO L495 AbstractCegarLoop]: Abstraction has 770 states and 1097 transitions. [2023-12-20 19:54:12,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-12-20 19:54:12,652 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1097 transitions. [2023-12-20 19:54:12,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2023-12-20 19:54:12,653 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:54:12,653 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:12,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-20 19:54:12,653 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:54:12,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:54:12,653 INFO L85 PathProgramCache]: Analyzing trace with hash -148375501, now seen corresponding path program 1 times [2023-12-20 19:54:12,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:54:12,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8393171] [2023-12-20 19:54:12,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:54:12,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:54:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:13,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:54:13,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:13,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 19:54:13,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:13,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 19:54:13,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:13,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 19:54:13,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:13,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 19:54:13,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:13,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 19:54:13,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:13,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 19:54:13,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:13,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 19:54:13,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:13,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 19:54:13,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:13,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 19:54:13,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:13,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 19:54:13,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:13,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 19:54:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:13,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 19:54:13,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:13,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 19:54:13,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:13,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 19:54:13,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:13,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 19:54:13,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:13,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 19:54:13,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:13,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 19:54:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:13,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 19:54:13,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:13,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 19:54:13,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:13,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 19:54:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:13,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-20 19:54:13,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:13,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-20 19:54:13,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:13,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-20 19:54:13,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:13,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-20 19:54:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:13,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-20 19:54:13,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:13,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-12-20 19:54:13,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:13,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-20 19:54:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:13,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-12-20 19:54:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:13,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-12-20 19:54:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:13,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-20 19:54:13,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:13,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-12-20 19:54:13,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:13,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 102 proven. 303 refuted. 0 times theorem prover too weak. 1579 trivial. 0 not checked. [2023-12-20 19:54:13,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:54:13,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8393171] [2023-12-20 19:54:13,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8393171] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 19:54:13,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235200354] [2023-12-20 19:54:13,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:54:13,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 19:54:13,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 19:54:13,484 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 19:54:13,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-20 19:54:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:13,658 INFO L262 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-20 19:54:13,668 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 19:54:14,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1133 proven. 237 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2023-12-20 19:54:14,646 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 19:54:15,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 102 proven. 168 refuted. 0 times theorem prover too weak. 1714 trivial. 0 not checked. [2023-12-20 19:54:15,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235200354] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 19:54:15,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 19:54:15,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 17] total 42 [2023-12-20 19:54:15,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396332155] [2023-12-20 19:54:15,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 19:54:15,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-12-20 19:54:15,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:54:15,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-12-20 19:54:15,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1508, Unknown=0, NotChecked=0, Total=1722 [2023-12-20 19:54:15,659 INFO L87 Difference]: Start difference. First operand 770 states and 1097 transitions. Second operand has 42 states, 41 states have (on average 3.5365853658536586) internal successors, (145), 40 states have internal predecessors, (145), 12 states have call successors, (84), 4 states have call predecessors, (84), 9 states have return successors, (87), 12 states have call predecessors, (87), 12 states have call successors, (87) [2023-12-20 19:54:26,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:54:26,582 INFO L93 Difference]: Finished difference Result 2095 states and 2729 transitions. [2023-12-20 19:54:26,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2023-12-20 19:54:26,603 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 3.5365853658536586) internal successors, (145), 40 states have internal predecessors, (145), 12 states have call successors, (84), 4 states have call predecessors, (84), 9 states have return successors, (87), 12 states have call predecessors, (87), 12 states have call successors, (87) Word has length 207 [2023-12-20 19:54:26,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:54:26,609 INFO L225 Difference]: With dead ends: 2095 [2023-12-20 19:54:26,609 INFO L226 Difference]: Without dead ends: 1554 [2023-12-20 19:54:26,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 651 GetRequests, 457 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12806 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=6223, Invalid=31997, Unknown=0, NotChecked=0, Total=38220 [2023-12-20 19:54:26,620 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 3159 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 2150 mSolverCounterSat, 647 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3161 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 2797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 647 IncrementalHoareTripleChecker+Valid, 2150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-20 19:54:26,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3161 Valid, 1072 Invalid, 2797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [647 Valid, 2150 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-12-20 19:54:26,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2023-12-20 19:54:26,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 797. [2023-12-20 19:54:26,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 579 states have (on average 1.238341968911917) internal successors, (717), 581 states have internal predecessors, (717), 166 states have call successors, (166), 51 states have call predecessors, (166), 51 states have return successors, (166), 164 states have call predecessors, (166), 166 states have call successors, (166) [2023-12-20 19:54:26,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1049 transitions. [2023-12-20 19:54:26,710 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1049 transitions. Word has length 207 [2023-12-20 19:54:26,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:54:26,710 INFO L495 AbstractCegarLoop]: Abstraction has 797 states and 1049 transitions. [2023-12-20 19:54:26,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 3.5365853658536586) internal successors, (145), 40 states have internal predecessors, (145), 12 states have call successors, (84), 4 states have call predecessors, (84), 9 states have return successors, (87), 12 states have call predecessors, (87), 12 states have call successors, (87) [2023-12-20 19:54:26,710 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1049 transitions. [2023-12-20 19:54:26,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2023-12-20 19:54:26,711 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:54:26,711 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:26,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-20 19:54:26,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 19:54:26,921 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:54:26,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:54:26,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1081927729, now seen corresponding path program 1 times [2023-12-20 19:54:26,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:54:26,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984760372] [2023-12-20 19:54:26,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:54:26,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:54:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:28,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 19:54:28,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:28,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 19:54:28,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:28,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 19:54:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:28,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 19:54:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:28,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 19:54:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:28,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 19:54:28,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:28,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 19:54:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:28,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 19:54:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:28,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 19:54:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:28,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 19:54:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:28,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 19:54:28,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:28,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 19:54:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:28,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 19:54:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:28,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 19:54:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:28,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 19:54:28,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:28,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 19:54:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:28,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 19:54:28,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:28,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 19:54:28,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:28,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-20 19:54:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:28,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 19:54:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:28,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 19:54:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:28,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-20 19:54:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:28,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-20 19:54:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:28,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-12-20 19:54:28,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:28,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-20 19:54:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:28,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-20 19:54:28,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:28,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-12-20 19:54:28,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:28,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-20 19:54:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:28,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-12-20 19:54:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:28,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-12-20 19:54:28,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:28,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-20 19:54:28,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:28,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-12-20 19:54:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 19:54:28,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-12-20 19:54:28,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 19:54:28,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984760372] [2023-12-20 19:54:28,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984760372] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 19:54:28,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 19:54:28,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-20 19:54:28,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708023583] [2023-12-20 19:54:28,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 19:54:28,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-20 19:54:28,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 19:54:28,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-20 19:54:28,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-20 19:54:28,299 INFO L87 Difference]: Start difference. First operand 797 states and 1049 transitions. Second operand has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-12-20 19:54:29,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 19:54:29,152 INFO L93 Difference]: Finished difference Result 1303 states and 1683 transitions. [2023-12-20 19:54:29,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-20 19:54:29,153 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 207 [2023-12-20 19:54:29,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 19:54:29,157 INFO L225 Difference]: With dead ends: 1303 [2023-12-20 19:54:29,157 INFO L226 Difference]: Without dead ends: 1301 [2023-12-20 19:54:29,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2023-12-20 19:54:29,157 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 162 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-20 19:54:29,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 1090 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-20 19:54:29,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2023-12-20 19:54:29,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 836. [2023-12-20 19:54:29,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 618 states have (on average 1.2572815533980584) internal successors, (777), 620 states have internal predecessors, (777), 166 states have call successors, (166), 51 states have call predecessors, (166), 51 states have return successors, (166), 164 states have call predecessors, (166), 166 states have call successors, (166) [2023-12-20 19:54:29,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1109 transitions. [2023-12-20 19:54:29,246 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1109 transitions. Word has length 207 [2023-12-20 19:54:29,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 19:54:29,247 INFO L495 AbstractCegarLoop]: Abstraction has 836 states and 1109 transitions. [2023-12-20 19:54:29,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-12-20 19:54:29,247 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1109 transitions. [2023-12-20 19:54:29,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2023-12-20 19:54:29,248 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 19:54:29,248 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:29,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-20 19:54:29,248 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 19:54:29,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 19:54:29,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1083774771, now seen corresponding path program 1 times [2023-12-20 19:54:29,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 19:54:29,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650240775] [2023-12-20 19:54:29,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 19:54:29,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 19:54:29,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 19:54:29,297 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-20 19:54:29,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 19:54:29,415 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-20 19:54:29,415 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-20 19:54:29,417 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-20 19:54:29,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-20 19:54:29,420 INFO L445 BasicCegarLoop]: Path program histogram: [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:54:29,423 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 19:54:29,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 07:54:29 BoogieIcfgContainer [2023-12-20 19:54:29,524 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 19:54:29,527 INFO L158 Benchmark]: Toolchain (without parser) took 839614.75ms. Allocated memory was 261.1MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 210.4MB in the beginning and 603.9MB in the end (delta: -393.6MB). Peak memory consumption was 620.0MB. Max. memory is 8.0GB. [2023-12-20 19:54:29,527 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 208.7MB. Free memory is still 153.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 19:54:29,527 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.52ms. Allocated memory is still 261.1MB. Free memory was 209.8MB in the beginning and 194.2MB in the end (delta: 15.6MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-20 19:54:29,528 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.88ms. Allocated memory is still 261.1MB. Free memory was 194.2MB in the beginning and 189.0MB in the end (delta: 5.3MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-20 19:54:29,528 INFO L158 Benchmark]: Boogie Preprocessor took 74.05ms. Allocated memory is still 261.1MB. Free memory was 189.0MB in the beginning and 181.1MB in the end (delta: 7.8MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2023-12-20 19:54:29,529 INFO L158 Benchmark]: RCFGBuilder took 415.18ms. Allocated memory is still 261.1MB. Free memory was 181.1MB in the beginning and 151.2MB in the end (delta: 29.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2023-12-20 19:54:29,530 INFO L158 Benchmark]: TraceAbstraction took 838815.27ms. Allocated memory was 261.1MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 150.7MB in the beginning and 603.9MB in the end (delta: -453.2MB). Peak memory consumption was 561.3MB. Max. memory is 8.0GB. [2023-12-20 19:54:29,532 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.09ms. Allocated memory is still 208.7MB. Free memory is still 153.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 226.52ms. Allocated memory is still 261.1MB. Free memory was 209.8MB in the beginning and 194.2MB in the end (delta: 15.6MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 79.88ms. Allocated memory is still 261.1MB. Free memory was 194.2MB in the beginning and 189.0MB in the end (delta: 5.3MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 74.05ms. Allocated memory is still 261.1MB. Free memory was 189.0MB in the beginning and 181.1MB in the end (delta: 7.8MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * RCFGBuilder took 415.18ms. Allocated memory is still 261.1MB. Free memory was 181.1MB in the beginning and 151.2MB in the end (delta: 29.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * TraceAbstraction took 838815.27ms. Allocated memory was 261.1MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 150.7MB in the beginning and 603.9MB in the end (delta: -453.2MB). Peak memory consumption was 561.3MB. 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 58, overapproximation of someUnaryDOUBLEoperation at line 40, overapproximation of someBinaryArithmeticDOUBLEoperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 171, overapproximation of bitwise operation at line 177. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 4; [L23] unsigned short int var_1_4 = 58792; [L24] unsigned short int var_1_5 = 8; [L25] unsigned short int var_1_6 = 64; [L26] unsigned short int var_1_7 = 16; [L27] unsigned char var_1_8 = 0; [L28] unsigned char var_1_9 = 1; [L29] signed short int var_1_10 = 1000; [L30] signed short int var_1_11 = 1; [L31] signed short int var_1_12 = -25; [L32] signed short int var_1_13 = 25; [L33] unsigned short int var_1_14 = 5; [L34] unsigned short int var_1_16 = 20511; [L35] unsigned long int var_1_17 = 50; [L36] unsigned short int var_1_18 = 10; [L37] unsigned short int var_1_19 = 2; [L38] float var_1_20 = 100000.5; [L39] float var_1_21 = 31.9; [L40] float var_1_22 = -0.6; [L41] unsigned char var_1_23 = 0; [L42] unsigned char var_1_24 = 200; [L43] unsigned char var_1_25 = 5; [L44] double var_1_26 = 1.75; [L45] double var_1_27 = 16.125; [L46] unsigned char var_1_28 = 1; [L47] unsigned char var_1_29 = 0; [L48] signed short int var_1_30 = 64; [L49] double var_1_31 = 8.5; [L50] double var_1_33 = 4.5; [L51] double var_1_34 = 1000000000.75; [L52] double var_1_36 = 0.0; [L53] double var_1_37 = 32.92; [L54] unsigned char last_1_var_1_8 = 0; [L181] isInitial = 1 [L182] FCALL initially() [L183] COND TRUE 1 [L184] CALL updateLastVariables() [L174] last_1_var_1_8 = var_1_8 [L184] RET updateLastVariables() [L185] CALL updateVariables() [L120] var_1_4 = __VERIFIER_nondet_ushort() [L121] CALL assume_abort_if_not(var_1_4 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=8, var_1_6=64, var_1_7=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=8, var_1_6=64, var_1_7=16, var_1_8=0, var_1_9=1] [L121] RET assume_abort_if_not(var_1_4 >= 49150) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=8, var_1_6=64, var_1_7=16, var_1_8=0, var_1_9=1] [L122] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=8, var_1_6=64, var_1_7=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=8, var_1_6=64, var_1_7=16, var_1_8=0, var_1_9=1] [L122] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=8, var_1_6=64, var_1_7=16, var_1_8=0, var_1_9=1] [L123] var_1_5 = __VERIFIER_nondet_ushort() [L124] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_6=64, var_1_7=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_6=64, var_1_7=16, var_1_8=0, var_1_9=1] [L124] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_6=64, var_1_7=16, var_1_8=0, var_1_9=1] [L125] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=64, var_1_7=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=64, var_1_7=16, var_1_8=0, var_1_9=1] [L125] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=64, var_1_7=16, var_1_8=0, var_1_9=1] [L126] var_1_6 = __VERIFIER_nondet_ushort() [L127] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_7=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_7=16, var_1_8=0, var_1_9=1] [L127] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_7=16, var_1_8=0, var_1_9=1] [L128] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=16, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=16, var_1_8=0, var_1_9=1] [L128] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=16, var_1_8=0, var_1_9=1] [L129] var_1_7 = __VERIFIER_nondet_ushort() [L130] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_8=0, var_1_9=1] [L130] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_8=0, var_1_9=1] [L131] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L131] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L132] var_1_9 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L133] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L134] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L134] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=1, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L135] var_1_11 = __VERIFIER_nondet_short() [L136] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L136] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L137] CALL assume_abort_if_not(var_1_11 <= 8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L137] RET assume_abort_if_not(var_1_11 <= 8191) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=-25, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L138] var_1_12 = __VERIFIER_nondet_short() [L139] CALL assume_abort_if_not(var_1_12 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L139] RET assume_abort_if_not(var_1_12 >= -16383) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L140] CALL assume_abort_if_not(var_1_12 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L140] RET assume_abort_if_not(var_1_12 <= 16383) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=25, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L141] var_1_13 = __VERIFIER_nondet_short() [L142] CALL assume_abort_if_not(var_1_13 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L142] RET assume_abort_if_not(var_1_13 >= -32767) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L143] CALL assume_abort_if_not(var_1_13 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L143] RET assume_abort_if_not(var_1_13 <= 32766) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=20511, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L144] var_1_16 = __VERIFIER_nondet_ushort() [L145] CALL assume_abort_if_not(var_1_16 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L145] RET assume_abort_if_not(var_1_16 >= 16383) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L146] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L146] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_20=200001/2, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L147] var_1_20 = __VERIFIER_nondet_float() [L148] CALL assume_abort_if_not((var_1_20 >= -922337.2036854776000e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854776000e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L148] RET assume_abort_if_not((var_1_20 >= -922337.2036854776000e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854776000e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_21=319/10, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L149] var_1_21 = __VERIFIER_nondet_float() [L150] CALL assume_abort_if_not((var_1_21 >= -922337.2036854776000e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L150] RET assume_abort_if_not((var_1_21 >= -922337.2036854776000e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L151] var_1_22 = __VERIFIER_nondet_float() [L152] CALL assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L152] RET assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_23=0, var_1_24=200, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L153] var_1_24 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_24 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_23=0, var_1_24=128, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_23=0, var_1_24=128, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L154] RET assume_abort_if_not(var_1_24 >= 127) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_23=0, var_1_24=128, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L155] CALL assume_abort_if_not(var_1_24 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_23=0, var_1_24=128, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_23=0, var_1_24=128, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L155] RET assume_abort_if_not(var_1_24 <= 254) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_23=0, var_1_24=128, var_1_25=5, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L156] var_1_25 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_23=0, var_1_24=128, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_23=0, var_1_24=128, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L157] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_23=0, var_1_24=128, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L158] CALL assume_abort_if_not(var_1_25 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_23=0, var_1_24=128, var_1_25=127, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_23=0, var_1_24=128, var_1_25=127, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L158] RET assume_abort_if_not(var_1_25 <= 127) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_23=0, var_1_24=128, var_1_25=127, var_1_26=7/4, var_1_27=129/8, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L159] var_1_27 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_27 >= -922337.2036854765600e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_23=0, var_1_24=128, var_1_25=127, var_1_26=7/4, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_23=0, var_1_24=128, var_1_25=127, var_1_26=7/4, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L160] RET assume_abort_if_not((var_1_27 >= -922337.2036854765600e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_23=0, var_1_24=128, var_1_25=127, var_1_26=7/4, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L161] var_1_29 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_23=0, var_1_24=128, var_1_25=127, var_1_26=7/4, var_1_28=1, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_23=0, var_1_24=128, var_1_25=127, var_1_26=7/4, var_1_28=1, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L162] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_23=0, var_1_24=128, var_1_25=127, var_1_26=7/4, var_1_28=1, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L163] CALL assume_abort_if_not(var_1_29 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_23=0, var_1_24=128, var_1_25=127, var_1_26=7/4, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_23=0, var_1_24=128, var_1_25=127, var_1_26=7/4, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L163] RET assume_abort_if_not(var_1_29 <= 0) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_23=0, var_1_24=128, var_1_25=127, var_1_26=7/4, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_33=9/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L164] var_1_33 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_33 >= 0.0F && 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_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_23=0, var_1_24=128, var_1_25=127, var_1_26=7/4, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_23=0, var_1_24=128, var_1_25=127, var_1_26=7/4, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L165] RET assume_abort_if_not((var_1_33 >= 0.0F && 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_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_23=0, var_1_24=128, var_1_25=127, var_1_26=7/4, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_34=4000000003/4, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L166] var_1_34 = __VERIFIER_nondet_double() [L167] CALL assume_abort_if_not((var_1_34 >= 0.0F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854765600e+12F && var_1_34 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_23=0, var_1_24=128, var_1_25=127, var_1_26=7/4, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_23=0, var_1_24=128, var_1_25=127, var_1_26=7/4, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L167] RET assume_abort_if_not((var_1_34 >= 0.0F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 9223372.036854765600e+12F && var_1_34 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_23=0, var_1_24=128, var_1_25=127, var_1_26=7/4, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_36=0, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L168] var_1_36 = __VERIFIER_nondet_double() [L169] CALL assume_abort_if_not((var_1_36 >= -922337.2036854765600e+13F && var_1_36 <= -1.0e-20F) || (var_1_36 <= -461168.6018427382800e+13F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_23=0, var_1_24=128, var_1_25=127, var_1_26=7/4, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_23=0, var_1_24=128, var_1_25=127, var_1_26=7/4, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L169] RET assume_abort_if_not((var_1_36 >= -922337.2036854765600e+13F && var_1_36 <= -1.0e-20F) || (var_1_36 <= -461168.6018427382800e+13F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_23=0, var_1_24=128, var_1_25=127, var_1_26=7/4, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_37=823/25, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L170] var_1_37 = __VERIFIER_nondet_double() [L171] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 4611686.018427382800e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_23=0, var_1_24=128, var_1_25=127, var_1_26=7/4, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_23=0, var_1_24=128, var_1_25=127, var_1_26=7/4, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L171] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 4611686.018427382800e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_23=0, var_1_24=128, var_1_25=127, var_1_26=7/4, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L185] RET updateVariables() [L186] CALL step() [L58] COND FALSE !(var_1_20 <= var_1_21) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_23=0, var_1_24=128, var_1_25=127, var_1_26=7/4, var_1_28=1, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L63] var_1_23 = (var_1_24 - var_1_25) [L64] var_1_26 = var_1_27 [L65] var_1_28 = var_1_29 VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_23=1, var_1_24=128, var_1_25=127, var_1_26=1000000005, var_1_27=1000000005, var_1_28=0, var_1_29=0, var_1_30=64, var_1_31=17/2, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L66] COND TRUE var_1_24 >= var_1_25 [L67] var_1_30 = (((((var_1_23 - 10)) > (var_1_25)) ? ((var_1_23 - 10)) : (var_1_25))) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_23=1, var_1_24=128, var_1_25=127, var_1_26=1000000005, var_1_27=1000000005, var_1_28=0, var_1_29=0, var_1_30=127, var_1_31=17/2, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L71] COND TRUE var_1_23 < var_1_19 [L72] var_1_31 = (((((var_1_33) > (var_1_34)) ? (var_1_33) : (var_1_34))) - (((((var_1_36) < 0 ) ? -(var_1_36) : (var_1_36))) - var_1_37)) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_23=1, var_1_24=128, var_1_25=127, var_1_26=1000000005, var_1_27=1000000005, var_1_28=0, var_1_29=0, var_1_30=127, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L76] unsigned short int stepLocal_1 = var_1_6; [L77] unsigned char stepLocal_0 = last_1_var_1_8; VAL [isInitial=1, last_1_var_1_8=0, stepLocal_0=0, stepLocal_1=8191, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_23=1, var_1_24=128, var_1_25=127, var_1_26=1000000005, var_1_27=1000000005, var_1_28=0, var_1_29=0, var_1_30=127, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L78] COND FALSE !(last_1_var_1_8 && stepLocal_0) VAL [isInitial=1, last_1_var_1_8=0, stepLocal_0=0, stepLocal_1=8191, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=4, var_1_23=1, var_1_24=128, var_1_25=127, var_1_26=1000000005, var_1_27=1000000005, var_1_28=0, var_1_29=0, var_1_30=127, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L81] COND TRUE ((((var_1_7) > (var_1_5)) ? (var_1_7) : (var_1_5))) < stepLocal_1 [L82] var_1_1 = var_1_5 VAL [isInitial=1, last_1_var_1_8=0, stepLocal_0=0, stepLocal_1=8191, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=1810, var_1_23=1, var_1_24=128, var_1_25=127, var_1_26=1000000005, var_1_27=1000000005, var_1_28=0, var_1_29=0, var_1_30=127, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=0, var_1_9=1] [L85] var_1_8 = (((var_1_7 >= var_1_5) && (var_1_4 >= var_1_1)) || var_1_9) VAL [isInitial=1, last_1_var_1_8=0, stepLocal_0=0, stepLocal_1=8191, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=5, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=1810, var_1_23=1, var_1_24=128, var_1_25=127, var_1_26=1000000005, var_1_27=1000000005, var_1_28=0, var_1_29=0, var_1_30=127, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=1, var_1_9=1] [L86] COND TRUE \read(var_1_8) [L87] var_1_14 = (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) - ((((var_1_5) > ((var_1_16 - var_1_11))) ? (var_1_5) : ((var_1_16 - var_1_11))))) VAL [isInitial=1, last_1_var_1_8=0, stepLocal_0=0, stepLocal_1=8191, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=32315, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=1810, var_1_23=1, var_1_24=128, var_1_25=127, var_1_26=1000000005, var_1_27=1000000005, var_1_28=0, var_1_29=0, var_1_30=127, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=1, var_1_9=1] [L89] EXPR var_1_16 << var_1_7 VAL [isInitial=1, last_1_var_1_8=0, stepLocal_0=0, stepLocal_1=8191, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=32315, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=1810, var_1_23=1, var_1_24=128, var_1_25=127, var_1_26=1000000005, var_1_27=1000000005, var_1_28=0, var_1_29=0, var_1_30=127, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=1, var_1_9=1] [L89] EXPR ((var_1_13) > ((var_1_16 << var_1_7))) ? (var_1_13) : ((var_1_16 << var_1_7)) VAL [isInitial=1, last_1_var_1_8=0, stepLocal_0=0, stepLocal_1=8191, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=32315, var_1_16=32767, var_1_17=50, var_1_18=10, var_1_19=2, var_1_1=1810, var_1_23=1, var_1_24=128, var_1_25=127, var_1_26=1000000005, var_1_27=1000000005, var_1_28=0, var_1_29=0, var_1_30=127, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=1, var_1_9=1] [L89] signed long int stepLocal_4 = (((var_1_13) > ((var_1_16 << var_1_7))) ? (var_1_13) : ((var_1_16 << var_1_7))); [L90] COND TRUE stepLocal_4 >= var_1_14 [L91] var_1_17 = var_1_11 VAL [isInitial=1, last_1_var_1_8=0, stepLocal_0=0, stepLocal_1=8191, stepLocal_4=32315, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=32315, var_1_16=32767, var_1_17=8191, var_1_18=10, var_1_19=2, var_1_1=1810, var_1_23=1, var_1_24=128, var_1_25=127, var_1_26=1000000005, var_1_27=1000000005, var_1_28=0, var_1_29=0, var_1_30=127, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=1, var_1_9=1] [L95] unsigned short int stepLocal_5 = var_1_5; VAL [isInitial=1, last_1_var_1_8=0, stepLocal_0=0, stepLocal_1=8191, stepLocal_4=32315, stepLocal_5=1810, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=32315, var_1_16=32767, var_1_17=8191, var_1_18=10, var_1_19=2, var_1_1=1810, var_1_23=1, var_1_24=128, var_1_25=127, var_1_26=1000000005, var_1_27=1000000005, var_1_28=0, var_1_29=0, var_1_30=127, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=1, var_1_9=1] [L96] COND FALSE !(stepLocal_5 == var_1_16) VAL [isInitial=1, last_1_var_1_8=0, stepLocal_0=0, stepLocal_1=8191, stepLocal_4=32315, stepLocal_5=1810, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=32315, var_1_16=32767, var_1_17=8191, var_1_18=10, var_1_19=2, var_1_1=1810, var_1_23=1, var_1_24=128, var_1_25=127, var_1_26=1000000005, var_1_27=1000000005, var_1_28=0, var_1_29=0, var_1_30=127, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=1, var_1_9=1] [L103] COND TRUE \read(var_1_9) [L104] var_1_18 = 200 VAL [isInitial=1, last_1_var_1_8=0, stepLocal_0=0, stepLocal_1=8191, stepLocal_4=32315, stepLocal_5=1810, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=32315, var_1_16=32767, var_1_17=8191, var_1_18=200, var_1_19=2, var_1_1=1810, var_1_23=1, var_1_24=128, var_1_25=127, var_1_26=1000000005, var_1_27=1000000005, var_1_28=0, var_1_29=0, var_1_30=127, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=1, var_1_9=1] [L107] unsigned char stepLocal_3 = var_1_9; [L108] unsigned long int stepLocal_2 = var_1_17; VAL [isInitial=1, last_1_var_1_8=0, stepLocal_0=0, stepLocal_1=8191, stepLocal_2=8191, stepLocal_3=1, stepLocal_4=32315, stepLocal_5=1810, var_1_10=1000, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=32315, var_1_16=32767, var_1_17=8191, var_1_18=200, var_1_19=2, var_1_1=1810, var_1_23=1, var_1_24=128, var_1_25=127, var_1_26=1000000005, var_1_27=1000000005, var_1_28=0, var_1_29=0, var_1_30=127, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=1, var_1_9=1] [L109] COND FALSE !(stepLocal_2 < var_1_6) [L116] var_1_10 = var_1_13 VAL [isInitial=1, last_1_var_1_8=0, stepLocal_0=0, stepLocal_1=8191, stepLocal_2=8191, stepLocal_3=1, stepLocal_4=32315, stepLocal_5=1810, var_1_10=32315, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=32315, var_1_16=32767, var_1_17=8191, var_1_18=200, var_1_19=2, var_1_1=1810, var_1_23=1, var_1_24=128, var_1_25=127, var_1_26=1000000005, var_1_27=1000000005, var_1_28=0, var_1_29=0, var_1_30=127, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=1, var_1_9=1] [L186] RET step() [L187] CALL, EXPR property() [L177] EXPR (((((last_1_var_1_8 && last_1_var_1_8) ? (var_1_1 == ((unsigned short int) ((((((56892) < (var_1_4)) ? (56892) : (var_1_4))) - var_1_5) - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))))) : ((((((var_1_7) > (var_1_5)) ? (var_1_7) : (var_1_5))) < var_1_6) ? (var_1_1 == ((unsigned short int) var_1_5)) : 1)) && (var_1_8 == ((unsigned char) (((var_1_7 >= var_1_5) && (var_1_4 >= var_1_1)) || var_1_9)))) && ((var_1_17 < var_1_6) ? (((var_1_6 != var_1_5) || var_1_9) ? (var_1_10 == ((signed short int) (((10000 - var_1_11) - var_1_5) + ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))))) : (var_1_10 == ((signed short int) var_1_4))) : (var_1_10 == ((signed short int) var_1_13)))) && (var_1_8 ? (var_1_14 == ((unsigned short int) (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) - ((((var_1_5) > ((var_1_16 - var_1_11))) ? (var_1_5) : ((var_1_16 - var_1_11))))))) : 1)) && ((((((var_1_13) > ((var_1_16 << var_1_7))) ? (var_1_13) : ((var_1_16 << var_1_7)))) >= var_1_14) ? (var_1_17 == ((unsigned long int) var_1_11)) : (var_1_17 == ((unsigned long int) (var_1_6 + var_1_5)))) [L177] EXPR var_1_16 << var_1_7 VAL [isInitial=1, last_1_var_1_8=0, var_1_10=32315, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=32315, var_1_16=32767, var_1_17=8191, var_1_18=200, var_1_19=2, var_1_1=1810, var_1_23=1, var_1_24=128, var_1_25=127, var_1_26=1000000005, var_1_27=1000000005, var_1_28=0, var_1_29=0, var_1_30=127, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=1, var_1_9=1] [L177] EXPR ((var_1_13) > ((var_1_16 << var_1_7))) ? (var_1_13) : ((var_1_16 << var_1_7)) [L177] EXPR var_1_16 << var_1_7 [L177] EXPR ((var_1_13) > ((var_1_16 << var_1_7))) ? (var_1_13) : ((var_1_16 << var_1_7)) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=32315, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=32315, var_1_16=32767, var_1_17=8191, var_1_18=200, var_1_19=2, var_1_1=1810, var_1_23=1, var_1_24=128, var_1_25=127, var_1_26=1000000005, var_1_27=1000000005, var_1_28=0, var_1_29=0, var_1_30=127, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=1, var_1_9=1] [L177] EXPR (((((last_1_var_1_8 && last_1_var_1_8) ? (var_1_1 == ((unsigned short int) ((((((56892) < (var_1_4)) ? (56892) : (var_1_4))) - var_1_5) - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))))) : ((((((var_1_7) > (var_1_5)) ? (var_1_7) : (var_1_5))) < var_1_6) ? (var_1_1 == ((unsigned short int) var_1_5)) : 1)) && (var_1_8 == ((unsigned char) (((var_1_7 >= var_1_5) && (var_1_4 >= var_1_1)) || var_1_9)))) && ((var_1_17 < var_1_6) ? (((var_1_6 != var_1_5) || var_1_9) ? (var_1_10 == ((signed short int) (((10000 - var_1_11) - var_1_5) + ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))))) : (var_1_10 == ((signed short int) var_1_4))) : (var_1_10 == ((signed short int) var_1_13)))) && (var_1_8 ? (var_1_14 == ((unsigned short int) (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) - ((((var_1_5) > ((var_1_16 - var_1_11))) ? (var_1_5) : ((var_1_16 - var_1_11))))))) : 1)) && ((((((var_1_13) > ((var_1_16 << var_1_7))) ? (var_1_13) : ((var_1_16 << var_1_7)))) >= var_1_14) ? (var_1_17 == ((unsigned long int) var_1_11)) : (var_1_17 == ((unsigned long int) (var_1_6 + var_1_5)))) VAL [isInitial=1, last_1_var_1_8=0, var_1_10=32315, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=32315, var_1_16=32767, var_1_17=8191, var_1_18=200, var_1_19=2, var_1_1=1810, var_1_23=1, var_1_24=128, var_1_25=127, var_1_26=1000000005, var_1_27=1000000005, var_1_28=0, var_1_29=0, var_1_30=127, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=1, var_1_9=1] [L177-L178] return ((((((last_1_var_1_8 && last_1_var_1_8) ? (var_1_1 == ((unsigned short int) ((((((56892) < (var_1_4)) ? (56892) : (var_1_4))) - var_1_5) - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))))) : ((((((var_1_7) > (var_1_5)) ? (var_1_7) : (var_1_5))) < var_1_6) ? (var_1_1 == ((unsigned short int) var_1_5)) : 1)) && (var_1_8 == ((unsigned char) (((var_1_7 >= var_1_5) && (var_1_4 >= var_1_1)) || var_1_9)))) && ((var_1_17 < var_1_6) ? (((var_1_6 != var_1_5) || var_1_9) ? (var_1_10 == ((signed short int) (((10000 - var_1_11) - var_1_5) + ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))))) : (var_1_10 == ((signed short int) var_1_4))) : (var_1_10 == ((signed short int) var_1_13)))) && (var_1_8 ? (var_1_14 == ((unsigned short int) (((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) - ((((var_1_5) > ((var_1_16 - var_1_11))) ? (var_1_5) : ((var_1_16 - var_1_11))))))) : 1)) && ((((((var_1_13) > ((var_1_16 << var_1_7))) ? (var_1_13) : ((var_1_16 << var_1_7)))) >= var_1_14) ? (var_1_17 == ((unsigned long int) var_1_11)) : (var_1_17 == ((unsigned long int) (var_1_6 + var_1_5))))) && ((var_1_5 == var_1_16) ? (var_1_8 ? (var_1_18 == ((unsigned short int) (((((var_1_16 + 30393) - var_1_5) < 0 ) ? -((var_1_16 + 30393) - var_1_5) : ((var_1_16 + 30393) - var_1_5))))) : (var_1_18 == ((unsigned short int) var_1_4))) : (var_1_9 ? (var_1_18 == ((unsigned short int) 200)) : 1)) ; [L187] RET, EXPR property() [L187] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_8=0, var_1_10=32315, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=32315, var_1_16=32767, var_1_17=8191, var_1_18=200, var_1_19=2, var_1_1=1810, var_1_23=1, var_1_24=128, var_1_25=127, var_1_26=1000000005, var_1_27=1000000005, var_1_28=0, var_1_29=0, var_1_30=127, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_8=0, var_1_10=32315, var_1_11=8191, var_1_12=0, var_1_13=32315, var_1_14=32315, var_1_16=32767, var_1_17=8191, var_1_18=200, var_1_19=2, var_1_1=1810, var_1_23=1, var_1_24=128, var_1_25=127, var_1_26=1000000005, var_1_27=1000000005, var_1_28=0, var_1_29=0, var_1_30=127, var_1_4=56891, var_1_5=1810, var_1_6=8191, var_1_7=1810, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 838.7s, OverallIterations: 21, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 116.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 7957 SdHoareTripleChecker+Valid, 52.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7955 mSDsluCounter, 15964 SdHoareTripleChecker+Invalid, 50.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13228 mSDsCounter, 2478 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13881 IncrementalHoareTripleChecker+Invalid, 16365 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2478 mSolverCounterUnsat, 2736 mSDtfsCounter, 13881 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2454 GetRequests, 1835 SyntacticMatches, 2 SemanticMatches, 617 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14971 ImplicationChecksByTransitivity, 89.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=836occurred in iteration=20, InterpolantAutomatonStates: 502, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 20 MinimizatonAttempts, 2716 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 719.2s InterpolantComputationTime, 4524 NumberOfCodeBlocks, 4524 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 4502 ConstructedInterpolants, 0 QuantifiedInterpolants, 57249 SizeOfPredicates, 18 NumberOfNonLiveVariables, 471 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 22 InterpolantComputations, 19 PerfectInterpolantSequences, 42940/43648 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:54:29,740 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-20 19:54:29,782 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 137 Received shutdown request...