/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 true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-81.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 11:46:30,078 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 11:46:30,145 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-19 11:46:30,149 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 11:46:30,149 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 11:46:30,163 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 11:46:30,164 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 11:46:30,164 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 11:46:30,164 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 11:46:30,165 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 11:46:30,165 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 11:46:30,165 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 11:46:30,165 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 11:46:30,166 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 11:46:30,166 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 11:46:30,166 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 11:46:30,166 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 11:46:30,166 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 11:46:30,167 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 11:46:30,167 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 11:46:30,167 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 11:46:30,180 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 11:46:30,180 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 11:46:30,180 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 11:46:30,181 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 11:46:30,181 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 11:46:30,181 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 11:46:30,181 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 11:46:30,182 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 11:46:30,182 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 11:46:30,182 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 11:46:30,182 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 11:46:30,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 11:46:30,183 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 11:46:30,183 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 11:46:30,183 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 11:46:30,183 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 11:46:30,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 11:46:30,183 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 11:46:30,184 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 11:46:30,184 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 11:46:30,184 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 11:46:30,184 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 11:46:30,184 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 -> true [2023-12-19 11:46:30,358 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 11:46:30,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 11:46:30,371 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 11:46:30,372 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 11:46:30,372 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 11:46:30,373 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-81.i [2023-12-19 11:46:31,410 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 11:46:31,547 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 11:46:31,547 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-81.i [2023-12-19 11:46:31,553 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87904cc72/1ca0f344903b478dbed42bb810dd34f4/FLAG54b3b9019 [2023-12-19 11:46:31,561 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87904cc72/1ca0f344903b478dbed42bb810dd34f4 [2023-12-19 11:46:31,563 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 11:46:31,564 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 11:46:31,565 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 11:46:31,565 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 11:46:31,568 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 11:46:31,568 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 11:46:31" (1/1) ... [2023-12-19 11:46:31,569 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61315c6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:46:31, skipping insertion in model container [2023-12-19 11:46:31,569 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 11:46:31" (1/1) ... [2023-12-19 11:46:31,584 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 11:46:31,678 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_loopvsstraightlinecode_25-1loop_file-81.i[915,928] [2023-12-19 11:46:31,702 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 11:46:31,713 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 11:46:31,720 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_loopvsstraightlinecode_25-1loop_file-81.i[915,928] [2023-12-19 11:46:31,733 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 11:46:31,743 INFO L206 MainTranslator]: Completed translation [2023-12-19 11:46:31,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:46:31 WrapperNode [2023-12-19 11:46:31,743 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 11:46:31,744 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 11:46:31,744 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 11:46:31,744 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 11:46:31,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:46:31" (1/1) ... [2023-12-19 11:46:31,753 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:46:31" (1/1) ... [2023-12-19 11:46:31,773 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 156 [2023-12-19 11:46:31,773 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 11:46:31,774 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 11:46:31,774 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 11:46:31,774 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 11:46:31,785 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:46:31" (1/1) ... [2023-12-19 11:46:31,785 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:46:31" (1/1) ... [2023-12-19 11:46:31,787 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:46:31" (1/1) ... [2023-12-19 11:46:31,804 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-19 11:46:31,804 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:46:31" (1/1) ... [2023-12-19 11:46:31,804 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:46:31" (1/1) ... [2023-12-19 11:46:31,808 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:46:31" (1/1) ... [2023-12-19 11:46:31,810 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:46:31" (1/1) ... [2023-12-19 11:46:31,814 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:46:31" (1/1) ... [2023-12-19 11:46:31,815 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:46:31" (1/1) ... [2023-12-19 11:46:31,833 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 11:46:31,833 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 11:46:31,833 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 11:46:31,833 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 11:46:31,834 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:46:31" (1/1) ... [2023-12-19 11:46:31,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 11:46:31,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 11:46:31,857 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-19 11:46:31,884 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-19 11:46:31,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 11:46:31,899 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 11:46:31,899 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 11:46:31,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 11:46:31,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 11:46:31,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 11:46:31,952 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 11:46:31,954 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 11:46:32,197 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 11:46:32,228 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 11:46:32,228 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 11:46:32,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 11:46:32 BoogieIcfgContainer [2023-12-19 11:46:32,228 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 11:46:32,230 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 11:46:32,230 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 11:46:32,232 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 11:46:32,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 11:46:31" (1/3) ... [2023-12-19 11:46:32,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7246cda8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 11:46:32, skipping insertion in model container [2023-12-19 11:46:32,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:46:31" (2/3) ... [2023-12-19 11:46:32,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7246cda8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 11:46:32, skipping insertion in model container [2023-12-19 11:46:32,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 11:46:32" (3/3) ... [2023-12-19 11:46:32,233 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-81.i [2023-12-19 11:46:32,245 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 11:46:32,246 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 11:46:32,281 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 11:46:32,285 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;@75ee3b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 11:46:32,285 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 11:46:32,288 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 38 states have (on average 1.5) internal successors, (57), 39 states have internal predecessors, (57), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-19 11:46:32,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-19 11:46:32,298 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:46:32,298 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:46:32,299 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:46:32,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:46:32,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1807602556, now seen corresponding path program 1 times [2023-12-19 11:46:32,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:46:32,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983884729] [2023-12-19 11:46:32,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:46:32,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:46:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:32,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:46:32,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:32,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:46:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:32,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:46:32,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:32,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 11:46:32,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:32,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 11:46:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:32,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-19 11:46:32,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:32,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 11:46:32,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:32,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 11:46:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:32,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 11:46:32,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:32,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 11:46:32,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:32,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 11:46:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:32,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 11:46:32,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:32,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-19 11:46:32,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:32,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-19 11:46:32,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:32,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-19 11:46:32,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:32,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 11:46:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:32,543 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 11:46:32,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:46:32,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983884729] [2023-12-19 11:46:32,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983884729] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:46:32,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:46:32,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 11:46:32,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599871860] [2023-12-19 11:46:32,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:46:32,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 11:46:32,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:46:32,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 11:46:32,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 11:46:32,569 INFO L87 Difference]: Start difference. First operand has 57 states, 38 states have (on average 1.5) internal successors, (57), 39 states have internal predecessors, (57), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-19 11:46:32,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:46:32,612 INFO L93 Difference]: Finished difference Result 113 states and 193 transitions. [2023-12-19 11:46:32,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 11:46:32,615 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 104 [2023-12-19 11:46:32,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:46:32,621 INFO L225 Difference]: With dead ends: 113 [2023-12-19 11:46:32,621 INFO L226 Difference]: Without dead ends: 55 [2023-12-19 11:46:32,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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-19 11:46:32,628 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 11:46:32,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 11:46:32,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-12-19 11:46:32,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-12-19 11:46:32,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 37 states have internal predecessors, (50), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-19 11:46:32,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 82 transitions. [2023-12-19 11:46:32,671 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 82 transitions. Word has length 104 [2023-12-19 11:46:32,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:46:32,671 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 82 transitions. [2023-12-19 11:46:32,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-19 11:46:32,672 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 82 transitions. [2023-12-19 11:46:32,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-19 11:46:32,676 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:46:32,676 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:46:32,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 11:46:32,677 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:46:32,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:46:32,677 INFO L85 PathProgramCache]: Analyzing trace with hash -575632252, now seen corresponding path program 1 times [2023-12-19 11:46:32,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:46:32,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798414257] [2023-12-19 11:46:32,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:46:32,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:46:32,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:46:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:46:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:46:33,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 11:46:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 11:46:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-19 11:46:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 11:46:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 11:46:33,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 11:46:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 11:46:33,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 11:46:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 11:46:33,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-19 11:46:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-19 11:46:33,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-19 11:46:33,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 11:46:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,295 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 11:46:33,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:46:33,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798414257] [2023-12-19 11:46:33,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798414257] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:46:33,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:46:33,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 11:46:33,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007998220] [2023-12-19 11:46:33,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:46:33,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 11:46:33,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:46:33,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 11:46:33,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 11:46:33,307 INFO L87 Difference]: Start difference. First operand 55 states and 82 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 11:46:33,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:46:33,473 INFO L93 Difference]: Finished difference Result 155 states and 230 transitions. [2023-12-19 11:46:33,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 11:46:33,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2023-12-19 11:46:33,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:46:33,474 INFO L225 Difference]: With dead ends: 155 [2023-12-19 11:46:33,475 INFO L226 Difference]: Without dead ends: 101 [2023-12-19 11:46:33,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 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-19 11:46:33,476 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 66 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 11:46:33,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 207 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 11:46:33,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-12-19 11:46:33,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2023-12-19 11:46:33,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 69 states have internal predecessors, (93), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-19 11:46:33,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 141 transitions. [2023-12-19 11:46:33,488 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 141 transitions. Word has length 104 [2023-12-19 11:46:33,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:46:33,488 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 141 transitions. [2023-12-19 11:46:33,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 11:46:33,489 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 141 transitions. [2023-12-19 11:46:33,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-19 11:46:33,490 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:46:33,490 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:46:33,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 11:46:33,490 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:46:33,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:46:33,490 INFO L85 PathProgramCache]: Analyzing trace with hash -317466814, now seen corresponding path program 1 times [2023-12-19 11:46:33,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:46:33,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348929876] [2023-12-19 11:46:33,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:46:33,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:46:33,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:46:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:46:33,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:46:33,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 11:46:33,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 11:46:33,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-19 11:46:33,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 11:46:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 11:46:33,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 11:46:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 11:46:33,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 11:46:33,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 11:46:33,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-19 11:46:33,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-19 11:46:33,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-19 11:46:33,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 11:46:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,601 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 11:46:33,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:46:33,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348929876] [2023-12-19 11:46:33,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348929876] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:46:33,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:46:33,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 11:46:33,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408947078] [2023-12-19 11:46:33,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:46:33,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 11:46:33,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:46:33,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 11:46:33,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 11:46:33,606 INFO L87 Difference]: Start difference. First operand 95 states and 141 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 11:46:33,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:46:33,665 INFO L93 Difference]: Finished difference Result 197 states and 294 transitions. [2023-12-19 11:46:33,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 11:46:33,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2023-12-19 11:46:33,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:46:33,670 INFO L225 Difference]: With dead ends: 197 [2023-12-19 11:46:33,670 INFO L226 Difference]: Without dead ends: 103 [2023-12-19 11:46:33,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 11:46:33,675 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 5 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 11:46:33,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 193 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 11:46:33,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-12-19 11:46:33,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 97. [2023-12-19 11:46:33,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 70 states have (on average 1.3571428571428572) internal successors, (95), 71 states have internal predecessors, (95), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-19 11:46:33,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 143 transitions. [2023-12-19 11:46:33,690 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 143 transitions. Word has length 104 [2023-12-19 11:46:33,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:46:33,690 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 143 transitions. [2023-12-19 11:46:33,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 11:46:33,690 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 143 transitions. [2023-12-19 11:46:33,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-19 11:46:33,695 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:46:33,695 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:46:33,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 11:46:33,695 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:46:33,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:46:33,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1256768779, now seen corresponding path program 1 times [2023-12-19 11:46:33,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:46:33,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363339644] [2023-12-19 11:46:33,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:46:33,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:46:33,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:46:33,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:46:33,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:46:33,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 11:46:33,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 11:46:33,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-19 11:46:33,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 11:46:33,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 11:46:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 11:46:33,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 11:46:33,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 11:46:33,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 11:46:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-19 11:46:33,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-19 11:46:33,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-19 11:46:33,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 11:46:33,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:33,842 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 11:46:33,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:46:33,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363339644] [2023-12-19 11:46:33,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363339644] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:46:33,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:46:33,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 11:46:33,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425867801] [2023-12-19 11:46:33,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:46:33,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 11:46:33,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:46:33,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 11:46:33,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 11:46:33,845 INFO L87 Difference]: Start difference. First operand 97 states and 143 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 11:46:33,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:46:33,965 INFO L93 Difference]: Finished difference Result 262 states and 385 transitions. [2023-12-19 11:46:33,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 11:46:33,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2023-12-19 11:46:33,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:46:33,969 INFO L225 Difference]: With dead ends: 262 [2023-12-19 11:46:33,969 INFO L226 Difference]: Without dead ends: 166 [2023-12-19 11:46:33,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 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-19 11:46:33,973 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 104 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 11:46:33,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 291 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 11:46:33,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-12-19 11:46:33,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 151. [2023-12-19 11:46:33,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 107 states have (on average 1.3457943925233644) internal successors, (144), 108 states have internal predecessors, (144), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-19 11:46:33,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 224 transitions. [2023-12-19 11:46:33,998 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 224 transitions. Word has length 105 [2023-12-19 11:46:33,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:46:33,998 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 224 transitions. [2023-12-19 11:46:33,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 11:46:33,998 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 224 transitions. [2023-12-19 11:46:33,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-19 11:46:33,999 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:46:33,999 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:46:33,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 11:46:34,000 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:46:34,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:46:34,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1843574793, now seen corresponding path program 1 times [2023-12-19 11:46:34,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:46:34,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282547373] [2023-12-19 11:46:34,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:46:34,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:46:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:34,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:46:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:34,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:46:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:34,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:46:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:34,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 11:46:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:34,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 11:46:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:34,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-19 11:46:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:34,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 11:46:34,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:34,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 11:46:34,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:34,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 11:46:34,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:34,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 11:46:34,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:34,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 11:46:34,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:34,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 11:46:34,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:34,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-19 11:46:34,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:34,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-19 11:46:34,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:34,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-19 11:46:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:34,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 11:46:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:34,247 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 39 proven. 6 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-12-19 11:46:34,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:46:34,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282547373] [2023-12-19 11:46:34,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282547373] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 11:46:34,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175759135] [2023-12-19 11:46:34,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:46:34,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 11:46:34,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 11:46:34,250 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-19 11:46:34,268 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-19 11:46:34,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:34,334 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-19 11:46:34,339 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 11:46:34,402 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 145 proven. 6 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2023-12-19 11:46:34,402 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 11:46:34,526 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 39 proven. 6 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-12-19 11:46:34,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175759135] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 11:46:34,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 11:46:34,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2023-12-19 11:46:34,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536869542] [2023-12-19 11:46:34,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 11:46:34,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 11:46:34,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:46:34,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 11:46:34,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-19 11:46:34,528 INFO L87 Difference]: Start difference. First operand 151 states and 224 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-19 11:46:34,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:46:34,783 INFO L93 Difference]: Finished difference Result 433 states and 626 transitions. [2023-12-19 11:46:34,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-19 11:46:34,784 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 105 [2023-12-19 11:46:34,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:46:34,785 INFO L225 Difference]: With dead ends: 433 [2023-12-19 11:46:34,785 INFO L226 Difference]: Without dead ends: 283 [2023-12-19 11:46:34,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 237 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2023-12-19 11:46:34,786 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 240 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 11:46:34,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 180 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 11:46:34,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2023-12-19 11:46:34,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 263. [2023-12-19 11:46:34,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 190 states have (on average 1.305263157894737) internal successors, (248), 192 states have internal predecessors, (248), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2023-12-19 11:46:34,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 376 transitions. [2023-12-19 11:46:34,811 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 376 transitions. Word has length 105 [2023-12-19 11:46:34,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:46:34,811 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 376 transitions. [2023-12-19 11:46:34,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-19 11:46:34,811 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 376 transitions. [2023-12-19 11:46:34,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-19 11:46:34,812 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:46:34,812 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:46:34,826 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-19 11:46:35,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 11:46:35,020 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:46:35,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:46:35,021 INFO L85 PathProgramCache]: Analyzing trace with hash -11309129, now seen corresponding path program 1 times [2023-12-19 11:46:35,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:46:35,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533003864] [2023-12-19 11:46:35,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:46:35,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:46:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:35,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:46:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:35,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:46:35,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:35,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:46:35,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:35,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 11:46:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:35,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 11:46:35,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:35,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-19 11:46:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:35,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 11:46:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:35,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 11:46:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:35,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 11:46:35,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:35,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 11:46:35,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:35,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 11:46:35,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:35,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 11:46:35,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:35,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-19 11:46:35,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:35,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-19 11:46:35,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:35,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-19 11:46:35,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:35,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 11:46:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:35,104 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 11:46:35,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:46:35,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533003864] [2023-12-19 11:46:35,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533003864] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:46:35,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:46:35,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 11:46:35,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948641637] [2023-12-19 11:46:35,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:46:35,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 11:46:35,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:46:35,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 11:46:35,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 11:46:35,106 INFO L87 Difference]: Start difference. First operand 263 states and 376 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 11:46:35,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:46:35,171 INFO L93 Difference]: Finished difference Result 555 states and 791 transitions. [2023-12-19 11:46:35,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 11:46:35,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2023-12-19 11:46:35,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:46:35,173 INFO L225 Difference]: With dead ends: 555 [2023-12-19 11:46:35,173 INFO L226 Difference]: Without dead ends: 293 [2023-12-19 11:46:35,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-19 11:46:35,174 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 84 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 11:46:35,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 229 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 11:46:35,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2023-12-19 11:46:35,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 263. [2023-12-19 11:46:35,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 190 states have (on average 1.2894736842105263) internal successors, (245), 192 states have internal predecessors, (245), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2023-12-19 11:46:35,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 373 transitions. [2023-12-19 11:46:35,197 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 373 transitions. Word has length 105 [2023-12-19 11:46:35,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:46:35,197 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 373 transitions. [2023-12-19 11:46:35,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 11:46:35,198 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 373 transitions. [2023-12-19 11:46:35,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-19 11:46:35,198 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:46:35,198 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:46:35,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 11:46:35,198 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:46:35,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:46:35,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1393246940, now seen corresponding path program 1 times [2023-12-19 11:46:35,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:46:35,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117752565] [2023-12-19 11:46:35,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:46:35,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:46:35,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:38,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:46:38,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:38,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:46:38,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:38,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:46:38,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:38,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 11:46:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:38,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 11:46:38,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:38,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-19 11:46:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:38,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 11:46:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:38,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 11:46:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:38,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 11:46:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:38,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 11:46:38,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:38,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 11:46:38,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:38,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 11:46:38,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:38,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-19 11:46:38,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:38,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-19 11:46:38,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:38,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-19 11:46:38,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:38,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 11:46:38,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:38,883 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 11:46:38,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:46:38,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117752565] [2023-12-19 11:46:38,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117752565] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:46:38,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:46:38,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-19 11:46:38,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271563188] [2023-12-19 11:46:38,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:46:38,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-19 11:46:38,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:46:38,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-19 11:46:38,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-12-19 11:46:38,885 INFO L87 Difference]: Start difference. First operand 263 states and 373 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 11:46:40,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:46:40,121 INFO L93 Difference]: Finished difference Result 367 states and 497 transitions. [2023-12-19 11:46:40,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-19 11:46:40,121 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2023-12-19 11:46:40,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:46:40,123 INFO L225 Difference]: With dead ends: 367 [2023-12-19 11:46:40,123 INFO L226 Difference]: Without dead ends: 365 [2023-12-19 11:46:40,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=210, Invalid=492, Unknown=0, NotChecked=0, Total=702 [2023-12-19 11:46:40,124 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 244 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 11:46:40,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 447 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 11:46:40,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2023-12-19 11:46:40,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 292. [2023-12-19 11:46:40,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 212 states have (on average 1.278301886792453) internal successors, (271), 215 states have internal predecessors, (271), 70 states have call successors, (70), 9 states have call predecessors, (70), 9 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2023-12-19 11:46:40,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 411 transitions. [2023-12-19 11:46:40,143 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 411 transitions. Word has length 107 [2023-12-19 11:46:40,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:46:40,143 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 411 transitions. [2023-12-19 11:46:40,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 11:46:40,143 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 411 transitions. [2023-12-19 11:46:40,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-19 11:46:40,144 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:46:40,144 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:46:40,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-19 11:46:40,145 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:46:40,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:46:40,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1715703058, now seen corresponding path program 1 times [2023-12-19 11:46:40,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:46:40,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403028063] [2023-12-19 11:46:40,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:46:40,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:46:40,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:46:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:46:40,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:46:40,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 11:46:40,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 11:46:40,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-19 11:46:40,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 11:46:40,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 11:46:40,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 11:46:40,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 11:46:40,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 11:46:40,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 11:46:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-19 11:46:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-19 11:46:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-19 11:46:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 11:46:40,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,310 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 11:46:40,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:46:40,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403028063] [2023-12-19 11:46:40,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403028063] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:46:40,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:46:40,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 11:46:40,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767997861] [2023-12-19 11:46:40,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:46:40,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 11:46:40,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:46:40,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 11:46:40,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 11:46:40,311 INFO L87 Difference]: Start difference. First operand 292 states and 411 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 11:46:40,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:46:40,439 INFO L93 Difference]: Finished difference Result 800 states and 1124 transitions. [2023-12-19 11:46:40,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 11:46:40,439 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2023-12-19 11:46:40,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:46:40,442 INFO L225 Difference]: With dead ends: 800 [2023-12-19 11:46:40,442 INFO L226 Difference]: Without dead ends: 520 [2023-12-19 11:46:40,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 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-19 11:46:40,444 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 88 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 11:46:40,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 254 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 11:46:40,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2023-12-19 11:46:40,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 388. [2023-12-19 11:46:40,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 289 states have (on average 1.2387543252595157) internal successors, (358), 293 states have internal predecessors, (358), 86 states have call successors, (86), 12 states have call predecessors, (86), 12 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) [2023-12-19 11:46:40,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 530 transitions. [2023-12-19 11:46:40,480 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 530 transitions. Word has length 107 [2023-12-19 11:46:40,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:46:40,480 INFO L495 AbstractCegarLoop]: Abstraction has 388 states and 530 transitions. [2023-12-19 11:46:40,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 11:46:40,480 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 530 transitions. [2023-12-19 11:46:40,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-19 11:46:40,481 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:46:40,481 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:46:40,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-19 11:46:40,481 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:46:40,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:46:40,482 INFO L85 PathProgramCache]: Analyzing trace with hash 317189482, now seen corresponding path program 1 times [2023-12-19 11:46:40,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:46:40,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420857702] [2023-12-19 11:46:40,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:46:40,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:46:40,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:46:40,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:46:40,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:46:40,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 11:46:40,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 11:46:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-19 11:46:40,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 11:46:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 11:46:40,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 11:46:40,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 11:46:40,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 11:46:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 11:46:40,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-19 11:46:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-19 11:46:40,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-19 11:46:40,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 11:46:40,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,527 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 11:46:40,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:46:40,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420857702] [2023-12-19 11:46:40,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420857702] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:46:40,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:46:40,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 11:46:40,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129462587] [2023-12-19 11:46:40,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:46:40,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 11:46:40,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:46:40,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 11:46:40,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 11:46:40,529 INFO L87 Difference]: Start difference. First operand 388 states and 530 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 11:46:40,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:46:40,592 INFO L93 Difference]: Finished difference Result 962 states and 1312 transitions. [2023-12-19 11:46:40,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 11:46:40,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 108 [2023-12-19 11:46:40,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:46:40,596 INFO L225 Difference]: With dead ends: 962 [2023-12-19 11:46:40,597 INFO L226 Difference]: Without dead ends: 586 [2023-12-19 11:46:40,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 11:46:40,599 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 59 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 11:46:40,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 139 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 11:46:40,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2023-12-19 11:46:40,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 375. [2023-12-19 11:46:40,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 276 states have (on average 1.1920289855072463) internal successors, (329), 280 states have internal predecessors, (329), 86 states have call successors, (86), 12 states have call predecessors, (86), 12 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) [2023-12-19 11:46:40,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 501 transitions. [2023-12-19 11:46:40,654 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 501 transitions. Word has length 108 [2023-12-19 11:46:40,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:46:40,654 INFO L495 AbstractCegarLoop]: Abstraction has 375 states and 501 transitions. [2023-12-19 11:46:40,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 11:46:40,655 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 501 transitions. [2023-12-19 11:46:40,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-19 11:46:40,655 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:46:40,655 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:46:40,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-19 11:46:40,655 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:46:40,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:46:40,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1062082448, now seen corresponding path program 1 times [2023-12-19 11:46:40,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:46:40,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778294469] [2023-12-19 11:46:40,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:46:40,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:46:40,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:46:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:46:40,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:46:40,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 11:46:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 11:46:40,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-19 11:46:40,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 11:46:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 11:46:40,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 11:46:40,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 11:46:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 11:46:40,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 11:46:40,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-19 11:46:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-19 11:46:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-19 11:46:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 11:46:40,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:40,735 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 11:46:40,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:46:40,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778294469] [2023-12-19 11:46:40,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778294469] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:46:40,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:46:40,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 11:46:40,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782587537] [2023-12-19 11:46:40,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:46:40,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 11:46:40,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:46:40,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 11:46:40,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 11:46:40,737 INFO L87 Difference]: Start difference. First operand 375 states and 501 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 11:46:40,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:46:40,851 INFO L93 Difference]: Finished difference Result 765 states and 1033 transitions. [2023-12-19 11:46:40,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 11:46:40,851 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 108 [2023-12-19 11:46:40,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:46:40,853 INFO L225 Difference]: With dead ends: 765 [2023-12-19 11:46:40,853 INFO L226 Difference]: Without dead ends: 545 [2023-12-19 11:46:40,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 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-19 11:46:40,854 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 67 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 11:46:40,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 191 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 11:46:40,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2023-12-19 11:46:40,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 375. [2023-12-19 11:46:40,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 276 states have (on average 1.1666666666666667) internal successors, (322), 280 states have internal predecessors, (322), 86 states have call successors, (86), 12 states have call predecessors, (86), 12 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) [2023-12-19 11:46:40,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 494 transitions. [2023-12-19 11:46:40,889 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 494 transitions. Word has length 108 [2023-12-19 11:46:40,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:46:40,889 INFO L495 AbstractCegarLoop]: Abstraction has 375 states and 494 transitions. [2023-12-19 11:46:40,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 11:46:40,890 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 494 transitions. [2023-12-19 11:46:40,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-19 11:46:40,890 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:46:40,890 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:46:40,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-19 11:46:40,890 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:46:40,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:46:40,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1812858892, now seen corresponding path program 1 times [2023-12-19 11:46:40,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:46:40,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757252467] [2023-12-19 11:46:40,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:46:40,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:46:40,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:42,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 11:46:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:42,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 11:46:42,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:42,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 11:46:42,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:42,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 11:46:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:42,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 11:46:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:42,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-19 11:46:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:42,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 11:46:42,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:42,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 11:46:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:42,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 11:46:42,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:42,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 11:46:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:42,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 11:46:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:42,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 11:46:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:42,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-19 11:46:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:42,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-19 11:46:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:42,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-19 11:46:42,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:42,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 11:46:42,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 11:46:42,775 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 11:46:42,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 11:46:42,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757252467] [2023-12-19 11:46:42,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757252467] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 11:46:42,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 11:46:42,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-19 11:46:42,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727640130] [2023-12-19 11:46:42,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 11:46:42,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-19 11:46:42,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 11:46:42,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-19 11:46:42,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2023-12-19 11:46:42,776 INFO L87 Difference]: Start difference. First operand 375 states and 494 transitions. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 11:46:43,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 11:46:43,568 INFO L93 Difference]: Finished difference Result 801 states and 1041 transitions. [2023-12-19 11:46:43,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-19 11:46:43,584 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 108 [2023-12-19 11:46:43,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 11:46:43,586 INFO L225 Difference]: With dead ends: 801 [2023-12-19 11:46:43,586 INFO L226 Difference]: Without dead ends: 438 [2023-12-19 11:46:43,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=178, Invalid=472, Unknown=0, NotChecked=0, Total=650 [2023-12-19 11:46:43,587 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 142 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 11:46:43,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 412 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 11:46:43,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2023-12-19 11:46:43,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 375. [2023-12-19 11:46:43,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 276 states have (on average 1.1630434782608696) internal successors, (321), 280 states have internal predecessors, (321), 86 states have call successors, (86), 12 states have call predecessors, (86), 12 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) [2023-12-19 11:46:43,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 493 transitions. [2023-12-19 11:46:43,616 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 493 transitions. Word has length 108 [2023-12-19 11:46:43,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 11:46:43,616 INFO L495 AbstractCegarLoop]: Abstraction has 375 states and 493 transitions. [2023-12-19 11:46:43,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 11:46:43,616 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 493 transitions. [2023-12-19 11:46:43,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-19 11:46:43,617 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 11:46:43,617 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 11:46:43,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-19 11:46:43,617 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 11:46:43,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 11:46:43,617 INFO L85 PathProgramCache]: Analyzing trace with hash 843144329, now seen corresponding path program 1 times [2023-12-19 11:46:43,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 11:46:43,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293219558] [2023-12-19 11:46:43,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 11:46:43,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 11:46:43,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 11:46:43,641 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 11:46:43,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 11:46:43,698 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 11:46:43,698 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 11:46:43,699 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 11:46:43,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-19 11:46:43,703 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 11:46:43,705 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 11:46:43,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 11:46:43 BoogieIcfgContainer [2023-12-19 11:46:43,770 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 11:46:43,770 INFO L158 Benchmark]: Toolchain (without parser) took 12206.13ms. Allocated memory was 186.6MB in the beginning and 627.0MB in the end (delta: 440.4MB). Free memory was 143.9MB in the beginning and 379.9MB in the end (delta: -236.0MB). Peak memory consumption was 205.7MB. Max. memory is 8.0GB. [2023-12-19 11:46:43,770 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 186.6MB. Free memory is still 135.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 11:46:43,770 INFO L158 Benchmark]: CACSL2BoogieTranslator took 179.01ms. Allocated memory is still 186.6MB. Free memory was 143.9MB in the beginning and 131.0MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-19 11:46:43,770 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.12ms. Allocated memory is still 186.6MB. Free memory was 131.0MB in the beginning and 128.5MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-19 11:46:43,771 INFO L158 Benchmark]: Boogie Preprocessor took 59.15ms. Allocated memory is still 186.6MB. Free memory was 128.5MB in the beginning and 126.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-19 11:46:43,771 INFO L158 Benchmark]: RCFGBuilder took 395.27ms. Allocated memory is still 186.6MB. Free memory was 126.1MB in the beginning and 107.9MB in the end (delta: 18.2MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-19 11:46:43,772 INFO L158 Benchmark]: TraceAbstraction took 11539.93ms. Allocated memory was 186.6MB in the beginning and 627.0MB in the end (delta: 440.4MB). Free memory was 107.2MB in the beginning and 379.9MB in the end (delta: -272.7MB). Peak memory consumption was 169.0MB. Max. memory is 8.0GB. [2023-12-19 11:46:43,773 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.45ms. Allocated memory is still 186.6MB. Free memory is still 135.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 179.01ms. Allocated memory is still 186.6MB. Free memory was 143.9MB in the beginning and 131.0MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.12ms. Allocated memory is still 186.6MB. Free memory was 131.0MB in the beginning and 128.5MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 59.15ms. Allocated memory is still 186.6MB. Free memory was 128.5MB in the beginning and 126.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 395.27ms. Allocated memory is still 186.6MB. Free memory was 126.1MB in the beginning and 107.9MB in the end (delta: 18.2MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 11539.93ms. Allocated memory was 186.6MB in the beginning and 627.0MB in the end (delta: 440.4MB). Free memory was 107.2MB in the beginning and 379.9MB in the end (delta: -272.7MB). Peak memory consumption was 169.0MB. 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 someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryArithmeticDOUBLEoperation at line 68. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 9999.5; [L23] unsigned char var_1_2 = 1; [L24] double var_1_3 = 4.5; [L25] double var_1_4 = 2.5; [L26] double var_1_5 = 0.0; [L27] double var_1_6 = 999999999999.3; [L28] signed char var_1_7 = -128; [L29] signed char var_1_11 = -64; [L30] signed char var_1_12 = 5; [L31] signed char var_1_13 = 50; [L32] unsigned char var_1_14 = 0; [L33] unsigned char var_1_15 = 0; [L34] unsigned char var_1_16 = 0; [L35] unsigned char var_1_17 = 0; [L36] signed char last_1_var_1_7 = -128; [L107] isInitial = 1 [L108] FCALL initially() [L109] int k_loop; [L110] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=1, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L110] COND TRUE k_loop < 1 [L111] CALL updateLastVariables() [L100] last_1_var_1_7 = var_1_7 [L111] RET updateLastVariables() [L112] CALL updateVariables() [L72] var_1_2 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L73] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L74] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L74] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L75] var_1_3 = __VERIFIER_nondet_double() [L76] CALL assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L76] RET assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L77] var_1_4 = __VERIFIER_nondet_double() [L78] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L78] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L79] var_1_5 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_6=9999999999993/10, var_1_7=-128] [L80] RET assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_6=9999999999993/10, var_1_7=-128] [L81] var_1_6 = __VERIFIER_nondet_double() [L82] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L82] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L83] var_1_11 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L84] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L85] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L85] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L86] var_1_13 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L87] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L88] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L88] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L89] var_1_15 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L90] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L91] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L91] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L92] var_1_16 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L93] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L94] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L94] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L95] var_1_17 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L96] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L97] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L97] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L112] RET updateVariables() [L113] CALL step() [L40] signed long int stepLocal_1 = ((((last_1_var_1_7) < (last_1_var_1_7)) ? (last_1_var_1_7) : (last_1_var_1_7))) + last_1_var_1_7; VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_1=-256, var_1_11=-25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L41] COND FALSE !(last_1_var_1_7 <= stepLocal_1) [L44] var_1_12 = var_1_11 VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_1=-256, var_1_11=-25, var_1_12=-25, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L46] unsigned char stepLocal_3 = var_1_2; [L47] unsigned long int stepLocal_2 = (((25u) > (var_1_12)) ? (25u) : (var_1_12)); VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_1=-256, stepLocal_2=4294967271, stepLocal_3=0, var_1_11=-25, var_1_12=-25, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L48] COND TRUE stepLocal_3 || var_1_15 VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_1=-256, stepLocal_2=4294967271, stepLocal_3=0, var_1_11=-25, var_1_12=-25, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L49] COND TRUE stepLocal_2 <= var_1_12 VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_1=-256, stepLocal_2=4294967271, stepLocal_3=0, var_1_11=-25, var_1_12=-25, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L50] COND FALSE !(\read(var_1_2)) [L53] var_1_14 = var_1_17 VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_1=-256, stepLocal_2=4294967271, stepLocal_3=0, var_1_11=-25, var_1_12=-25, var_1_13=126, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L59] EXPR var_1_12 ^ var_1_12 VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_1=-256, stepLocal_2=4294967271, stepLocal_3=0, var_1_11=-25, var_1_12=-25, var_1_13=126, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L59] signed long int stepLocal_0 = var_1_12 ^ var_1_12; [L60] COND TRUE ((((-25) < (var_1_12)) ? (-25) : (var_1_12))) != stepLocal_0 VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_0=0, stepLocal_1=-256, stepLocal_2=4294967271, stepLocal_3=0, var_1_11=-25, var_1_12=-25, var_1_13=126, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L61] COND TRUE \read(var_1_14) [L62] var_1_7 = var_1_11 VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_0=0, stepLocal_1=-256, stepLocal_2=4294967271, stepLocal_3=0, var_1_11=-25, var_1_12=-25, var_1_13=126, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-25] [L67] COND TRUE \read(var_1_14) [L68] var_1_1 = ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))) VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_0=0, stepLocal_1=-256, stepLocal_2=4294967271, stepLocal_3=0, var_1_11=-25, var_1_12=-25, var_1_13=126, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=1000000000004, var_1_2=0, var_1_3=1000000000004, var_1_7=-25] [L113] RET step() [L114] CALL, EXPR property() [L103] EXPR (var_1_14 ? (var_1_1 == ((double) ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))))) : 1) && ((((((-25) < (var_1_12)) ? (-25) : (var_1_12))) != (var_1_12 ^ var_1_12)) ? (var_1_14 ? (var_1_7 == ((signed char) var_1_11)) : 1) : (var_1_7 == ((signed char) var_1_11))) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=-25, var_1_13=126, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=1000000000004, var_1_2=0, var_1_3=1000000000004, var_1_7=-25] [L103-L104] return (((var_1_14 ? (var_1_1 == ((double) ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))))) : 1) && ((((((-25) < (var_1_12)) ? (-25) : (var_1_12))) != (var_1_12 ^ var_1_12)) ? (var_1_14 ? (var_1_7 == ((signed char) var_1_11)) : 1) : (var_1_7 == ((signed char) var_1_11)))) && ((last_1_var_1_7 <= (((((last_1_var_1_7) < (last_1_var_1_7)) ? (last_1_var_1_7) : (last_1_var_1_7))) + last_1_var_1_7)) ? (var_1_12 == ((signed char) (var_1_13 - 1))) : (var_1_12 == ((signed char) var_1_11)))) && ((var_1_2 || var_1_15) ? ((((((25u) > (var_1_12)) ? (25u) : (var_1_12))) <= var_1_12) ? (var_1_2 ? (var_1_14 == ((unsigned char) var_1_16)) : (var_1_14 == ((unsigned char) var_1_17))) : 1) : (var_1_14 == ((unsigned char) var_1_16))) ; [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=-25, var_1_13=126, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=1000000000004, var_1_2=0, var_1_3=1000000000004, var_1_7=-25] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_7=-128, var_1_11=-25, var_1_12=-25, var_1_13=126, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=1000000000004, var_1_2=0, var_1_3=1000000000004, var_1_7=-25] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.4s, OverallIterations: 12, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1113 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1099 mSDsluCounter, 2622 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1680 mSDsCounter, 314 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1533 IncrementalHoareTripleChecker+Invalid, 1847 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 314 mSolverCounterUnsat, 942 mSDtfsCounter, 1533 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 695 GetRequests, 604 SyntacticMatches, 4 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=388occurred in iteration=8, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 726 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 1379 NumberOfCodeBlocks, 1379 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1362 ConstructedInterpolants, 0 QuantifiedInterpolants, 5253 SizeOfPredicates, 4 NumberOfNonLiveVariables, 256 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 6222/6240 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-19 11:46:43,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...