/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-10.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 23:09:23,354 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 23:09:23,414 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-20 23:09:23,418 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 23:09:23,419 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 23:09:23,440 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 23:09:23,440 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 23:09:23,440 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 23:09:23,441 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 23:09:23,444 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 23:09:23,444 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 23:09:23,444 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 23:09:23,445 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 23:09:23,446 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 23:09:23,446 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 23:09:23,446 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 23:09:23,446 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 23:09:23,446 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 23:09:23,446 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 23:09:23,446 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 23:09:23,447 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 23:09:23,447 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 23:09:23,447 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 23:09:23,447 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 23:09:23,447 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 23:09:23,447 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 23:09:23,448 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 23:09:23,448 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 23:09:23,448 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 23:09:23,448 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 23:09:23,449 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 23:09:23,449 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 23:09:23,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 23:09:23,449 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 23:09:23,449 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 23:09:23,449 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 23:09:23,450 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 23:09:23,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 23:09:23,450 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 23:09:23,450 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 23:09:23,450 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 23:09:23,450 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 23:09:23,450 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 23:09:23,450 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-20 23:09:23,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 23:09:23,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 23:09:23,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 23:09:23,652 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 23:09:23,653 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 23:09:23,654 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-10.i [2023-12-20 23:09:24,687 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 23:09:24,847 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 23:09:24,847 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-10.i [2023-12-20 23:09:24,854 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51edb8656/65377ab0f0464fd899d2565d18040093/FLAGa3a7ca413 [2023-12-20 23:09:24,867 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51edb8656/65377ab0f0464fd899d2565d18040093 [2023-12-20 23:09:24,869 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 23:09:24,870 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 23:09:24,871 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 23:09:24,871 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 23:09:24,874 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 23:09:24,874 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 11:09:24" (1/1) ... [2023-12-20 23:09:24,875 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b915360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:09:24, skipping insertion in model container [2023-12-20 23:09:24,875 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 11:09:24" (1/1) ... [2023-12-20 23:09:24,905 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 23:09:25,004 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_50-1loop_file-10.i[915,928] [2023-12-20 23:09:25,044 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 23:09:25,052 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 23:09:25,059 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_50-1loop_file-10.i[915,928] [2023-12-20 23:09:25,079 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 23:09:25,089 INFO L206 MainTranslator]: Completed translation [2023-12-20 23:09:25,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:09:25 WrapperNode [2023-12-20 23:09:25,089 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 23:09:25,090 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 23:09:25,090 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 23:09:25,090 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 23:09:25,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:09:25" (1/1) ... [2023-12-20 23:09:25,127 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:09:25" (1/1) ... [2023-12-20 23:09:25,168 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 155 [2023-12-20 23:09:25,168 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 23:09:25,169 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 23:09:25,169 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 23:09:25,169 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 23:09:25,176 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:09:25" (1/1) ... [2023-12-20 23:09:25,177 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:09:25" (1/1) ... [2023-12-20 23:09:25,179 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:09:25" (1/1) ... [2023-12-20 23:09:25,192 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-20 23:09:25,193 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:09:25" (1/1) ... [2023-12-20 23:09:25,193 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:09:25" (1/1) ... [2023-12-20 23:09:25,200 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:09:25" (1/1) ... [2023-12-20 23:09:25,202 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:09:25" (1/1) ... [2023-12-20 23:09:25,204 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:09:25" (1/1) ... [2023-12-20 23:09:25,206 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:09:25" (1/1) ... [2023-12-20 23:09:25,212 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 23:09:25,213 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 23:09:25,213 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 23:09:25,213 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 23:09:25,213 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:09:25" (1/1) ... [2023-12-20 23:09:25,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 23:09:25,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 23:09:25,245 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-20 23:09:25,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-20 23:09:25,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 23:09:25,271 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-20 23:09:25,272 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-20 23:09:25,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 23:09:25,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 23:09:25,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 23:09:25,350 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 23:09:25,352 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 23:09:25,621 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 23:09:25,650 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 23:09:25,650 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-20 23:09:25,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 11:09:25 BoogieIcfgContainer [2023-12-20 23:09:25,650 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 23:09:25,652 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 23:09:25,652 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 23:09:25,654 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 23:09:25,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 11:09:24" (1/3) ... [2023-12-20 23:09:25,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@458cf664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 11:09:25, skipping insertion in model container [2023-12-20 23:09:25,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:09:25" (2/3) ... [2023-12-20 23:09:25,670 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@458cf664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 11:09:25, skipping insertion in model container [2023-12-20 23:09:25,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 11:09:25" (3/3) ... [2023-12-20 23:09:25,671 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-10.i [2023-12-20 23:09:25,683 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 23:09:25,683 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 23:09:25,728 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 23:09:25,733 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;@1ea17253, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 23:09:25,733 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 23:09:25,737 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 39 states have internal predecessors, (55), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-20 23:09:25,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-20 23:09:25,752 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 23:09:25,753 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 23:09:25,753 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 23:09:25,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 23:09:25,757 INFO L85 PathProgramCache]: Analyzing trace with hash -2098649063, now seen corresponding path program 1 times [2023-12-20 23:09:25,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 23:09:25,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731512176] [2023-12-20 23:09:25,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 23:09:25,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 23:09:25,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:25,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 23:09:25,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:26,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 23:09:26,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:26,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 23:09:26,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:26,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 23:09:26,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:26,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 23:09:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:26,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 23:09:26,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:26,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 23:09:26,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:26,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 23:09:26,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:26,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 23:09:26,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:26,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 23:09:26,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:26,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 23:09:26,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:26,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 23:09:26,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:26,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 23:09:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:26,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 23:09:26,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:26,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 23:09:26,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:26,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 23:09:26,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:26,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 23:09:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:26,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 23:09:26,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:26,079 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-20 23:09:26,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 23:09:26,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731512176] [2023-12-20 23:09:26,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731512176] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 23:09:26,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 23:09:26,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 23:09:26,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965496361] [2023-12-20 23:09:26,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 23:09:26,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-20 23:09:26,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 23:09:26,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-20 23:09:26,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 23:09:26,118 INFO L87 Difference]: Start difference. First operand has 59 states, 38 states have (on average 1.4473684210526316) internal successors, (55), 39 states have internal predecessors, (55), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-20 23:09:26,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 23:09:26,158 INFO L93 Difference]: Finished difference Result 117 states and 199 transitions. [2023-12-20 23:09:26,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-20 23:09:26,160 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 118 [2023-12-20 23:09:26,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 23:09:26,165 INFO L225 Difference]: With dead ends: 117 [2023-12-20 23:09:26,165 INFO L226 Difference]: Without dead ends: 57 [2023-12-20 23:09:26,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 23:09:26,170 INFO L413 NwaCegarLoop]: 83 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, 83 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-20 23:09:26,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 23:09:26,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-12-20 23:09:26,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-12-20 23:09:26,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 37 states have internal predecessors, (50), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-20 23:09:26,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 86 transitions. [2023-12-20 23:09:26,212 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 86 transitions. Word has length 118 [2023-12-20 23:09:26,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 23:09:26,212 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 86 transitions. [2023-12-20 23:09:26,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-20 23:09:26,213 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 86 transitions. [2023-12-20 23:09:26,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-20 23:09:26,216 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 23:09:26,217 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 23:09:26,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 23:09:26,217 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 23:09:26,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 23:09:26,217 INFO L85 PathProgramCache]: Analyzing trace with hash -410330791, now seen corresponding path program 1 times [2023-12-20 23:09:26,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 23:09:26,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610892369] [2023-12-20 23:09:26,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 23:09:26,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 23:09:26,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:26,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 23:09:26,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:26,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 23:09:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:26,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 23:09:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:26,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 23:09:26,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:26,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 23:09:26,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:26,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 23:09:26,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:26,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 23:09:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:26,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 23:09:26,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:26,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 23:09:26,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:26,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 23:09:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:26,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 23:09:26,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:26,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 23:09:26,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:26,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 23:09:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:26,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 23:09:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:26,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 23:09:26,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:26,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 23:09:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:26,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 23:09:26,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:26,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 23:09:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:26,651 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-20 23:09:26,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 23:09:26,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610892369] [2023-12-20 23:09:26,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610892369] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 23:09:26,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 23:09:26,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 23:09:26,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294080589] [2023-12-20 23:09:26,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 23:09:26,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 23:09:26,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 23:09:26,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 23:09:26,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-20 23:09:26,662 INFO L87 Difference]: Start difference. First operand 57 states and 86 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-20 23:09:26,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 23:09:26,817 INFO L93 Difference]: Finished difference Result 170 states and 257 transitions. [2023-12-20 23:09:26,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-20 23:09:26,818 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2023-12-20 23:09:26,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 23:09:26,820 INFO L225 Difference]: With dead ends: 170 [2023-12-20 23:09:26,820 INFO L226 Difference]: Without dead ends: 114 [2023-12-20 23:09:26,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-20 23:09:26,824 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 79 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 23:09:26,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 311 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 23:09:26,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-12-20 23:09:26,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 90. [2023-12-20 23:09:26,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 51 states have (on average 1.2549019607843137) internal successors, (64), 51 states have internal predecessors, (64), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-20 23:09:26,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 136 transitions. [2023-12-20 23:09:26,848 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 136 transitions. Word has length 118 [2023-12-20 23:09:26,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 23:09:26,849 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 136 transitions. [2023-12-20 23:09:26,849 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-20 23:09:26,850 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 136 transitions. [2023-12-20 23:09:26,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-20 23:09:26,854 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 23:09:26,854 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 23:09:26,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 23:09:26,854 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 23:09:26,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 23:09:26,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1414155715, now seen corresponding path program 1 times [2023-12-20 23:09:26,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 23:09:26,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144994126] [2023-12-20 23:09:26,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 23:09:26,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 23:09:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:40,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 23:09:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:40,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 23:09:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:40,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 23:09:40,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:40,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 23:09:40,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:40,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 23:09:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:40,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 23:09:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:40,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 23:09:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:40,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 23:09:40,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:40,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 23:09:40,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:40,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 23:09:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:40,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 23:09:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:40,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 23:09:40,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:40,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 23:09:40,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:40,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 23:09:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:40,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 23:09:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:40,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 23:09:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:40,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 23:09:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:40,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 23:09:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:09:40,890 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-20 23:09:40,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 23:09:40,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144994126] [2023-12-20 23:09:40,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144994126] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 23:09:40,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 23:09:40,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-20 23:09:40,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944358368] [2023-12-20 23:09:40,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 23:09:40,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-20 23:09:40,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 23:09:40,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-20 23:09:40,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-12-20 23:09:40,892 INFO L87 Difference]: Start difference. First operand 90 states and 136 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-20 23:09:42,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 23:09:42,576 INFO L93 Difference]: Finished difference Result 260 states and 373 transitions. [2023-12-20 23:09:42,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-20 23:09:42,577 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 119 [2023-12-20 23:09:42,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 23:09:42,578 INFO L225 Difference]: With dead ends: 260 [2023-12-20 23:09:42,578 INFO L226 Difference]: Without dead ends: 204 [2023-12-20 23:09:42,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992 [2023-12-20 23:09:42,580 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 330 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-20 23:09:42,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 486 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-20 23:09:42,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-12-20 23:09:42,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 108. [2023-12-20 23:09:42,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 68 states have internal predecessors, (88), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-20 23:09:42,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 160 transitions. [2023-12-20 23:09:42,590 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 160 transitions. Word has length 119 [2023-12-20 23:09:42,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 23:09:42,591 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 160 transitions. [2023-12-20 23:09:42,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-20 23:09:42,591 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 160 transitions. [2023-12-20 23:09:42,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-20 23:09:42,592 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 23:09:42,592 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 23:09:42,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-20 23:09:42,592 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 23:09:42,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 23:09:42,593 INFO L85 PathProgramCache]: Analyzing trace with hash 604809089, now seen corresponding path program 1 times [2023-12-20 23:09:42,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 23:09:42,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667124429] [2023-12-20 23:09:42,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 23:09:42,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 23:09:42,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:11:56,069 WARN L293 SmtUtils]: Spent 7.60s on a formula simplification. DAG size of input: 236 DAG size of output: 210 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 23:11:56,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 23:11:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:11:56,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 23:11:56,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:11:56,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 23:11:56,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:11:56,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 23:11:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:11:56,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 23:11:56,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:11:56,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 23:11:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:11:56,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 23:11:56,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:11:56,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 23:11:56,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:11:56,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 23:11:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:11:56,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 23:11:56,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:11:56,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 23:11:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:11:56,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 23:11:56,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:11:56,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 23:11:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:11:56,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 23:11:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:11:56,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 23:11:56,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:11:56,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 23:11:56,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:11:56,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 23:11:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:11:56,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 23:11:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:11:56,144 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-20 23:11:56,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 23:11:56,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667124429] [2023-12-20 23:11:56,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667124429] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 23:11:56,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 23:11:56,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-20 23:11:56,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024731918] [2023-12-20 23:11:56,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 23:11:56,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-20 23:11:56,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 23:11:56,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-20 23:11:56,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-12-20 23:11:56,148 INFO L87 Difference]: Start difference. First operand 108 states and 160 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-20 23:12:03,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 23:12:07,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 23:12:07,689 INFO L93 Difference]: Finished difference Result 298 states and 438 transitions. [2023-12-20 23:12:07,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-20 23:12:07,690 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2023-12-20 23:12:07,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 23:12:07,691 INFO L225 Difference]: With dead ends: 298 [2023-12-20 23:12:07,691 INFO L226 Difference]: Without dead ends: 238 [2023-12-20 23:12:07,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=176, Invalid=526, Unknown=0, NotChecked=0, Total=702 [2023-12-20 23:12:07,692 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 355 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 62 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2023-12-20 23:12:07,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 387 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 461 Invalid, 1 Unknown, 0 Unchecked, 6.1s Time] [2023-12-20 23:12:07,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2023-12-20 23:12:07,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 170. [2023-12-20 23:12:07,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 111 states have (on average 1.3063063063063063) internal successors, (145), 111 states have internal predecessors, (145), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-20 23:12:07,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 253 transitions. [2023-12-20 23:12:07,719 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 253 transitions. Word has length 119 [2023-12-20 23:12:07,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 23:12:07,719 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 253 transitions. [2023-12-20 23:12:07,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-20 23:12:07,720 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 253 transitions. [2023-12-20 23:12:07,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-20 23:12:07,720 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 23:12:07,721 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 23:12:07,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-20 23:12:07,721 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 23:12:07,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 23:12:07,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1931308739, now seen corresponding path program 1 times [2023-12-20 23:12:07,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 23:12:07,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525265047] [2023-12-20 23:12:07,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 23:12:07,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 23:12:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:14:01,967 WARN L293 SmtUtils]: Spent 6.90s on a formula simplification. DAG size of input: 211 DAG size of output: 185 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 23:14:02,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 23:14:02,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:14:02,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 23:14:02,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:14:02,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 23:14:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:14:02,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 23:14:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:14:02,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 23:14:02,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:14:02,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 23:14:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:14:02,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 23:14:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:14:02,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 23:14:02,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:14:02,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 23:14:02,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:14:02,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 23:14:02,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:14:02,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 23:14:02,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:14:02,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 23:14:02,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:14:02,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 23:14:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:14:02,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 23:14:02,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:14:02,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 23:14:02,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:14:02,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 23:14:02,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:14:02,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 23:14:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:14:02,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 23:14:02,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:14:02,046 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-20 23:14:02,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 23:14:02,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525265047] [2023-12-20 23:14:02,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525265047] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 23:14:02,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 23:14:02,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-20 23:14:02,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512864175] [2023-12-20 23:14:02,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 23:14:02,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-20 23:14:02,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 23:14:02,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-20 23:14:02,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-12-20 23:14:02,047 INFO L87 Difference]: Start difference. First operand 170 states and 253 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-20 23:14:07,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 23:14:08,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 23:14:08,878 INFO L93 Difference]: Finished difference Result 278 states and 404 transitions. [2023-12-20 23:14:08,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-20 23:14:08,878 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2023-12-20 23:14:08,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 23:14:08,879 INFO L225 Difference]: With dead ends: 278 [2023-12-20 23:14:08,880 INFO L226 Difference]: Without dead ends: 222 [2023-12-20 23:14:08,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2023-12-20 23:14:08,881 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 201 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2023-12-20 23:14:08,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 360 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 364 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2023-12-20 23:14:08,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2023-12-20 23:14:08,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 162. [2023-12-20 23:14:08,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 102 states have (on average 1.2745098039215685) internal successors, (130), 103 states have internal predecessors, (130), 54 states have call successors, (54), 5 states have call predecessors, (54), 5 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-20 23:14:08,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 238 transitions. [2023-12-20 23:14:08,894 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 238 transitions. Word has length 119 [2023-12-20 23:14:08,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 23:14:08,894 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 238 transitions. [2023-12-20 23:14:08,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-20 23:14:08,894 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 238 transitions. [2023-12-20 23:14:08,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-20 23:14:08,895 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 23:14:08,895 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 23:14:08,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-20 23:14:08,895 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 23:14:08,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 23:14:08,896 INFO L85 PathProgramCache]: Analyzing trace with hash -675054589, now seen corresponding path program 1 times [2023-12-20 23:14:08,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 23:14:08,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491493874] [2023-12-20 23:14:08,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 23:14:08,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 23:14:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:15:07,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 23:15:07,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:15:07,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 23:15:07,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:15:07,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 23:15:07,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:15:07,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 23:15:07,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:15:07,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 23:15:07,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:15:07,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 23:15:07,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:15:07,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 23:15:07,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:15:07,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 23:15:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:15:07,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 23:15:07,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:15:07,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 23:15:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:15:07,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 23:15:07,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:15:07,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 23:15:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:15:07,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 23:15:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:15:07,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 23:15:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:15:07,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 23:15:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:15:07,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 23:15:07,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:15:07,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 23:15:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:15:07,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 23:15:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:15:07,908 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-20 23:15:07,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 23:15:07,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491493874] [2023-12-20 23:15:07,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491493874] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 23:15:07,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 23:15:07,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-20 23:15:07,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517455469] [2023-12-20 23:15:07,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 23:15:07,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-20 23:15:07,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 23:15:07,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-20 23:15:07,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-12-20 23:15:07,910 INFO L87 Difference]: Start difference. First operand 162 states and 238 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-20 23:15:12,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 23:15:13,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 23:15:13,290 INFO L93 Difference]: Finished difference Result 334 states and 484 transitions. [2023-12-20 23:15:13,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-20 23:15:13,291 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2023-12-20 23:15:13,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 23:15:13,293 INFO L225 Difference]: With dead ends: 334 [2023-12-20 23:15:13,293 INFO L226 Difference]: Without dead ends: 208 [2023-12-20 23:15:13,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2023-12-20 23:15:13,294 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 177 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 63 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2023-12-20 23:15:13,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 443 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 346 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2023-12-20 23:15:13,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2023-12-20 23:15:13,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 164. [2023-12-20 23:15:13,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 104 states have (on average 1.2692307692307692) internal successors, (132), 105 states have internal predecessors, (132), 54 states have call successors, (54), 5 states have call predecessors, (54), 5 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-20 23:15:13,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 240 transitions. [2023-12-20 23:15:13,305 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 240 transitions. Word has length 119 [2023-12-20 23:15:13,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 23:15:13,306 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 240 transitions. [2023-12-20 23:15:13,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-20 23:15:13,306 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 240 transitions. [2023-12-20 23:15:13,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-20 23:15:13,306 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 23:15:13,307 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 23:15:13,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-20 23:15:13,307 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 23:15:13,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 23:15:13,307 INFO L85 PathProgramCache]: Analyzing trace with hash -174192187, now seen corresponding path program 1 times [2023-12-20 23:15:13,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 23:15:13,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193890904] [2023-12-20 23:15:13,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 23:15:13,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 23:15:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:15:41,786 WARN L293 SmtUtils]: Spent 5.11s on a formula simplification. DAG size of input: 146 DAG size of output: 135 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 23:15:41,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 23:15:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:15:41,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 23:15:41,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:15:41,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 23:15:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:15:41,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 23:15:41,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:15:41,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 23:15:41,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:15:41,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 23:15:41,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:15:41,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 23:15:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:15:41,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 23:15:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:15:41,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 23:15:41,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:15:41,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 23:15:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:15:41,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 23:15:41,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:15:41,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 23:15:41,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:15:41,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 23:15:41,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:15:41,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 23:15:41,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:15:41,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 23:15:41,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:15:41,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 23:15:41,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:15:41,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 23:15:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:15:41,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 23:15:41,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:15:41,826 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-20 23:15:41,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 23:15:41,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193890904] [2023-12-20 23:15:41,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193890904] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 23:15:41,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 23:15:41,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-20 23:15:41,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315563739] [2023-12-20 23:15:41,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 23:15:41,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-20 23:15:41,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 23:15:41,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-20 23:15:41,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-12-20 23:15:41,828 INFO L87 Difference]: Start difference. First operand 164 states and 240 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-20 23:15:47,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 23:15:51,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 23:15:52,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 23:15:52,085 INFO L93 Difference]: Finished difference Result 369 states and 525 transitions. [2023-12-20 23:15:52,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-20 23:15:52,085 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2023-12-20 23:15:52,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 23:15:52,087 INFO L225 Difference]: With dead ends: 369 [2023-12-20 23:15:52,087 INFO L226 Difference]: Without dead ends: 313 [2023-12-20 23:15:52,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=198, Invalid=614, Unknown=0, NotChecked=0, Total=812 [2023-12-20 23:15:52,088 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 161 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 60 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2023-12-20 23:15:52,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 507 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 586 Invalid, 2 Unknown, 0 Unchecked, 9.2s Time] [2023-12-20 23:15:52,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2023-12-20 23:15:52,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 176. [2023-12-20 23:15:52,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 116 states have (on average 1.293103448275862) internal successors, (150), 116 states have internal predecessors, (150), 54 states have call successors, (54), 5 states have call predecessors, (54), 5 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-20 23:15:52,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 258 transitions. [2023-12-20 23:15:52,100 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 258 transitions. Word has length 119 [2023-12-20 23:15:52,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 23:15:52,100 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 258 transitions. [2023-12-20 23:15:52,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-20 23:15:52,101 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 258 transitions. [2023-12-20 23:15:52,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-20 23:15:52,101 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 23:15:52,101 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 23:15:52,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-20 23:15:52,102 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 23:15:52,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 23:15:52,102 INFO L85 PathProgramCache]: Analyzing trace with hash -983538813, now seen corresponding path program 1 times [2023-12-20 23:15:52,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 23:15:52,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983899824] [2023-12-20 23:15:52,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 23:15:52,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 23:15:52,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:16:52,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 23:16:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:16:52,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 23:16:52,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:16:52,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 23:16:52,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:16:52,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 23:16:52,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:16:52,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 23:16:52,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:16:52,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 23:16:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:16:52,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 23:16:52,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:16:52,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 23:16:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:16:52,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 23:16:52,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:16:52,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 23:16:52,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:16:52,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 23:16:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:16:52,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 23:16:52,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:16:52,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 23:16:52,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:16:52,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 23:16:52,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:16:52,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 23:16:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:16:52,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 23:16:52,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:16:52,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 23:16:52,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:16:52,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 23:16:52,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:16:52,413 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-20 23:16:52,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 23:16:52,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983899824] [2023-12-20 23:16:52,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983899824] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 23:16:52,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 23:16:52,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-20 23:16:52,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934104179] [2023-12-20 23:16:52,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 23:16:52,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-20 23:16:52,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 23:16:52,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-20 23:16:52,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-12-20 23:16:52,416 INFO L87 Difference]: Start difference. First operand 176 states and 258 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-20 23:16:56,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 23:16:59,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 23:16:59,458 INFO L93 Difference]: Finished difference Result 387 states and 557 transitions. [2023-12-20 23:16:59,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-20 23:16:59,459 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 119 [2023-12-20 23:16:59,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 23:16:59,461 INFO L225 Difference]: With dead ends: 387 [2023-12-20 23:16:59,461 INFO L226 Difference]: Without dead ends: 327 [2023-12-20 23:16:59,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=242, Invalid=688, Unknown=0, NotChecked=0, Total=930 [2023-12-20 23:16:59,462 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 401 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 82 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2023-12-20 23:16:59,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 511 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 795 Invalid, 1 Unknown, 0 Unchecked, 5.5s Time] [2023-12-20 23:16:59,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2023-12-20 23:16:59,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 254. [2023-12-20 23:16:59,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 172 states have (on average 1.2906976744186047) internal successors, (222), 172 states have internal predecessors, (222), 72 states have call successors, (72), 9 states have call predecessors, (72), 9 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2023-12-20 23:16:59,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 366 transitions. [2023-12-20 23:16:59,483 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 366 transitions. Word has length 119 [2023-12-20 23:16:59,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 23:16:59,484 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 366 transitions. [2023-12-20 23:16:59,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-20 23:16:59,484 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 366 transitions. [2023-12-20 23:16:59,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-20 23:16:59,485 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 23:16:59,485 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 23:16:59,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-20 23:16:59,485 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 23:16:59,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 23:16:59,485 INFO L85 PathProgramCache]: Analyzing trace with hash 342960837, now seen corresponding path program 1 times [2023-12-20 23:16:59,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 23:16:59,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715003520] [2023-12-20 23:16:59,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 23:16:59,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 23:16:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:18:45,673 WARN L293 SmtUtils]: Spent 6.97s on a formula simplification. DAG size of input: 216 DAG size of output: 190 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 23:18:45,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 23:18:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:18:45,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 23:18:45,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:18:45,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 23:18:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:18:45,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 23:18:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:18:45,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 23:18:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:18:45,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 23:18:45,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:18:45,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 23:18:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:18:45,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 23:18:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:18:45,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 23:18:45,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:18:45,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 23:18:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:18:45,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 23:18:45,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:18:45,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 23:18:45,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:18:45,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 23:18:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:18:45,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 23:18:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:18:45,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 23:18:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:18:45,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 23:18:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:18:45,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 23:18:45,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:18:45,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 23:18:45,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:18:45,721 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-20 23:18:45,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 23:18:45,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715003520] [2023-12-20 23:18:45,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715003520] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 23:18:45,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 23:18:45,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-20 23:18:45,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23786219] [2023-12-20 23:18:45,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 23:18:45,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-20 23:18:45,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 23:18:45,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-20 23:18:45,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-12-20 23:18:45,723 INFO L87 Difference]: Start difference. First operand 254 states and 366 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-20 23:18:51,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 23:18:56,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 23:18:56,604 INFO L93 Difference]: Finished difference Result 336 states and 483 transitions. [2023-12-20 23:18:56,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-20 23:18:56,605 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2023-12-20 23:18:56,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 23:18:56,607 INFO L225 Difference]: With dead ends: 336 [2023-12-20 23:18:56,607 INFO L226 Difference]: Without dead ends: 280 [2023-12-20 23:18:56,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2023-12-20 23:18:56,608 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 178 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 60 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2023-12-20 23:18:56,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 367 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 387 Invalid, 1 Unknown, 0 Unchecked, 4.9s Time] [2023-12-20 23:18:56,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2023-12-20 23:18:56,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 230. [2023-12-20 23:18:56,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 148 states have (on average 1.2567567567567568) internal successors, (186), 149 states have internal predecessors, (186), 72 states have call successors, (72), 9 states have call predecessors, (72), 9 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72) [2023-12-20 23:18:56,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 330 transitions. [2023-12-20 23:18:56,627 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 330 transitions. Word has length 119 [2023-12-20 23:18:56,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 23:18:56,629 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 330 transitions. [2023-12-20 23:18:56,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-20 23:18:56,629 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 330 transitions. [2023-12-20 23:18:56,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-20 23:18:56,630 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 23:18:56,630 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 23:18:56,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-20 23:18:56,630 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 23:18:56,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 23:18:56,630 INFO L85 PathProgramCache]: Analyzing trace with hash 2031564805, now seen corresponding path program 1 times [2023-12-20 23:18:56,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 23:18:56,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022140428] [2023-12-20 23:18:56,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 23:18:56,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 23:18:56,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:19:40,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 23:19:40,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:19:40,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 23:19:40,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:19:40,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 23:19:40,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:19:40,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 23:19:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:19:40,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 23:19:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:19:40,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 23:19:40,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:19:40,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 23:19:40,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:19:40,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 23:19:40,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:19:40,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 23:19:40,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:19:40,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 23:19:40,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:19:40,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 23:19:40,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:19:40,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 23:19:40,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:19:40,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 23:19:40,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:19:40,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 23:19:40,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:19:40,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 23:19:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:19:40,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 23:19:40,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:19:40,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 23:19:40,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:19:40,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 23:19:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:19:40,524 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-20 23:19:40,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 23:19:40,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022140428] [2023-12-20 23:19:40,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022140428] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 23:19:40,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 23:19:40,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-20 23:19:40,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591492584] [2023-12-20 23:19:40,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 23:19:40,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-20 23:19:40,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 23:19:40,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-20 23:19:40,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-12-20 23:19:40,525 INFO L87 Difference]: Start difference. First operand 230 states and 330 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-20 23:19:44,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 23:19:44,759 INFO L93 Difference]: Finished difference Result 548 states and 772 transitions. [2023-12-20 23:19:44,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-20 23:19:44,784 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 119 [2023-12-20 23:19:44,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 23:19:44,787 INFO L225 Difference]: With dead ends: 548 [2023-12-20 23:19:44,787 INFO L226 Difference]: Without dead ends: 418 [2023-12-20 23:19:44,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=257, Invalid=613, Unknown=0, NotChecked=0, Total=870 [2023-12-20 23:19:44,788 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 308 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-20 23:19:44,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 519 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-20 23:19:44,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2023-12-20 23:19:44,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 307. [2023-12-20 23:19:44,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 203 states have (on average 1.251231527093596) internal successors, (254), 203 states have internal predecessors, (254), 90 states have call successors, (90), 13 states have call predecessors, (90), 13 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2023-12-20 23:19:44,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 434 transitions. [2023-12-20 23:19:44,814 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 434 transitions. Word has length 119 [2023-12-20 23:19:44,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 23:19:44,815 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 434 transitions. [2023-12-20 23:19:44,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-20 23:19:44,815 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 434 transitions. [2023-12-20 23:19:44,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-20 23:19:44,816 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 23:19:44,816 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 23:19:44,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-20 23:19:44,816 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 23:19:44,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 23:19:44,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1562337913, now seen corresponding path program 1 times [2023-12-20 23:19:44,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 23:19:44,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816594191] [2023-12-20 23:19:44,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 23:19:44,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 23:19:44,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:20:27,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 23:20:27,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:20:27,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 23:20:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:20:27,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 23:20:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:20:27,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 23:20:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:20:27,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 23:20:27,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:20:27,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 23:20:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:20:27,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 23:20:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:20:27,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 23:20:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:20:27,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 23:20:27,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:20:27,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 23:20:27,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:20:27,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 23:20:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:20:27,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 23:20:27,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:20:27,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 23:20:27,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:20:27,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 23:20:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:20:27,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 23:20:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:20:27,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 23:20:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:20:27,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 23:20:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:20:27,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 23:20:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:20:27,056 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-20 23:20:27,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 23:20:27,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816594191] [2023-12-20 23:20:27,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816594191] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 23:20:27,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 23:20:27,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-20 23:20:27,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743713754] [2023-12-20 23:20:27,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 23:20:27,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-20 23:20:27,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 23:20:27,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-20 23:20:27,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-12-20 23:20:27,058 INFO L87 Difference]: Start difference. First operand 307 states and 434 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-20 23:20:29,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 23:20:29,062 INFO L93 Difference]: Finished difference Result 646 states and 905 transitions. [2023-12-20 23:20:29,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-20 23:20:29,062 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2023-12-20 23:20:29,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 23:20:29,064 INFO L225 Difference]: With dead ends: 646 [2023-12-20 23:20:29,064 INFO L226 Difference]: Without dead ends: 446 [2023-12-20 23:20:29,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=205, Invalid=497, Unknown=0, NotChecked=0, Total=702 [2023-12-20 23:20:29,065 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 200 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-20 23:20:29,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 562 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-20 23:20:29,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2023-12-20 23:20:29,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 301. [2023-12-20 23:20:29,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 197 states have (on average 1.248730964467005) internal successors, (246), 197 states have internal predecessors, (246), 90 states have call successors, (90), 13 states have call predecessors, (90), 13 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2023-12-20 23:20:29,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 426 transitions. [2023-12-20 23:20:29,097 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 426 transitions. Word has length 119 [2023-12-20 23:20:29,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 23:20:29,097 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 426 transitions. [2023-12-20 23:20:29,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-20 23:20:29,097 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 426 transitions. [2023-12-20 23:20:29,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-20 23:20:29,098 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 23:20:29,098 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 23:20:29,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-20 23:20:29,098 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 23:20:29,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 23:20:29,099 INFO L85 PathProgramCache]: Analyzing trace with hash -2129534338, now seen corresponding path program 1 times [2023-12-20 23:20:29,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 23:20:29,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503915300] [2023-12-20 23:20:29,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 23:20:29,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 23:20:29,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:20:52,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 23:20:52,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:20:52,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 23:20:52,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:20:52,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 23:20:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:20:52,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 23:20:52,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:20:52,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 23:20:52,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:20:52,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 23:20:52,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:20:52,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 23:20:52,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:20:52,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 23:20:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:20:52,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 23:20:52,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:20:52,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 23:20:52,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:20:52,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 23:20:52,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:20:52,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 23:20:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:20:52,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 23:20:52,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:20:52,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 23:20:52,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:20:52,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 23:20:52,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:20:52,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 23:20:52,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:20:52,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 23:20:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:20:52,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 23:20:52,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:20:52,953 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-20 23:20:52,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 23:20:52,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503915300] [2023-12-20 23:20:52,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503915300] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 23:20:52,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 23:20:52,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-12-20 23:20:52,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302639930] [2023-12-20 23:20:52,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 23:20:52,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-20 23:20:52,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 23:20:52,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-20 23:20:52,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2023-12-20 23:20:52,954 INFO L87 Difference]: Start difference. First operand 301 states and 426 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2023-12-20 23:21:01,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 23:21:02,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 23:21:02,991 INFO L93 Difference]: Finished difference Result 520 states and 723 transitions. [2023-12-20 23:21:02,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-20 23:21:02,991 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 120 [2023-12-20 23:21:02,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 23:21:02,993 INFO L225 Difference]: With dead ends: 520 [2023-12-20 23:21:02,993 INFO L226 Difference]: Without dead ends: 464 [2023-12-20 23:21:02,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=394, Invalid=1166, Unknown=0, NotChecked=0, Total=1560 [2023-12-20 23:21:02,994 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 679 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 86 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2023-12-20 23:21:02,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [679 Valid, 525 Invalid, 1216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1129 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2023-12-20 23:21:02,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2023-12-20 23:21:03,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 319. [2023-12-20 23:21:03,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 213 states have (on average 1.2582159624413145) internal successors, (268), 213 states have internal predecessors, (268), 90 states have call successors, (90), 15 states have call predecessors, (90), 15 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2023-12-20 23:21:03,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 448 transitions. [2023-12-20 23:21:03,016 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 448 transitions. Word has length 120 [2023-12-20 23:21:03,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 23:21:03,016 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 448 transitions. [2023-12-20 23:21:03,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2023-12-20 23:21:03,016 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 448 transitions. [2023-12-20 23:21:03,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-20 23:21:03,017 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 23:21:03,017 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 23:21:03,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-20 23:21:03,017 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 23:21:03,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 23:21:03,018 INFO L85 PathProgramCache]: Analyzing trace with hash -2072276036, now seen corresponding path program 1 times [2023-12-20 23:21:03,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 23:21:03,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209613012] [2023-12-20 23:21:03,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 23:21:03,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 23:21:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:21:03,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 23:21:03,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:21:03,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 23:21:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:21:03,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 23:21:03,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:21:03,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 23:21:03,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:21:03,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 23:21:03,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:21:03,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 23:21:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:21:03,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 23:21:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:21:03,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 23:21:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:21:03,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 23:21:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:21:03,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 23:21:03,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:21:03,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 23:21:03,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:21:03,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 23:21:03,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:21:03,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 23:21:03,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:21:03,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 23:21:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:21:03,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 23:21:03,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:21:03,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 23:21:03,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:21:03,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 23:21:03,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:21:03,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 23:21:03,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:21:03,135 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-20 23:21:03,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 23:21:03,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209613012] [2023-12-20 23:21:03,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209613012] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 23:21:03,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 23:21:03,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 23:21:03,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740595785] [2023-12-20 23:21:03,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 23:21:03,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 23:21:03,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 23:21:03,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 23:21:03,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-20 23:21:03,136 INFO L87 Difference]: Start difference. First operand 319 states and 448 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-20 23:21:03,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 23:21:03,214 INFO L93 Difference]: Finished difference Result 416 states and 584 transitions. [2023-12-20 23:21:03,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 23:21:03,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2023-12-20 23:21:03,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 23:21:03,216 INFO L225 Difference]: With dead ends: 416 [2023-12-20 23:21:03,216 INFO L226 Difference]: Without dead ends: 360 [2023-12-20 23:21:03,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-20 23:21:03,217 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 36 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 23:21:03,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 216 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 23:21:03,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2023-12-20 23:21:03,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 357. [2023-12-20 23:21:03,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 240 states have (on average 1.2458333333333333) internal successors, (299), 241 states have internal predecessors, (299), 98 states have call successors, (98), 18 states have call predecessors, (98), 18 states have return successors, (98), 97 states have call predecessors, (98), 98 states have call successors, (98) [2023-12-20 23:21:03,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 495 transitions. [2023-12-20 23:21:03,239 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 495 transitions. Word has length 120 [2023-12-20 23:21:03,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 23:21:03,239 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 495 transitions. [2023-12-20 23:21:03,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-20 23:21:03,239 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 495 transitions. [2023-12-20 23:21:03,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-20 23:21:03,240 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 23:21:03,240 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 23:21:03,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-20 23:21:03,240 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 23:21:03,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 23:21:03,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1449475968, now seen corresponding path program 1 times [2023-12-20 23:21:03,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 23:21:03,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69603908] [2023-12-20 23:21:03,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 23:21:03,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 23:21:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:23:01,604 WARN L293 SmtUtils]: Spent 8.27s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-20 23:23:20,448 WARN L293 SmtUtils]: Spent 9.21s on a formula simplification. DAG size of input: 175 DAG size of output: 145 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 23:23:20,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 23:23:20,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:23:20,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 23:23:20,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:23:20,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 23:23:20,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:23:20,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 23:23:20,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:23:20,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 23:23:20,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:23:20,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 23:23:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:23:20,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 23:23:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:23:20,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 23:23:20,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:23:20,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 23:23:20,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:23:20,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 23:23:20,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:23:20,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 23:23:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:23:20,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 23:23:20,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:23:20,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 23:23:20,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:23:20,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 23:23:20,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:23:20,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 23:23:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:23:20,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 23:23:20,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:23:20,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 23:23:20,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:23:20,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-20 23:23:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:23:20,508 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-20 23:23:20,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 23:23:20,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69603908] [2023-12-20 23:23:20,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69603908] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 23:23:20,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 23:23:20,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-12-20 23:23:20,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353213043] [2023-12-20 23:23:20,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 23:23:20,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-20 23:23:20,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 23:23:20,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-20 23:23:20,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-12-20 23:23:20,510 INFO L87 Difference]: Start difference. First operand 357 states and 495 transitions. Second operand has 15 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-20 23:23:30,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 23:23:34,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 23:23:38,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 23:23:40,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 23:23:42,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 23:23:42,960 INFO L93 Difference]: Finished difference Result 769 states and 1061 transitions. [2023-12-20 23:23:42,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-12-20 23:23:42,960 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 120 [2023-12-20 23:23:42,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 23:23:42,962 INFO L225 Difference]: With dead ends: 769 [2023-12-20 23:23:42,962 INFO L226 Difference]: Without dead ends: 531 [2023-12-20 23:23:42,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=406, Invalid=1486, Unknown=0, NotChecked=0, Total=1892 [2023-12-20 23:23:42,964 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 651 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 148 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.2s IncrementalHoareTripleChecker+Time [2023-12-20 23:23:42,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 474 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 684 Invalid, 3 Unknown, 0 Unchecked, 15.2s Time] [2023-12-20 23:23:42,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2023-12-20 23:23:42,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 392. [2023-12-20 23:23:42,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 275 states have (on average 1.2727272727272727) internal successors, (350), 276 states have internal predecessors, (350), 98 states have call successors, (98), 18 states have call predecessors, (98), 18 states have return successors, (98), 97 states have call predecessors, (98), 98 states have call successors, (98) [2023-12-20 23:23:42,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 546 transitions. [2023-12-20 23:23:42,992 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 546 transitions. Word has length 120 [2023-12-20 23:23:42,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 23:23:42,993 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 546 transitions. [2023-12-20 23:23:42,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2) internal successors, (33), 15 states have internal predecessors, (33), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-20 23:23:42,993 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 546 transitions. [2023-12-20 23:23:42,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-20 23:23:42,994 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 23:23:42,994 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 23:23:42,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-20 23:23:42,994 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 23:23:42,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 23:23:42,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1017307518, now seen corresponding path program 1 times [2023-12-20 23:23:42,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 23:23:42,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449848726] [2023-12-20 23:23:42,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 23:23:42,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 23:23:43,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2023-12-20 23:23:45,926 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-20 23:23:45,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-20 23:23:45,927 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 121 with TraceHistMax 18,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∧-4-3-5-3-7-4-5-5-3-3-2-4-2-2-2-2-2-2-2-2-2-4-2-3-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-24-5-3-5-3-4-2-4-2-3-2-2-2-2-2-3-2-2-2-1 context. [2023-12-20 23:23:45,930 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 23:23:45,931 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 23:23:45,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 11:23:45 BoogieIcfgContainer [2023-12-20 23:23:45,933 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 23:23:45,933 INFO L158 Benchmark]: Toolchain (without parser) took 861063.48ms. Allocated memory was 370.1MB in the beginning and 1.2GB in the end (delta: 843.1MB). Free memory was 317.8MB in the beginning and 478.1MB in the end (delta: -160.3MB). Peak memory consumption was 684.0MB. Max. memory is 8.0GB. [2023-12-20 23:23:45,933 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 240.1MB. Free memory was 189.5MB in the beginning and 189.4MB in the end (delta: 107.9kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 23:23:45,933 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.65ms. Allocated memory is still 370.1MB. Free memory was 317.8MB in the beginning and 303.3MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-20 23:23:45,934 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.75ms. Allocated memory is still 370.1MB. Free memory was 303.3MB in the beginning and 298.9MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-20 23:23:45,934 INFO L158 Benchmark]: Boogie Preprocessor took 43.11ms. Allocated memory is still 370.1MB. Free memory was 298.9MB in the beginning and 291.6MB in the end (delta: 7.4MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2023-12-20 23:23:45,934 INFO L158 Benchmark]: RCFGBuilder took 437.93ms. Allocated memory is still 370.1MB. Free memory was 291.6MB in the beginning and 266.8MB in the end (delta: 24.8MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-12-20 23:23:45,934 INFO L158 Benchmark]: TraceAbstraction took 860280.89ms. Allocated memory was 370.1MB in the beginning and 1.2GB in the end (delta: 843.1MB). Free memory was 266.1MB in the beginning and 478.1MB in the end (delta: -212.0MB). Peak memory consumption was 633.6MB. Max. memory is 8.0GB. [2023-12-20 23:23:45,937 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks [2023-12-20 23:23:45,940 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 240.1MB. Free memory was 189.5MB in the beginning and 189.4MB in the end (delta: 107.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 218.65ms. Allocated memory is still 370.1MB. Free memory was 317.8MB in the beginning and 303.3MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 78.75ms. Allocated memory is still 370.1MB. Free memory was 303.3MB in the beginning and 298.9MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.11ms. Allocated memory is still 370.1MB. Free memory was 298.9MB in the beginning and 291.6MB in the end (delta: 7.4MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * RCFGBuilder took 437.93ms. Allocated memory is still 370.1MB. Free memory was 291.6MB in the beginning and 266.8MB in the end (delta: 24.8MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 860280.89ms. Allocated memory was 370.1MB in the beginning and 1.2GB in the end (delta: 843.1MB). Free memory was 266.1MB in the beginning and 478.1MB in the end (delta: -212.0MB). Peak memory consumption was 633.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while NwaCegarLoop was analyzing trace of length 121 with TraceHistMax 18,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PolyPacSimplificationTermWalker was simplifying a ∧-4-3-5-3-7-4-5-5-3-3-2-4-2-2-2-2-2-2-2-2-2-4-2-3-2-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-24-5-3-5-3-4-2-4-2-3-2-2-2-2-2-3-2-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 860.2s, OverallIterations: 15, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 92.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 11 mSolverCounterUnknown, 3756 SdHoareTripleChecker+Valid, 59.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3756 mSDsluCounter, 5751 SdHoareTripleChecker+Invalid, 58.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4567 mSDsCounter, 884 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6425 IncrementalHoareTripleChecker+Invalid, 7320 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 884 mSolverCounterUnsat, 1184 mSDtfsCounter, 6425 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 918 GetRequests, 618 SyntacticMatches, 1 SemanticMatches, 299 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1739 ImplicationChecksByTransitivity, 80.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=392occurred in iteration=14, InterpolantAutomatonStates: 255, 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, 14 MinimizatonAttempts, 1095 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 763.4s InterpolantComputationTime, 1667 NumberOfCodeBlocks, 1667 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1653 ConstructedInterpolants, 0 QuantifiedInterpolants, 35538 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 8568/8568 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: Timeout Completed graceful shutdown