/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-64bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w128_d16_e0.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 19:18:19,318 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 19:18:19,371 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2023-12-16 19:18:19,375 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 19:18:19,375 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 19:18:19,395 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 19:18:19,396 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 19:18:19,396 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 19:18:19,397 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 19:18:19,397 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 19:18:19,397 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 19:18:19,398 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 19:18:19,398 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 19:18:19,399 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 19:18:19,399 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 19:18:19,399 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 19:18:19,400 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 19:18:19,400 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 19:18:19,401 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 19:18:19,401 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 19:18:19,401 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 19:18:19,402 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 19:18:19,402 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 19:18:19,403 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 19:18:19,403 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 19:18:19,403 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 19:18:19,404 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 19:18:19,404 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 19:18:19,404 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 19:18:19,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 19:18:19,405 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 19:18:19,405 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 19:18:19,405 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 19:18:19,406 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 19:18:19,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 19:18:19,406 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 19:18:19,406 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 19:18:19,407 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 19:18:19,407 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 19:18:19,407 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 19:18:19,407 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-16 19:18:19,576 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 19:18:19,589 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 19:18:19,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 19:18:19,592 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 19:18:19,592 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 19:18:19,593 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w128_d16_e0.c [2023-12-16 19:18:20,787 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 19:18:20,992 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 19:18:20,993 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w128_d16_e0.c [2023-12-16 19:18:21,004 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/689925559/a8eacfecb0c74493a77d22468f0fe793/FLAG20de386b5 [2023-12-16 19:18:21,016 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/689925559/a8eacfecb0c74493a77d22468f0fe793 [2023-12-16 19:18:21,018 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 19:18:21,019 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 19:18:21,019 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 19:18:21,019 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 19:18:21,023 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 19:18:21,023 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:18:21" (1/1) ... [2023-12-16 19:18:21,024 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f46f6cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:18:21, skipping insertion in model container [2023-12-16 19:18:21,024 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:18:21" (1/1) ... [2023-12-16 19:18:21,068 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 19:18:21,182 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w128_d16_e0.c[1335,1348] [2023-12-16 19:18:21,357 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 19:18:21,364 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 19:18:21,371 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w128_d16_e0.c[1335,1348] [2023-12-16 19:18:21,473 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 19:18:21,491 INFO L206 MainTranslator]: Completed translation [2023-12-16 19:18:21,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:18:21 WrapperNode [2023-12-16 19:18:21,491 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 19:18:21,492 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 19:18:21,492 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 19:18:21,492 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 19:18:21,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:18:21" (1/1) ... [2023-12-16 19:18:21,533 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:18:21" (1/1) ... [2023-12-16 19:18:21,711 INFO L138 Inliner]: procedures = 18, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2185 [2023-12-16 19:18:21,711 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 19:18:21,712 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 19:18:21,712 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 19:18:21,712 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 19:18:21,720 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:18:21" (1/1) ... [2023-12-16 19:18:21,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:18:21" (1/1) ... [2023-12-16 19:18:21,755 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:18:21" (1/1) ... [2023-12-16 19:18:21,874 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-16 19:18:21,874 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:18:21" (1/1) ... [2023-12-16 19:18:21,874 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:18:21" (1/1) ... [2023-12-16 19:18:21,943 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:18:21" (1/1) ... [2023-12-16 19:18:21,959 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:18:21" (1/1) ... [2023-12-16 19:18:21,979 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:18:21" (1/1) ... [2023-12-16 19:18:21,991 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:18:21" (1/1) ... [2023-12-16 19:18:22,027 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 19:18:22,028 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 19:18:22,028 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 19:18:22,028 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 19:18:22,029 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:18:21" (1/1) ... [2023-12-16 19:18:22,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 19:18:22,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 19:18:22,051 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-16 19:18:22,069 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-16 19:18:22,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 19:18:22,081 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 19:18:22,081 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 19:18:22,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 19:18:22,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 19:18:22,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 19:18:22,292 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 19:18:22,295 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 19:18:23,417 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 19:18:23,455 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 19:18:23,455 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 19:18:23,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:18:23 BoogieIcfgContainer [2023-12-16 19:18:23,456 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 19:18:23,457 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 19:18:23,458 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 19:18:23,460 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 19:18:23,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 07:18:21" (1/3) ... [2023-12-16 19:18:23,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1984145 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:18:23, skipping insertion in model container [2023-12-16 19:18:23,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:18:21" (2/3) ... [2023-12-16 19:18:23,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1984145 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:18:23, skipping insertion in model container [2023-12-16 19:18:23,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:18:23" (3/3) ... [2023-12-16 19:18:23,462 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w128_d16_e0.c [2023-12-16 19:18:23,474 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 19:18:23,474 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 19:18:23,511 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 19:18:23,515 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;@23200bc9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 19:18:23,515 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 19:18:23,520 INFO L276 IsEmpty]: Start isEmpty. Operand has 417 states, 411 states have (on average 1.659367396593674) internal successors, (682), 412 states have internal predecessors, (682), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:18:23,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-16 19:18:23,531 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:23,532 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:23,532 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:23,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:23,536 INFO L85 PathProgramCache]: Analyzing trace with hash -2084022898, now seen corresponding path program 1 times [2023-12-16 19:18:23,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:23,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591864407] [2023-12-16 19:18:23,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:23,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:23,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:23,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:18:23,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:23,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:18:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:23,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 19:18:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:23,817 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:18:23,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:23,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591864407] [2023-12-16 19:18:23,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591864407] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:23,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:23,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 19:18:23,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737212358] [2023-12-16 19:18:23,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:23,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 19:18:23,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:23,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 19:18:23,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 19:18:23,853 INFO L87 Difference]: Start difference. First operand has 417 states, 411 states have (on average 1.659367396593674) internal successors, (682), 412 states have internal predecessors, (682), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 68.0) internal successors, (136), 2 states have internal predecessors, (136), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 19:18:23,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:23,914 INFO L93 Difference]: Finished difference Result 756 states and 1252 transitions. [2023-12-16 19:18:23,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 19:18:23,918 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 68.0) internal successors, (136), 2 states have internal predecessors, (136), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 148 [2023-12-16 19:18:23,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:23,932 INFO L225 Difference]: With dead ends: 756 [2023-12-16 19:18:23,932 INFO L226 Difference]: Without dead ends: 415 [2023-12-16 19:18:23,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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-16 19:18:23,949 INFO L413 NwaCegarLoop]: 682 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:23,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 682 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:18:23,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2023-12-16 19:18:23,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2023-12-16 19:18:23,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 410 states have (on average 1.6512195121951219) internal successors, (677), 410 states have internal predecessors, (677), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:18:24,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 683 transitions. [2023-12-16 19:18:24,003 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 683 transitions. Word has length 148 [2023-12-16 19:18:24,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:24,003 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 683 transitions. [2023-12-16 19:18:24,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 68.0) internal successors, (136), 2 states have internal predecessors, (136), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 19:18:24,004 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 683 transitions. [2023-12-16 19:18:24,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-16 19:18:24,008 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:24,008 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:24,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 19:18:24,008 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:24,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:24,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1512221496, now seen corresponding path program 1 times [2023-12-16 19:18:24,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:24,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699369158] [2023-12-16 19:18:24,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:24,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:24,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:18:24,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:24,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:18:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:24,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 19:18:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:24,757 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:18:24,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:24,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699369158] [2023-12-16 19:18:24,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699369158] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:24,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:24,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:18:24,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180648904] [2023-12-16 19:18:24,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:24,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:18:24,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:24,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:18:24,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:18:24,764 INFO L87 Difference]: Start difference. First operand 415 states and 683 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:24,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:24,804 INFO L93 Difference]: Finished difference Result 419 states and 687 transitions. [2023-12-16 19:18:24,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:24,804 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 148 [2023-12-16 19:18:24,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:24,807 INFO L225 Difference]: With dead ends: 419 [2023-12-16 19:18:24,807 INFO L226 Difference]: Without dead ends: 417 [2023-12-16 19:18:24,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:18:24,808 INFO L413 NwaCegarLoop]: 680 mSDtfsCounter, 1 mSDsluCounter, 1355 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2035 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:24,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2035 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:18:24,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2023-12-16 19:18:24,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2023-12-16 19:18:24,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 412 states have (on average 1.6480582524271845) internal successors, (679), 412 states have internal predecessors, (679), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:18:24,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 685 transitions. [2023-12-16 19:18:24,830 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 685 transitions. Word has length 148 [2023-12-16 19:18:24,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:24,832 INFO L495 AbstractCegarLoop]: Abstraction has 417 states and 685 transitions. [2023-12-16 19:18:24,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:24,832 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 685 transitions. [2023-12-16 19:18:24,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-16 19:18:24,837 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:24,838 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:24,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 19:18:24,838 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:24,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:24,839 INFO L85 PathProgramCache]: Analyzing trace with hash 367499590, now seen corresponding path program 1 times [2023-12-16 19:18:24,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:24,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661917566] [2023-12-16 19:18:24,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:24,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:24,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:25,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:18:25,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:25,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:18:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:25,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 19:18:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:25,261 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:18:25,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:25,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661917566] [2023-12-16 19:18:25,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661917566] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:25,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:25,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:25,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077743796] [2023-12-16 19:18:25,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:25,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:25,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:25,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:25,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:25,263 INFO L87 Difference]: Start difference. First operand 417 states and 685 transitions. Second operand has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:25,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:25,633 INFO L93 Difference]: Finished difference Result 1056 states and 1726 transitions. [2023-12-16 19:18:25,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:18:25,634 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 149 [2023-12-16 19:18:25,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:25,637 INFO L225 Difference]: With dead ends: 1056 [2023-12-16 19:18:25,637 INFO L226 Difference]: Without dead ends: 417 [2023-12-16 19:18:25,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 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-16 19:18:25,643 INFO L413 NwaCegarLoop]: 715 mSDtfsCounter, 1353 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1353 SdHoareTripleChecker+Valid, 1963 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:25,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1353 Valid, 1963 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 19:18:25,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2023-12-16 19:18:25,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2023-12-16 19:18:25,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 412 states have (on average 1.645631067961165) internal successors, (678), 412 states have internal predecessors, (678), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:18:25,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 684 transitions. [2023-12-16 19:18:25,655 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 684 transitions. Word has length 149 [2023-12-16 19:18:25,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:25,656 INFO L495 AbstractCegarLoop]: Abstraction has 417 states and 684 transitions. [2023-12-16 19:18:25,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.4) internal successors, (137), 5 states have internal predecessors, (137), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:25,656 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 684 transitions. [2023-12-16 19:18:25,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-16 19:18:25,657 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:25,657 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:25,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 19:18:25,658 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:25,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:25,658 INFO L85 PathProgramCache]: Analyzing trace with hash 719872988, now seen corresponding path program 1 times [2023-12-16 19:18:25,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:25,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611859253] [2023-12-16 19:18:25,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:25,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:25,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:25,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:18:25,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:25,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:18:25,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:26,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 19:18:26,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:26,003 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:18:26,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:26,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611859253] [2023-12-16 19:18:26,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611859253] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:26,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:26,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:18:26,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928031909] [2023-12-16 19:18:26,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:26,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:18:26,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:26,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:18:26,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:18:26,005 INFO L87 Difference]: Start difference. First operand 417 states and 684 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:26,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:26,030 INFO L93 Difference]: Finished difference Result 761 states and 1246 transitions. [2023-12-16 19:18:26,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:26,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 150 [2023-12-16 19:18:26,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:26,032 INFO L225 Difference]: With dead ends: 761 [2023-12-16 19:18:26,032 INFO L226 Difference]: Without dead ends: 420 [2023-12-16 19:18:26,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:18:26,049 INFO L413 NwaCegarLoop]: 679 mSDtfsCounter, 1 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2030 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:26,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2030 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:18:26,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2023-12-16 19:18:26,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 419. [2023-12-16 19:18:26,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.642512077294686) internal successors, (680), 414 states have internal predecessors, (680), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:18:26,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 686 transitions. [2023-12-16 19:18:26,057 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 686 transitions. Word has length 150 [2023-12-16 19:18:26,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:26,057 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 686 transitions. [2023-12-16 19:18:26,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:26,057 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 686 transitions. [2023-12-16 19:18:26,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-16 19:18:26,058 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:26,058 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:26,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 19:18:26,058 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:26,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:26,059 INFO L85 PathProgramCache]: Analyzing trace with hash 630794444, now seen corresponding path program 1 times [2023-12-16 19:18:26,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:26,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490921106] [2023-12-16 19:18:26,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:26,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:26,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:26,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:18:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:26,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:18:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:26,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 19:18:26,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:26,538 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:18:26,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:26,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490921106] [2023-12-16 19:18:26,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490921106] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:26,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:26,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:18:26,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284444945] [2023-12-16 19:18:26,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:26,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:18:26,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:26,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:18:26,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:18:26,541 INFO L87 Difference]: Start difference. First operand 419 states and 686 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:26,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:26,656 INFO L93 Difference]: Finished difference Result 762 states and 1246 transitions. [2023-12-16 19:18:26,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:26,657 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 151 [2023-12-16 19:18:26,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:26,658 INFO L225 Difference]: With dead ends: 762 [2023-12-16 19:18:26,659 INFO L226 Difference]: Without dead ends: 419 [2023-12-16 19:18:26,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:26,660 INFO L413 NwaCegarLoop]: 615 mSDtfsCounter, 558 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:26,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 1232 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:18:26,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-12-16 19:18:26,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2023-12-16 19:18:26,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.6376811594202898) internal successors, (678), 414 states have internal predecessors, (678), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:18:26,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 684 transitions. [2023-12-16 19:18:26,670 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 684 transitions. Word has length 151 [2023-12-16 19:18:26,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:26,671 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 684 transitions. [2023-12-16 19:18:26,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:26,671 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 684 transitions. [2023-12-16 19:18:26,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-16 19:18:26,672 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:26,672 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:26,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 19:18:26,672 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:26,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:26,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1200318974, now seen corresponding path program 1 times [2023-12-16 19:18:26,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:26,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886081186] [2023-12-16 19:18:26,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:26,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:26,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:26,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:18:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:26,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:18:26,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:26,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 19:18:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:26,931 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:18:26,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:26,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886081186] [2023-12-16 19:18:26,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886081186] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:26,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:26,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:26,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994553978] [2023-12-16 19:18:26,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:26,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:26,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:26,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:26,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:26,933 INFO L87 Difference]: Start difference. First operand 419 states and 684 transitions. Second operand has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:27,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:27,051 INFO L93 Difference]: Finished difference Result 770 states and 1253 transitions. [2023-12-16 19:18:27,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:18:27,052 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 152 [2023-12-16 19:18:27,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:27,053 INFO L225 Difference]: With dead ends: 770 [2023-12-16 19:18:27,053 INFO L226 Difference]: Without dead ends: 419 [2023-12-16 19:18:27,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 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-16 19:18:27,055 INFO L413 NwaCegarLoop]: 670 mSDtfsCounter, 575 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 1960 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:27,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 1960 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:18:27,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-12-16 19:18:27,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2023-12-16 19:18:27,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.6352657004830917) internal successors, (677), 414 states have internal predecessors, (677), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:18:27,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 683 transitions. [2023-12-16 19:18:27,065 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 683 transitions. Word has length 152 [2023-12-16 19:18:27,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:27,065 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 683 transitions. [2023-12-16 19:18:27,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.0) internal successors, (140), 5 states have internal predecessors, (140), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:27,065 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 683 transitions. [2023-12-16 19:18:27,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-16 19:18:27,066 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:27,066 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:27,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 19:18:27,066 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:27,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:27,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1243525774, now seen corresponding path program 1 times [2023-12-16 19:18:27,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:27,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617911310] [2023-12-16 19:18:27,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:27,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:27,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:18:27,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:27,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:18:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:27,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 19:18:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:27,385 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:18:27,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:27,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617911310] [2023-12-16 19:18:27,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617911310] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:27,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:27,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:27,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834142068] [2023-12-16 19:18:27,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:27,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:27,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:27,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:27,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:27,389 INFO L87 Difference]: Start difference. First operand 419 states and 683 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:27,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:27,516 INFO L93 Difference]: Finished difference Result 762 states and 1240 transitions. [2023-12-16 19:18:27,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:27,516 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 153 [2023-12-16 19:18:27,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:27,518 INFO L225 Difference]: With dead ends: 762 [2023-12-16 19:18:27,518 INFO L226 Difference]: Without dead ends: 419 [2023-12-16 19:18:27,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:18:27,519 INFO L413 NwaCegarLoop]: 615 mSDtfsCounter, 1228 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1231 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:27,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1231 Valid, 1232 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:18:27,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-12-16 19:18:27,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2023-12-16 19:18:27,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.6328502415458936) internal successors, (676), 414 states have internal predecessors, (676), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:18:27,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 682 transitions. [2023-12-16 19:18:27,526 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 682 transitions. Word has length 153 [2023-12-16 19:18:27,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:27,526 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 682 transitions. [2023-12-16 19:18:27,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:27,527 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 682 transitions. [2023-12-16 19:18:27,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-16 19:18:27,527 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:27,528 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:27,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 19:18:27,528 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:27,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:27,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1999074332, now seen corresponding path program 1 times [2023-12-16 19:18:27,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:27,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983858405] [2023-12-16 19:18:27,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:27,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:27,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:18:27,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:27,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:18:27,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:27,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 19:18:27,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:27,749 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:18:27,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:27,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983858405] [2023-12-16 19:18:27,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983858405] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:27,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:27,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:27,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290321081] [2023-12-16 19:18:27,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:27,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:27,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:27,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:27,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:27,751 INFO L87 Difference]: Start difference. First operand 419 states and 682 transitions. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:27,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:27,878 INFO L93 Difference]: Finished difference Result 762 states and 1238 transitions. [2023-12-16 19:18:27,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:27,879 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 154 [2023-12-16 19:18:27,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:27,880 INFO L225 Difference]: With dead ends: 762 [2023-12-16 19:18:27,880 INFO L226 Difference]: Without dead ends: 419 [2023-12-16 19:18:27,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:18:27,881 INFO L413 NwaCegarLoop]: 615 mSDtfsCounter, 1220 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1223 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:27,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1223 Valid, 1232 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:18:27,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-12-16 19:18:27,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2023-12-16 19:18:27,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.6304347826086956) internal successors, (675), 414 states have internal predecessors, (675), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:18:27,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 681 transitions. [2023-12-16 19:18:27,888 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 681 transitions. Word has length 154 [2023-12-16 19:18:27,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:27,889 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 681 transitions. [2023-12-16 19:18:27,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:27,889 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 681 transitions. [2023-12-16 19:18:27,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-16 19:18:27,890 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:27,890 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:27,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 19:18:27,890 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:27,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:27,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1231327080, now seen corresponding path program 1 times [2023-12-16 19:18:27,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:27,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520372067] [2023-12-16 19:18:27,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:27,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:27,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:28,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:18:28,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:28,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:18:28,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:28,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 19:18:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:28,126 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:18:28,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:28,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520372067] [2023-12-16 19:18:28,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520372067] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:28,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:28,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:28,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438718489] [2023-12-16 19:18:28,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:28,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:28,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:28,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:28,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:28,128 INFO L87 Difference]: Start difference. First operand 419 states and 681 transitions. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:28,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:28,227 INFO L93 Difference]: Finished difference Result 762 states and 1236 transitions. [2023-12-16 19:18:28,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:28,228 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 155 [2023-12-16 19:18:28,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:28,230 INFO L225 Difference]: With dead ends: 762 [2023-12-16 19:18:28,230 INFO L226 Difference]: Without dead ends: 419 [2023-12-16 19:18:28,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:18:28,231 INFO L413 NwaCegarLoop]: 615 mSDtfsCounter, 1212 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1215 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:28,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1215 Valid, 1232 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:18:28,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-12-16 19:18:28,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2023-12-16 19:18:28,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.6280193236714975) internal successors, (674), 414 states have internal predecessors, (674), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:18:28,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 680 transitions. [2023-12-16 19:18:28,237 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 680 transitions. Word has length 155 [2023-12-16 19:18:28,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:28,238 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 680 transitions. [2023-12-16 19:18:28,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:28,238 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 680 transitions. [2023-12-16 19:18:28,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-12-16 19:18:28,239 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:28,239 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:28,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-16 19:18:28,239 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:28,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:28,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1388087094, now seen corresponding path program 1 times [2023-12-16 19:18:28,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:28,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991182006] [2023-12-16 19:18:28,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:28,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:28,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:18:28,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:28,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:18:28,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:28,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 19:18:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:28,460 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:18:28,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:28,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991182006] [2023-12-16 19:18:28,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991182006] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:28,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:28,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:28,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104992791] [2023-12-16 19:18:28,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:28,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:28,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:28,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:28,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:28,461 INFO L87 Difference]: Start difference. First operand 419 states and 680 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:28,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:28,570 INFO L93 Difference]: Finished difference Result 762 states and 1234 transitions. [2023-12-16 19:18:28,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:28,570 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 156 [2023-12-16 19:18:28,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:28,572 INFO L225 Difference]: With dead ends: 762 [2023-12-16 19:18:28,572 INFO L226 Difference]: Without dead ends: 419 [2023-12-16 19:18:28,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:18:28,573 INFO L413 NwaCegarLoop]: 615 mSDtfsCounter, 1198 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1201 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:28,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1201 Valid, 1232 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:18:28,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-12-16 19:18:28,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2023-12-16 19:18:28,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.6256038647342994) internal successors, (673), 414 states have internal predecessors, (673), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:18:28,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 679 transitions. [2023-12-16 19:18:28,580 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 679 transitions. Word has length 156 [2023-12-16 19:18:28,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:28,580 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 679 transitions. [2023-12-16 19:18:28,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:28,581 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 679 transitions. [2023-12-16 19:18:28,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-16 19:18:28,581 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:28,581 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:28,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 19:18:28,582 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:28,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:28,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1181363932, now seen corresponding path program 1 times [2023-12-16 19:18:28,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:28,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530000576] [2023-12-16 19:18:28,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:28,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:28,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:18:28,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:28,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:18:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:28,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 19:18:28,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:28,876 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:18:28,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:28,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530000576] [2023-12-16 19:18:28,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530000576] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:28,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:28,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:28,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568598508] [2023-12-16 19:18:28,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:28,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:28,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:28,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:28,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:28,878 INFO L87 Difference]: Start difference. First operand 419 states and 679 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:28,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:28,996 INFO L93 Difference]: Finished difference Result 762 states and 1232 transitions. [2023-12-16 19:18:28,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:28,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 157 [2023-12-16 19:18:28,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:28,998 INFO L225 Difference]: With dead ends: 762 [2023-12-16 19:18:28,998 INFO L226 Difference]: Without dead ends: 419 [2023-12-16 19:18:28,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:18:28,999 INFO L413 NwaCegarLoop]: 615 mSDtfsCounter, 650 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:28,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 1238 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:18:29,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-12-16 19:18:29,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2023-12-16 19:18:29,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.6231884057971016) internal successors, (672), 414 states have internal predecessors, (672), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:18:29,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 678 transitions. [2023-12-16 19:18:29,008 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 678 transitions. Word has length 157 [2023-12-16 19:18:29,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:29,008 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 678 transitions. [2023-12-16 19:18:29,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:29,009 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 678 transitions. [2023-12-16 19:18:29,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2023-12-16 19:18:29,010 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:29,010 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:29,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-16 19:18:29,010 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:29,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:29,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1144499044, now seen corresponding path program 1 times [2023-12-16 19:18:29,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:29,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291773079] [2023-12-16 19:18:29,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:29,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:29,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:18:29,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:29,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:18:29,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:29,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 19:18:29,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:29,256 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:18:29,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:29,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291773079] [2023-12-16 19:18:29,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291773079] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:29,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:29,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:29,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265068751] [2023-12-16 19:18:29,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:29,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:29,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:29,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:29,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:29,258 INFO L87 Difference]: Start difference. First operand 419 states and 678 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:29,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:29,364 INFO L93 Difference]: Finished difference Result 762 states and 1230 transitions. [2023-12-16 19:18:29,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:29,365 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 158 [2023-12-16 19:18:29,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:29,366 INFO L225 Difference]: With dead ends: 762 [2023-12-16 19:18:29,366 INFO L226 Difference]: Without dead ends: 419 [2023-12-16 19:18:29,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:18:29,367 INFO L413 NwaCegarLoop]: 615 mSDtfsCounter, 646 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:29,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 1238 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:18:29,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-12-16 19:18:29,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2023-12-16 19:18:29,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.6207729468599035) internal successors, (671), 414 states have internal predecessors, (671), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:18:29,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 677 transitions. [2023-12-16 19:18:29,374 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 677 transitions. Word has length 158 [2023-12-16 19:18:29,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:29,375 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 677 transitions. [2023-12-16 19:18:29,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:29,375 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 677 transitions. [2023-12-16 19:18:29,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-12-16 19:18:29,376 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:29,376 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:29,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-16 19:18:29,376 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:29,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:29,377 INFO L85 PathProgramCache]: Analyzing trace with hash 262897334, now seen corresponding path program 1 times [2023-12-16 19:18:29,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:29,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630120917] [2023-12-16 19:18:29,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:29,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:29,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:29,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:18:29,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:29,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:18:29,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:29,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 19:18:29,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:29,700 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:18:29,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:29,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630120917] [2023-12-16 19:18:29,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630120917] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:29,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:29,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:18:29,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25261273] [2023-12-16 19:18:29,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:29,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:18:29,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:29,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:18:29,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:18:29,702 INFO L87 Difference]: Start difference. First operand 419 states and 677 transitions. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:29,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:29,771 INFO L93 Difference]: Finished difference Result 762 states and 1228 transitions. [2023-12-16 19:18:29,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:29,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 159 [2023-12-16 19:18:29,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:29,773 INFO L225 Difference]: With dead ends: 762 [2023-12-16 19:18:29,773 INFO L226 Difference]: Without dead ends: 419 [2023-12-16 19:18:29,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:29,774 INFO L413 NwaCegarLoop]: 638 mSDtfsCounter, 567 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 1278 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:29,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 1278 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:18:29,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-12-16 19:18:29,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2023-12-16 19:18:29,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.6183574879227054) internal successors, (670), 414 states have internal predecessors, (670), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:18:29,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 676 transitions. [2023-12-16 19:18:29,782 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 676 transitions. Word has length 159 [2023-12-16 19:18:29,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:29,782 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 676 transitions. [2023-12-16 19:18:29,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:29,783 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 676 transitions. [2023-12-16 19:18:29,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2023-12-16 19:18:29,783 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:29,784 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:29,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-16 19:18:29,784 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:29,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:29,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1754682790, now seen corresponding path program 1 times [2023-12-16 19:18:29,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:29,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323174505] [2023-12-16 19:18:29,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:29,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:29,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:30,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:18:30,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:30,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:18:30,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:30,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 19:18:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:30,007 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:18:30,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:30,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323174505] [2023-12-16 19:18:30,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323174505] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:30,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:30,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:30,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286349975] [2023-12-16 19:18:30,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:30,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:30,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:30,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:30,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:30,009 INFO L87 Difference]: Start difference. First operand 419 states and 676 transitions. Second operand has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:30,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:30,079 INFO L93 Difference]: Finished difference Result 762 states and 1226 transitions. [2023-12-16 19:18:30,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:30,080 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 160 [2023-12-16 19:18:30,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:30,081 INFO L225 Difference]: With dead ends: 762 [2023-12-16 19:18:30,082 INFO L226 Difference]: Without dead ends: 419 [2023-12-16 19:18:30,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:18:30,082 INFO L413 NwaCegarLoop]: 638 mSDtfsCounter, 662 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:30,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 1284 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:18:30,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-12-16 19:18:30,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2023-12-16 19:18:30,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.6159420289855073) internal successors, (669), 414 states have internal predecessors, (669), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:18:30,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 675 transitions. [2023-12-16 19:18:30,090 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 675 transitions. Word has length 160 [2023-12-16 19:18:30,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:30,091 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 675 transitions. [2023-12-16 19:18:30,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.6) internal successors, (148), 5 states have internal predecessors, (148), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:30,091 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 675 transitions. [2023-12-16 19:18:30,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-12-16 19:18:30,092 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:30,092 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:30,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-16 19:18:30,092 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:30,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:30,092 INFO L85 PathProgramCache]: Analyzing trace with hash 2099398416, now seen corresponding path program 1 times [2023-12-16 19:18:30,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:30,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695089110] [2023-12-16 19:18:30,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:30,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:30,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:18:30,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:30,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:18:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:30,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 19:18:30,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:30,311 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:18:30,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:30,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695089110] [2023-12-16 19:18:30,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695089110] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:30,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:30,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:30,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71429824] [2023-12-16 19:18:30,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:30,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:30,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:30,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:30,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:30,312 INFO L87 Difference]: Start difference. First operand 419 states and 675 transitions. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:30,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:30,384 INFO L93 Difference]: Finished difference Result 762 states and 1224 transitions. [2023-12-16 19:18:30,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:30,384 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 161 [2023-12-16 19:18:30,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:30,409 INFO L225 Difference]: With dead ends: 762 [2023-12-16 19:18:30,409 INFO L226 Difference]: Without dead ends: 419 [2023-12-16 19:18:30,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:18:30,410 INFO L413 NwaCegarLoop]: 638 mSDtfsCounter, 658 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:30,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 1284 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:18:30,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-12-16 19:18:30,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2023-12-16 19:18:30,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.6135265700483092) internal successors, (668), 414 states have internal predecessors, (668), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:18:30,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 674 transitions. [2023-12-16 19:18:30,418 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 674 transitions. Word has length 161 [2023-12-16 19:18:30,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:30,419 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 674 transitions. [2023-12-16 19:18:30,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:30,419 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 674 transitions. [2023-12-16 19:18:30,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-12-16 19:18:30,420 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:30,420 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:30,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-16 19:18:30,420 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:30,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:30,421 INFO L85 PathProgramCache]: Analyzing trace with hash 340116340, now seen corresponding path program 1 times [2023-12-16 19:18:30,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:30,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186289591] [2023-12-16 19:18:30,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:30,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:30,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:30,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:18:30,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:30,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:18:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:30,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 19:18:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:30,645 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:18:30,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:30,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186289591] [2023-12-16 19:18:30,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186289591] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:30,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:30,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:30,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295632995] [2023-12-16 19:18:30,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:30,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:30,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:30,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:30,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:30,647 INFO L87 Difference]: Start difference. First operand 419 states and 674 transitions. Second operand has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:30,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:30,712 INFO L93 Difference]: Finished difference Result 762 states and 1222 transitions. [2023-12-16 19:18:30,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:30,713 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 162 [2023-12-16 19:18:30,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:30,714 INFO L225 Difference]: With dead ends: 762 [2023-12-16 19:18:30,715 INFO L226 Difference]: Without dead ends: 419 [2023-12-16 19:18:30,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:18:30,715 INFO L413 NwaCegarLoop]: 638 mSDtfsCounter, 654 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:30,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 1284 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:18:30,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-12-16 19:18:30,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2023-12-16 19:18:30,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.6111111111111112) internal successors, (667), 414 states have internal predecessors, (667), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:18:30,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 673 transitions. [2023-12-16 19:18:30,724 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 673 transitions. Word has length 162 [2023-12-16 19:18:30,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:30,724 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 673 transitions. [2023-12-16 19:18:30,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:30,725 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 673 transitions. [2023-12-16 19:18:30,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-12-16 19:18:30,725 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:30,726 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:30,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-16 19:18:30,726 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:30,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:30,726 INFO L85 PathProgramCache]: Analyzing trace with hash 2020287594, now seen corresponding path program 1 times [2023-12-16 19:18:30,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:30,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379312017] [2023-12-16 19:18:30,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:30,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:30,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:31,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:18:31,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:31,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:18:31,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:31,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 19:18:31,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:31,155 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:18:31,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:31,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379312017] [2023-12-16 19:18:31,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379312017] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:31,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:31,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:18:31,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189852959] [2023-12-16 19:18:31,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:31,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:18:31,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:31,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:18:31,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:18:31,157 INFO L87 Difference]: Start difference. First operand 419 states and 673 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:31,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:31,198 INFO L93 Difference]: Finished difference Result 762 states and 1220 transitions. [2023-12-16 19:18:31,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:31,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 163 [2023-12-16 19:18:31,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:31,200 INFO L225 Difference]: With dead ends: 762 [2023-12-16 19:18:31,200 INFO L226 Difference]: Without dead ends: 419 [2023-12-16 19:18:31,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:31,201 INFO L413 NwaCegarLoop]: 650 mSDtfsCounter, 563 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:31,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 1302 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:18:31,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-12-16 19:18:31,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2023-12-16 19:18:31,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.606280193236715) internal successors, (665), 414 states have internal predecessors, (665), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:18:31,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 671 transitions. [2023-12-16 19:18:31,209 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 671 transitions. Word has length 163 [2023-12-16 19:18:31,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:31,209 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 671 transitions. [2023-12-16 19:18:31,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:31,210 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 671 transitions. [2023-12-16 19:18:31,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2023-12-16 19:18:31,211 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:31,211 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:31,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-16 19:18:31,211 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:31,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:31,211 INFO L85 PathProgramCache]: Analyzing trace with hash -101886540, now seen corresponding path program 1 times [2023-12-16 19:18:31,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:31,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774613667] [2023-12-16 19:18:31,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:31,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:31,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:31,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:18:31,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:31,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:18:31,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:31,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 19:18:31,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:31,464 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:18:31,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:31,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774613667] [2023-12-16 19:18:31,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774613667] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:31,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:31,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:31,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824448763] [2023-12-16 19:18:31,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:31,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:31,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:31,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:31,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:31,465 INFO L87 Difference]: Start difference. First operand 419 states and 671 transitions. Second operand has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:31,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:31,510 INFO L93 Difference]: Finished difference Result 764 states and 1218 transitions. [2023-12-16 19:18:31,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:18:31,510 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 164 [2023-12-16 19:18:31,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:31,511 INFO L225 Difference]: With dead ends: 764 [2023-12-16 19:18:31,512 INFO L226 Difference]: Without dead ends: 419 [2023-12-16 19:18:31,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 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-16 19:18:31,512 INFO L413 NwaCegarLoop]: 660 mSDtfsCounter, 568 mSDsluCounter, 1315 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 1975 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:31,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 1975 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:18:31,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-12-16 19:18:31,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2023-12-16 19:18:31,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.603864734299517) internal successors, (664), 414 states have internal predecessors, (664), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:18:31,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 670 transitions. [2023-12-16 19:18:31,522 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 670 transitions. Word has length 164 [2023-12-16 19:18:31,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:31,522 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 670 transitions. [2023-12-16 19:18:31,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:31,522 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 670 transitions. [2023-12-16 19:18:31,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-12-16 19:18:31,523 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:31,524 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:31,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-16 19:18:31,524 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:31,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:31,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1896541252, now seen corresponding path program 1 times [2023-12-16 19:18:31,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:31,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43890906] [2023-12-16 19:18:31,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:31,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:31,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:18:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:31,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 19:18:31,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:31,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 19:18:31,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:31,875 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:18:31,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:31,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43890906] [2023-12-16 19:18:31,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43890906] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:31,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:31,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:18:31,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112095813] [2023-12-16 19:18:31,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:31,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:18:31,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:31,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:18:31,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:18:31,878 INFO L87 Difference]: Start difference. First operand 419 states and 670 transitions. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 19:18:31,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:31,918 INFO L93 Difference]: Finished difference Result 762 states and 1214 transitions. [2023-12-16 19:18:31,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:31,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 165 [2023-12-16 19:18:31,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:31,920 INFO L225 Difference]: With dead ends: 762 [2023-12-16 19:18:31,920 INFO L226 Difference]: Without dead ends: 419 [2023-12-16 19:18:31,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:31,921 INFO L413 NwaCegarLoop]: 652 mSDtfsCounter, 601 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:31,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 1306 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:18:31,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-12-16 19:18:31,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2023-12-16 19:18:31,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.6014492753623188) internal successors, (663), 414 states have internal predecessors, (663), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:18:31,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 669 transitions. [2023-12-16 19:18:31,929 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 669 transitions. Word has length 165 [2023-12-16 19:18:31,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:31,929 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 669 transitions. [2023-12-16 19:18:31,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 19:18:31,929 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 669 transitions. [2023-12-16 19:18:31,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-12-16 19:18:31,930 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:31,930 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:31,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-16 19:18:31,931 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:31,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:31,931 INFO L85 PathProgramCache]: Analyzing trace with hash 2135894410, now seen corresponding path program 1 times [2023-12-16 19:18:31,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:31,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695401429] [2023-12-16 19:18:31,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:31,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:32,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:18:32,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:32,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 19:18:32,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:32,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-16 19:18:32,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:32,319 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:18:32,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:32,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695401429] [2023-12-16 19:18:32,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695401429] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:32,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:32,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:18:32,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220172971] [2023-12-16 19:18:32,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:32,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:18:32,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:32,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:18:32,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:18:32,321 INFO L87 Difference]: Start difference. First operand 419 states and 669 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 19:18:32,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:32,367 INFO L93 Difference]: Finished difference Result 762 states and 1212 transitions. [2023-12-16 19:18:32,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:32,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 166 [2023-12-16 19:18:32,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:32,369 INFO L225 Difference]: With dead ends: 762 [2023-12-16 19:18:32,369 INFO L226 Difference]: Without dead ends: 419 [2023-12-16 19:18:32,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:32,370 INFO L413 NwaCegarLoop]: 652 mSDtfsCounter, 598 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:32,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 1306 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:18:32,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-12-16 19:18:32,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2023-12-16 19:18:32,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.5990338164251208) internal successors, (662), 414 states have internal predecessors, (662), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:18:32,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 668 transitions. [2023-12-16 19:18:32,383 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 668 transitions. Word has length 166 [2023-12-16 19:18:32,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:32,383 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 668 transitions. [2023-12-16 19:18:32,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 19:18:32,384 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 668 transitions. [2023-12-16 19:18:32,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-12-16 19:18:32,385 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:32,385 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:32,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-16 19:18:32,385 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:32,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:32,386 INFO L85 PathProgramCache]: Analyzing trace with hash 828752012, now seen corresponding path program 1 times [2023-12-16 19:18:32,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:32,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293848580] [2023-12-16 19:18:32,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:32,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:32,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:32,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:18:32,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:32,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 19:18:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:32,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-16 19:18:32,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:32,734 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:18:32,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:32,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293848580] [2023-12-16 19:18:32,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293848580] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:32,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:32,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:18:32,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303817464] [2023-12-16 19:18:32,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:32,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:18:32,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:32,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:18:32,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:18:32,737 INFO L87 Difference]: Start difference. First operand 419 states and 668 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:32,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:32,776 INFO L93 Difference]: Finished difference Result 762 states and 1210 transitions. [2023-12-16 19:18:32,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:32,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 166 [2023-12-16 19:18:32,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:32,778 INFO L225 Difference]: With dead ends: 762 [2023-12-16 19:18:32,778 INFO L226 Difference]: Without dead ends: 419 [2023-12-16 19:18:32,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:32,779 INFO L413 NwaCegarLoop]: 648 mSDtfsCounter, 559 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:32,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 1298 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:18:32,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2023-12-16 19:18:32,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2023-12-16 19:18:32,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 414 states have (on average 1.5966183574879227) internal successors, (661), 414 states have internal predecessors, (661), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:18:32,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 667 transitions. [2023-12-16 19:18:32,790 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 667 transitions. Word has length 166 [2023-12-16 19:18:32,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:32,790 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 667 transitions. [2023-12-16 19:18:32,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:32,790 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 667 transitions. [2023-12-16 19:18:32,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-12-16 19:18:32,792 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:32,792 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:32,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-16 19:18:32,793 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:32,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:32,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1272652686, now seen corresponding path program 1 times [2023-12-16 19:18:32,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:32,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913728638] [2023-12-16 19:18:32,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:32,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:32,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:33,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:18:33,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:33,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 19:18:33,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:33,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-16 19:18:33,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:33,387 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:18:33,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:33,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913728638] [2023-12-16 19:18:33,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913728638] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:33,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:33,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:33,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127619150] [2023-12-16 19:18:33,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:33,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:33,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:33,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:33,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:33,390 INFO L87 Difference]: Start difference. First operand 419 states and 667 transitions. Second operand has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:33,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:33,566 INFO L93 Difference]: Finished difference Result 768 states and 1216 transitions. [2023-12-16 19:18:33,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:18:33,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 166 [2023-12-16 19:18:33,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:33,569 INFO L225 Difference]: With dead ends: 768 [2023-12-16 19:18:33,569 INFO L226 Difference]: Without dead ends: 423 [2023-12-16 19:18:33,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:18:33,570 INFO L413 NwaCegarLoop]: 657 mSDtfsCounter, 4 mSDsluCounter, 1819 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2476 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:33,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2476 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 19:18:33,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2023-12-16 19:18:33,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2023-12-16 19:18:33,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 416 states have (on average 1.59375) internal successors, (663), 416 states have internal predecessors, (663), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:18:33,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 669 transitions. [2023-12-16 19:18:33,579 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 669 transitions. Word has length 166 [2023-12-16 19:18:33,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:33,579 INFO L495 AbstractCegarLoop]: Abstraction has 421 states and 669 transitions. [2023-12-16 19:18:33,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.8) internal successors, (154), 5 states have internal predecessors, (154), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:33,580 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 669 transitions. [2023-12-16 19:18:33,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-16 19:18:33,581 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:33,581 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:33,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-16 19:18:33,581 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:33,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:33,581 INFO L85 PathProgramCache]: Analyzing trace with hash -2065717842, now seen corresponding path program 1 times [2023-12-16 19:18:33,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:33,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732053578] [2023-12-16 19:18:33,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:33,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:33,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:34,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:18:34,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:34,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 19:18:34,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:34,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-16 19:18:34,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:34,366 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:18:34,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:34,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732053578] [2023-12-16 19:18:34,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732053578] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:34,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:34,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:34,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433079245] [2023-12-16 19:18:34,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:34,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:34,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:34,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:34,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:34,368 INFO L87 Difference]: Start difference. First operand 421 states and 669 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:34,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:34,658 INFO L93 Difference]: Finished difference Result 768 states and 1215 transitions. [2023-12-16 19:18:34,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 19:18:34,658 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 167 [2023-12-16 19:18:34,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:34,660 INFO L225 Difference]: With dead ends: 768 [2023-12-16 19:18:34,660 INFO L226 Difference]: Without dead ends: 423 [2023-12-16 19:18:34,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:34,661 INFO L413 NwaCegarLoop]: 510 mSDtfsCounter, 566 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 566 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:34,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [566 Valid, 1519 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 19:18:34,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2023-12-16 19:18:34,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 422. [2023-12-16 19:18:34,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 417 states have (on average 1.592326139088729) internal successors, (664), 417 states have internal predecessors, (664), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:18:34,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 670 transitions. [2023-12-16 19:18:34,670 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 670 transitions. Word has length 167 [2023-12-16 19:18:34,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:34,671 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 670 transitions. [2023-12-16 19:18:34,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:34,671 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 670 transitions. [2023-12-16 19:18:34,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-16 19:18:34,672 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:34,672 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:34,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-16 19:18:34,673 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:34,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:34,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1505018064, now seen corresponding path program 1 times [2023-12-16 19:18:34,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:34,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695195094] [2023-12-16 19:18:34,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:34,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:34,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:34,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:18:34,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:34,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 19:18:34,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:34,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-16 19:18:34,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:34,997 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:18:34,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:34,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695195094] [2023-12-16 19:18:34,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695195094] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:34,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:34,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:18:34,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624475743] [2023-12-16 19:18:34,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:34,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:18:35,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:35,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:18:35,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:18:35,000 INFO L87 Difference]: Start difference. First operand 422 states and 670 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:35,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:35,069 INFO L93 Difference]: Finished difference Result 768 states and 1214 transitions. [2023-12-16 19:18:35,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:35,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 167 [2023-12-16 19:18:35,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:35,071 INFO L225 Difference]: With dead ends: 768 [2023-12-16 19:18:35,072 INFO L226 Difference]: Without dead ends: 422 [2023-12-16 19:18:35,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:35,073 INFO L413 NwaCegarLoop]: 632 mSDtfsCounter, 551 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:35,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 1266 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:18:35,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2023-12-16 19:18:35,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2023-12-16 19:18:35,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 417 states have (on average 1.589928057553957) internal successors, (663), 417 states have internal predecessors, (663), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:18:35,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 669 transitions. [2023-12-16 19:18:35,082 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 669 transitions. Word has length 167 [2023-12-16 19:18:35,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:35,082 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 669 transitions. [2023-12-16 19:18:35,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:35,083 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 669 transitions. [2023-12-16 19:18:35,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-16 19:18:35,084 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:35,084 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:35,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-16 19:18:35,084 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:35,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:35,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1858106446, now seen corresponding path program 1 times [2023-12-16 19:18:35,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:35,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459174021] [2023-12-16 19:18:35,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:35,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:35,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:35,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:18:35,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:35,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 19:18:35,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:35,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-16 19:18:35,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:35,481 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:18:35,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:35,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459174021] [2023-12-16 19:18:35,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459174021] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:35,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:35,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:35,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978700849] [2023-12-16 19:18:35,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:35,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:35,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:35,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:35,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:35,483 INFO L87 Difference]: Start difference. First operand 422 states and 669 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:35,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:35,557 INFO L93 Difference]: Finished difference Result 768 states and 1212 transitions. [2023-12-16 19:18:35,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:35,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 167 [2023-12-16 19:18:35,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:35,559 INFO L225 Difference]: With dead ends: 768 [2023-12-16 19:18:35,559 INFO L226 Difference]: Without dead ends: 422 [2023-12-16 19:18:35,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:18:35,560 INFO L413 NwaCegarLoop]: 632 mSDtfsCounter, 1095 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1095 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:35,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1095 Valid, 1266 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:18:35,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2023-12-16 19:18:35,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2023-12-16 19:18:35,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 417 states have (on average 1.5875299760191846) internal successors, (662), 417 states have internal predecessors, (662), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:18:35,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 668 transitions. [2023-12-16 19:18:35,578 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 668 transitions. Word has length 167 [2023-12-16 19:18:35,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:35,578 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 668 transitions. [2023-12-16 19:18:35,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:35,579 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 668 transitions. [2023-12-16 19:18:35,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-16 19:18:35,580 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:35,580 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:35,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-16 19:18:35,580 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:35,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:35,581 INFO L85 PathProgramCache]: Analyzing trace with hash 387473008, now seen corresponding path program 1 times [2023-12-16 19:18:35,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:35,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440746656] [2023-12-16 19:18:35,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:35,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:35,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:35,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:18:35,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:35,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 19:18:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:35,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-16 19:18:35,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:35,912 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:18:35,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:35,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440746656] [2023-12-16 19:18:35,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440746656] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:35,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:35,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:35,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323578614] [2023-12-16 19:18:35,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:35,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:35,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:35,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:35,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:35,915 INFO L87 Difference]: Start difference. First operand 422 states and 668 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:35,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:35,991 INFO L93 Difference]: Finished difference Result 768 states and 1210 transitions. [2023-12-16 19:18:35,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:35,991 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 167 [2023-12-16 19:18:35,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:35,993 INFO L225 Difference]: With dead ends: 768 [2023-12-16 19:18:35,993 INFO L226 Difference]: Without dead ends: 422 [2023-12-16 19:18:35,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:18:35,994 INFO L413 NwaCegarLoop]: 632 mSDtfsCounter, 548 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:35,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 1272 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:18:35,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2023-12-16 19:18:36,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2023-12-16 19:18:36,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 417 states have (on average 1.5851318944844124) internal successors, (661), 417 states have internal predecessors, (661), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:18:36,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 667 transitions. [2023-12-16 19:18:36,005 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 667 transitions. Word has length 167 [2023-12-16 19:18:36,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:36,005 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 667 transitions. [2023-12-16 19:18:36,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:36,005 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 667 transitions. [2023-12-16 19:18:36,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-16 19:18:36,007 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:36,007 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:36,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-16 19:18:36,007 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:36,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:36,007 INFO L85 PathProgramCache]: Analyzing trace with hash 811119730, now seen corresponding path program 1 times [2023-12-16 19:18:36,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:36,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184808941] [2023-12-16 19:18:36,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:36,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:36,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:36,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:18:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:36,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 19:18:36,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:36,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-16 19:18:36,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:36,277 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:18:36,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:36,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184808941] [2023-12-16 19:18:36,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184808941] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:36,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:36,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:18:36,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718192797] [2023-12-16 19:18:36,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:36,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:18:36,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:36,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:18:36,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:18:36,279 INFO L87 Difference]: Start difference. First operand 422 states and 667 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:36,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:36,381 INFO L93 Difference]: Finished difference Result 768 states and 1208 transitions. [2023-12-16 19:18:36,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:36,382 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 167 [2023-12-16 19:18:36,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:36,383 INFO L225 Difference]: With dead ends: 768 [2023-12-16 19:18:36,383 INFO L226 Difference]: Without dead ends: 422 [2023-12-16 19:18:36,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:36,384 INFO L413 NwaCegarLoop]: 602 mSDtfsCounter, 536 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:36,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 1206 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:18:36,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2023-12-16 19:18:36,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2023-12-16 19:18:36,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 417 states have (on average 1.5827338129496402) internal successors, (660), 417 states have internal predecessors, (660), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:18:36,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 666 transitions. [2023-12-16 19:18:36,393 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 666 transitions. Word has length 167 [2023-12-16 19:18:36,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:36,393 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 666 transitions. [2023-12-16 19:18:36,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:36,393 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 666 transitions. [2023-12-16 19:18:36,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-16 19:18:36,394 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:36,394 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:36,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-16 19:18:36,394 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:36,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:36,395 INFO L85 PathProgramCache]: Analyzing trace with hash -32885772, now seen corresponding path program 1 times [2023-12-16 19:18:36,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:36,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232871582] [2023-12-16 19:18:36,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:36,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:36,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:36,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:18:36,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:36,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 19:18:36,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:36,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-16 19:18:36,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:36,797 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:18:36,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:36,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232871582] [2023-12-16 19:18:36,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232871582] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:36,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:36,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:36,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728578827] [2023-12-16 19:18:36,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:36,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:36,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:36,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:36,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:36,799 INFO L87 Difference]: Start difference. First operand 422 states and 666 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:36,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:36,916 INFO L93 Difference]: Finished difference Result 768 states and 1206 transitions. [2023-12-16 19:18:36,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:36,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 167 [2023-12-16 19:18:36,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:36,918 INFO L225 Difference]: With dead ends: 768 [2023-12-16 19:18:36,918 INFO L226 Difference]: Without dead ends: 422 [2023-12-16 19:18:36,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:18:36,919 INFO L413 NwaCegarLoop]: 602 mSDtfsCounter, 534 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:36,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 1212 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:18:36,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2023-12-16 19:18:36,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2023-12-16 19:18:36,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 417 states have (on average 1.580335731414868) internal successors, (659), 417 states have internal predecessors, (659), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:18:36,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 665 transitions. [2023-12-16 19:18:36,929 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 665 transitions. Word has length 167 [2023-12-16 19:18:36,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:36,930 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 665 transitions. [2023-12-16 19:18:36,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:36,930 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 665 transitions. [2023-12-16 19:18:36,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-16 19:18:36,931 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:36,931 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:36,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-12-16 19:18:36,931 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:36,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:36,932 INFO L85 PathProgramCache]: Analyzing trace with hash 241873842, now seen corresponding path program 1 times [2023-12-16 19:18:36,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:36,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200985227] [2023-12-16 19:18:36,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:36,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:37,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:18:37,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:37,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 19:18:37,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:37,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-16 19:18:37,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:37,269 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:18:37,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:37,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200985227] [2023-12-16 19:18:37,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200985227] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:37,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:37,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:37,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362413557] [2023-12-16 19:18:37,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:37,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:37,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:37,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:37,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:37,271 INFO L87 Difference]: Start difference. First operand 422 states and 665 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:37,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:37,381 INFO L93 Difference]: Finished difference Result 768 states and 1204 transitions. [2023-12-16 19:18:37,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:37,381 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 167 [2023-12-16 19:18:37,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:37,384 INFO L225 Difference]: With dead ends: 768 [2023-12-16 19:18:37,384 INFO L226 Difference]: Without dead ends: 422 [2023-12-16 19:18:37,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:18:37,385 INFO L413 NwaCegarLoop]: 602 mSDtfsCounter, 533 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:37,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 1212 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:18:37,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2023-12-16 19:18:37,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2023-12-16 19:18:37,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 417 states have (on average 1.5779376498800959) internal successors, (658), 417 states have internal predecessors, (658), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:18:37,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 664 transitions. [2023-12-16 19:18:37,395 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 664 transitions. Word has length 167 [2023-12-16 19:18:37,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:37,395 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 664 transitions. [2023-12-16 19:18:37,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:37,395 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 664 transitions. [2023-12-16 19:18:37,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-16 19:18:37,396 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:37,396 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:37,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-12-16 19:18:37,397 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:37,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:37,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1628077236, now seen corresponding path program 1 times [2023-12-16 19:18:37,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:37,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721826171] [2023-12-16 19:18:37,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:37,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:37,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:37,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:18:37,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:37,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 19:18:37,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:37,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-16 19:18:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:37,732 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:18:37,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:37,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721826171] [2023-12-16 19:18:37,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721826171] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:37,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:37,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:37,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281846642] [2023-12-16 19:18:37,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:37,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:37,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:37,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:37,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:37,734 INFO L87 Difference]: Start difference. First operand 422 states and 664 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:37,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:37,864 INFO L93 Difference]: Finished difference Result 768 states and 1202 transitions. [2023-12-16 19:18:37,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:37,865 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 167 [2023-12-16 19:18:37,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:37,866 INFO L225 Difference]: With dead ends: 768 [2023-12-16 19:18:37,866 INFO L226 Difference]: Without dead ends: 422 [2023-12-16 19:18:37,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:18:37,867 INFO L413 NwaCegarLoop]: 602 mSDtfsCounter, 1055 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1055 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:37,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1055 Valid, 1206 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:18:37,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2023-12-16 19:18:37,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2023-12-16 19:18:37,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 417 states have (on average 1.5755395683453237) internal successors, (657), 417 states have internal predecessors, (657), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:18:37,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 663 transitions. [2023-12-16 19:18:37,886 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 663 transitions. Word has length 167 [2023-12-16 19:18:37,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:37,886 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 663 transitions. [2023-12-16 19:18:37,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:37,887 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 663 transitions. [2023-12-16 19:18:37,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-16 19:18:37,888 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:37,888 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:37,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-12-16 19:18:37,888 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:37,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:37,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1690116850, now seen corresponding path program 1 times [2023-12-16 19:18:37,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:37,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920977503] [2023-12-16 19:18:37,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:37,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:37,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:38,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:18:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:38,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 19:18:38,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:38,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-16 19:18:38,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:38,212 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:18:38,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:38,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920977503] [2023-12-16 19:18:38,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920977503] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:38,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:38,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:38,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822616573] [2023-12-16 19:18:38,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:38,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:38,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:38,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:38,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:38,214 INFO L87 Difference]: Start difference. First operand 422 states and 663 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:38,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:38,325 INFO L93 Difference]: Finished difference Result 768 states and 1200 transitions. [2023-12-16 19:18:38,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:38,325 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 167 [2023-12-16 19:18:38,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:38,327 INFO L225 Difference]: With dead ends: 768 [2023-12-16 19:18:38,327 INFO L226 Difference]: Without dead ends: 422 [2023-12-16 19:18:38,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:18:38,328 INFO L413 NwaCegarLoop]: 602 mSDtfsCounter, 531 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:38,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 1212 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:18:38,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2023-12-16 19:18:38,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2023-12-16 19:18:38,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 417 states have (on average 1.5731414868105515) internal successors, (656), 417 states have internal predecessors, (656), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:18:38,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 662 transitions. [2023-12-16 19:18:38,336 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 662 transitions. Word has length 167 [2023-12-16 19:18:38,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:38,337 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 662 transitions. [2023-12-16 19:18:38,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:38,337 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 662 transitions. [2023-12-16 19:18:38,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-16 19:18:38,337 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:38,337 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:38,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-12-16 19:18:38,338 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:38,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:38,338 INFO L85 PathProgramCache]: Analyzing trace with hash 872468400, now seen corresponding path program 1 times [2023-12-16 19:18:38,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:38,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202482571] [2023-12-16 19:18:38,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:38,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:38,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:38,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:18:38,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:38,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 19:18:38,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:38,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-16 19:18:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:38,671 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:18:38,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:38,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202482571] [2023-12-16 19:18:38,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202482571] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:38,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:38,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:38,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011211750] [2023-12-16 19:18:38,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:38,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:38,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:38,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:38,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:38,673 INFO L87 Difference]: Start difference. First operand 422 states and 662 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:38,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:38,775 INFO L93 Difference]: Finished difference Result 768 states and 1198 transitions. [2023-12-16 19:18:38,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:38,776 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 167 [2023-12-16 19:18:38,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:38,777 INFO L225 Difference]: With dead ends: 768 [2023-12-16 19:18:38,777 INFO L226 Difference]: Without dead ends: 422 [2023-12-16 19:18:38,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:18:38,779 INFO L413 NwaCegarLoop]: 602 mSDtfsCounter, 530 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:38,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 1212 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:18:38,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2023-12-16 19:18:38,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2023-12-16 19:18:38,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 417 states have (on average 1.5707434052757794) internal successors, (655), 417 states have internal predecessors, (655), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:18:38,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 661 transitions. [2023-12-16 19:18:38,790 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 661 transitions. Word has length 167 [2023-12-16 19:18:38,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:38,790 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 661 transitions. [2023-12-16 19:18:38,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:38,790 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 661 transitions. [2023-12-16 19:18:38,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2023-12-16 19:18:38,791 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:38,791 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:38,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-12-16 19:18:38,791 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:38,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:38,791 INFO L85 PathProgramCache]: Analyzing trace with hash -715879502, now seen corresponding path program 1 times [2023-12-16 19:18:38,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:38,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125070824] [2023-12-16 19:18:38,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:38,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:39,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:18:39,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:39,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 19:18:39,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:39,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-16 19:18:39,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:39,417 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:18:39,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:39,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125070824] [2023-12-16 19:18:39,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125070824] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:39,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:39,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:39,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850714503] [2023-12-16 19:18:39,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:39,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:39,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:39,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:39,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:39,419 INFO L87 Difference]: Start difference. First operand 422 states and 661 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:39,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:39,487 INFO L93 Difference]: Finished difference Result 1226 states and 1862 transitions. [2023-12-16 19:18:39,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 19:18:39,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 167 [2023-12-16 19:18:39,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:39,490 INFO L225 Difference]: With dead ends: 1226 [2023-12-16 19:18:39,490 INFO L226 Difference]: Without dead ends: 880 [2023-12-16 19:18:39,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:18:39,491 INFO L413 NwaCegarLoop]: 1167 mSDtfsCounter, 1046 mSDsluCounter, 2527 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1046 SdHoareTripleChecker+Valid, 3694 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:39,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1046 Valid, 3694 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:18:39,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2023-12-16 19:18:39,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 481. [2023-12-16 19:18:39,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 476 states have (on average 1.51890756302521) internal successors, (723), 476 states have internal predecessors, (723), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:18:39,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 729 transitions. [2023-12-16 19:18:39,504 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 729 transitions. Word has length 167 [2023-12-16 19:18:39,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:39,504 INFO L495 AbstractCegarLoop]: Abstraction has 481 states and 729 transitions. [2023-12-16 19:18:39,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:39,505 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 729 transitions. [2023-12-16 19:18:39,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-12-16 19:18:39,505 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:39,505 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:39,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-12-16 19:18:39,506 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:39,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:39,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1952736930, now seen corresponding path program 1 times [2023-12-16 19:18:39,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:39,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206567970] [2023-12-16 19:18:39,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:39,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:39,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:39,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:18:39,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:39,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 19:18:39,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:39,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-16 19:18:39,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:39,791 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:18:39,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:39,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206567970] [2023-12-16 19:18:39,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206567970] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:39,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:39,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 19:18:39,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765763022] [2023-12-16 19:18:39,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:39,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 19:18:39,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:39,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 19:18:39,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:18:39,793 INFO L87 Difference]: Start difference. First operand 481 states and 729 transitions. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:39,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:39,853 INFO L93 Difference]: Finished difference Result 1253 states and 1903 transitions. [2023-12-16 19:18:39,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 19:18:39,854 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 168 [2023-12-16 19:18:39,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:39,856 INFO L225 Difference]: With dead ends: 1253 [2023-12-16 19:18:39,856 INFO L226 Difference]: Without dead ends: 848 [2023-12-16 19:18:39,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 19:18:39,857 INFO L413 NwaCegarLoop]: 736 mSDtfsCounter, 1575 mSDsluCounter, 2053 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1575 SdHoareTripleChecker+Valid, 2789 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:39,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1575 Valid, 2789 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:18:39,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2023-12-16 19:18:39,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 495. [2023-12-16 19:18:39,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 490 states have (on average 1.5204081632653061) internal successors, (745), 490 states have internal predecessors, (745), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:18:39,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 751 transitions. [2023-12-16 19:18:39,870 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 751 transitions. Word has length 168 [2023-12-16 19:18:39,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:39,870 INFO L495 AbstractCegarLoop]: Abstraction has 495 states and 751 transitions. [2023-12-16 19:18:39,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:39,870 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 751 transitions. [2023-12-16 19:18:39,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-12-16 19:18:39,871 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:39,871 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:39,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-12-16 19:18:39,871 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:39,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:39,872 INFO L85 PathProgramCache]: Analyzing trace with hash 882479452, now seen corresponding path program 1 times [2023-12-16 19:18:39,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:39,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293778563] [2023-12-16 19:18:39,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:39,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:39,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:40,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:18:40,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:40,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 19:18:40,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:40,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-16 19:18:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:40,240 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:18:40,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:40,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293778563] [2023-12-16 19:18:40,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293778563] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:40,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:40,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 19:18:40,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008500241] [2023-12-16 19:18:40,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:40,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 19:18:40,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:40,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 19:18:40,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:18:40,242 INFO L87 Difference]: Start difference. First operand 495 states and 751 transitions. Second operand has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 19:18:40,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:40,524 INFO L93 Difference]: Finished difference Result 998 states and 1503 transitions. [2023-12-16 19:18:40,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 19:18:40,524 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 168 [2023-12-16 19:18:40,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:40,526 INFO L225 Difference]: With dead ends: 998 [2023-12-16 19:18:40,526 INFO L226 Difference]: Without dead ends: 528 [2023-12-16 19:18:40,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-12-16 19:18:40,527 INFO L413 NwaCegarLoop]: 711 mSDtfsCounter, 1129 mSDsluCounter, 2120 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1129 SdHoareTripleChecker+Valid, 2831 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:40,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1129 Valid, 2831 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 19:18:40,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2023-12-16 19:18:40,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 497. [2023-12-16 19:18:40,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 492 states have (on average 1.516260162601626) internal successors, (746), 492 states have internal predecessors, (746), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 19:18:40,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 752 transitions. [2023-12-16 19:18:40,541 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 752 transitions. Word has length 168 [2023-12-16 19:18:40,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:40,541 INFO L495 AbstractCegarLoop]: Abstraction has 497 states and 752 transitions. [2023-12-16 19:18:40,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.285714285714285) internal successors, (156), 7 states have internal predecessors, (156), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 19:18:40,541 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 752 transitions. [2023-12-16 19:18:40,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2023-12-16 19:18:40,542 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:40,542 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:40,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-12-16 19:18:40,542 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:40,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:40,543 INFO L85 PathProgramCache]: Analyzing trace with hash 421562158, now seen corresponding path program 1 times [2023-12-16 19:18:40,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:40,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396673904] [2023-12-16 19:18:40,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:40,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:40,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:41,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:18:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:41,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 19:18:41,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:41,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 19:18:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:41,311 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:18:41,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:41,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396673904] [2023-12-16 19:18:41,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396673904] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:41,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:41,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 19:18:41,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387221378] [2023-12-16 19:18:41,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:41,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 19:18:41,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:41,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 19:18:41,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-16 19:18:41,315 INFO L87 Difference]: Start difference. First operand 497 states and 752 transitions. Second operand has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 states have internal predecessors, (157), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 19:18:42,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:42,655 INFO L93 Difference]: Finished difference Result 1752 states and 2617 transitions. [2023-12-16 19:18:42,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 19:18:42,655 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 states have internal predecessors, (157), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 169 [2023-12-16 19:18:42,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:42,659 INFO L225 Difference]: With dead ends: 1752 [2023-12-16 19:18:42,659 INFO L226 Difference]: Without dead ends: 1331 [2023-12-16 19:18:42,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2023-12-16 19:18:42,660 INFO L413 NwaCegarLoop]: 1470 mSDtfsCounter, 1573 mSDsluCounter, 5383 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1574 SdHoareTripleChecker+Valid, 6853 SdHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:42,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1574 Valid, 6853 Invalid, 1195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1186 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-16 19:18:42,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2023-12-16 19:18:42,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 549. [2023-12-16 19:18:42,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 542 states have (on average 1.5166051660516606) internal successors, (822), 542 states have internal predecessors, (822), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-16 19:18:42,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 832 transitions. [2023-12-16 19:18:42,679 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 832 transitions. Word has length 169 [2023-12-16 19:18:42,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:42,679 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 832 transitions. [2023-12-16 19:18:42,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.444444444444443) internal successors, (157), 9 states have internal predecessors, (157), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 19:18:42,679 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 832 transitions. [2023-12-16 19:18:42,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2023-12-16 19:18:42,680 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:42,680 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:42,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-12-16 19:18:42,680 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:42,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:42,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1658108216, now seen corresponding path program 1 times [2023-12-16 19:18:42,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:42,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264194746] [2023-12-16 19:18:42,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:42,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:43,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 19:18:43,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:43,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 19:18:43,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:43,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 19:18:43,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:43,111 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:18:43,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:43,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264194746] [2023-12-16 19:18:43,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264194746] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:43,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:43,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 19:18:43,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664842403] [2023-12-16 19:18:43,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:43,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 19:18:43,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:43,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 19:18:43,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:18:43,113 INFO L87 Difference]: Start difference. First operand 549 states and 832 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:43,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:43,410 INFO L93 Difference]: Finished difference Result 1133 states and 1703 transitions. [2023-12-16 19:18:43,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 19:18:43,411 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 169 [2023-12-16 19:18:43,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:43,413 INFO L225 Difference]: With dead ends: 1133 [2023-12-16 19:18:43,413 INFO L226 Difference]: Without dead ends: 557 [2023-12-16 19:18:43,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-12-16 19:18:43,414 INFO L413 NwaCegarLoop]: 635 mSDtfsCounter, 1284 mSDsluCounter, 1899 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1284 SdHoareTripleChecker+Valid, 2534 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:43,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1284 Valid, 2534 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 19:18:43,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2023-12-16 19:18:43,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 551. [2023-12-16 19:18:43,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 544 states have (on average 1.5128676470588236) internal successors, (823), 544 states have internal predecessors, (823), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-16 19:18:43,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 833 transitions. [2023-12-16 19:18:43,429 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 833 transitions. Word has length 169 [2023-12-16 19:18:43,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:43,429 INFO L495 AbstractCegarLoop]: Abstraction has 551 states and 833 transitions. [2023-12-16 19:18:43,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:43,429 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 833 transitions. [2023-12-16 19:18:43,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-12-16 19:18:43,430 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:43,430 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:43,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-12-16 19:18:43,430 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:43,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:43,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1963332210, now seen corresponding path program 1 times [2023-12-16 19:18:43,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:43,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097921673] [2023-12-16 19:18:43,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:43,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:43,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:44,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:18:44,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:44,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 19:18:44,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:44,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-16 19:18:44,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:44,055 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:18:44,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:44,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097921673] [2023-12-16 19:18:44,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097921673] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:44,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:44,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 19:18:44,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029397590] [2023-12-16 19:18:44,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:44,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 19:18:44,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:44,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 19:18:44,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 19:18:44,057 INFO L87 Difference]: Start difference. First operand 551 states and 833 transitions. Second operand has 8 states, 8 states have (on average 19.75) internal successors, (158), 8 states have internal predecessors, (158), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 19:18:44,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:44,907 INFO L93 Difference]: Finished difference Result 1520 states and 2275 transitions. [2023-12-16 19:18:44,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 19:18:44,907 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.75) internal successors, (158), 8 states have internal predecessors, (158), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 170 [2023-12-16 19:18:44,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:44,910 INFO L225 Difference]: With dead ends: 1520 [2023-12-16 19:18:44,910 INFO L226 Difference]: Without dead ends: 1045 [2023-12-16 19:18:44,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-12-16 19:18:44,912 INFO L413 NwaCegarLoop]: 870 mSDtfsCounter, 1706 mSDsluCounter, 3189 mSDsCounter, 0 mSdLazyCounter, 1451 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1709 SdHoareTripleChecker+Valid, 4059 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:44,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1709 Valid, 4059 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1451 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-16 19:18:44,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2023-12-16 19:18:44,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 556. [2023-12-16 19:18:44,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 549 states have (on average 1.51183970856102) internal successors, (830), 549 states have internal predecessors, (830), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-16 19:18:44,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 840 transitions. [2023-12-16 19:18:44,927 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 840 transitions. Word has length 170 [2023-12-16 19:18:44,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:44,927 INFO L495 AbstractCegarLoop]: Abstraction has 556 states and 840 transitions. [2023-12-16 19:18:44,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.75) internal successors, (158), 8 states have internal predecessors, (158), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 19:18:44,928 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 840 transitions. [2023-12-16 19:18:44,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-12-16 19:18:44,928 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:44,928 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:44,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-12-16 19:18:44,929 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:44,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:44,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1121936730, now seen corresponding path program 1 times [2023-12-16 19:18:44,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:44,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227485682] [2023-12-16 19:18:44,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:44,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:45,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:18:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:45,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-16 19:18:45,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:45,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-16 19:18:45,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:45,325 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:18:45,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:45,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227485682] [2023-12-16 19:18:45,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227485682] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:45,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:45,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 19:18:45,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552595342] [2023-12-16 19:18:45,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:45,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 19:18:45,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:45,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 19:18:45,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:18:45,327 INFO L87 Difference]: Start difference. First operand 556 states and 840 transitions. Second operand has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:45,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:45,674 INFO L93 Difference]: Finished difference Result 1042 states and 1563 transitions. [2023-12-16 19:18:45,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:18:45,675 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 171 [2023-12-16 19:18:45,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:45,677 INFO L225 Difference]: With dead ends: 1042 [2023-12-16 19:18:45,677 INFO L226 Difference]: Without dead ends: 562 [2023-12-16 19:18:45,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-16 19:18:45,678 INFO L413 NwaCegarLoop]: 489 mSDtfsCounter, 1115 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1115 SdHoareTripleChecker+Valid, 1585 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:45,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1115 Valid, 1585 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 19:18:45,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2023-12-16 19:18:45,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 557. [2023-12-16 19:18:45,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 550 states have (on average 1.510909090909091) internal successors, (831), 550 states have internal predecessors, (831), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-16 19:18:45,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 841 transitions. [2023-12-16 19:18:45,695 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 841 transitions. Word has length 171 [2023-12-16 19:18:45,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:45,695 INFO L495 AbstractCegarLoop]: Abstraction has 557 states and 841 transitions. [2023-12-16 19:18:45,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:45,696 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 841 transitions. [2023-12-16 19:18:45,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-12-16 19:18:45,697 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:45,697 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:45,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-12-16 19:18:45,697 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:45,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:45,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1171144296, now seen corresponding path program 1 times [2023-12-16 19:18:45,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:45,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109702486] [2023-12-16 19:18:45,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:45,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:45,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:46,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:18:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:46,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-16 19:18:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:46,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-16 19:18:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:46,429 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:18:46,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:46,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109702486] [2023-12-16 19:18:46,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109702486] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:46,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:46,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 19:18:46,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273432913] [2023-12-16 19:18:46,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:46,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 19:18:46,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:46,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 19:18:46,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-16 19:18:46,431 INFO L87 Difference]: Start difference. First operand 557 states and 841 transitions. Second operand has 8 states, 8 states have (on average 19.875) internal successors, (159), 8 states have internal predecessors, (159), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 19:18:47,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:47,211 INFO L93 Difference]: Finished difference Result 1529 states and 2285 transitions. [2023-12-16 19:18:47,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 19:18:47,212 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.875) internal successors, (159), 8 states have internal predecessors, (159), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 171 [2023-12-16 19:18:47,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:47,215 INFO L225 Difference]: With dead ends: 1529 [2023-12-16 19:18:47,215 INFO L226 Difference]: Without dead ends: 1048 [2023-12-16 19:18:47,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2023-12-16 19:18:47,216 INFO L413 NwaCegarLoop]: 852 mSDtfsCounter, 1161 mSDsluCounter, 3165 mSDsCounter, 0 mSdLazyCounter, 1420 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1164 SdHoareTripleChecker+Valid, 4017 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:47,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1164 Valid, 4017 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1420 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-16 19:18:47,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2023-12-16 19:18:47,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 558. [2023-12-16 19:18:47,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 551 states have (on average 1.5099818511796734) internal successors, (832), 551 states have internal predecessors, (832), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-16 19:18:47,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 842 transitions. [2023-12-16 19:18:47,248 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 842 transitions. Word has length 171 [2023-12-16 19:18:47,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:47,249 INFO L495 AbstractCegarLoop]: Abstraction has 558 states and 842 transitions. [2023-12-16 19:18:47,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.875) internal successors, (159), 8 states have internal predecessors, (159), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 19:18:47,249 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 842 transitions. [2023-12-16 19:18:47,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-12-16 19:18:47,250 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:47,250 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:47,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-12-16 19:18:47,250 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:47,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:47,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1217419734, now seen corresponding path program 1 times [2023-12-16 19:18:47,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:47,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588309788] [2023-12-16 19:18:47,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:47,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:48,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:18:48,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:48,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-16 19:18:48,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:48,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-16 19:18:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:48,111 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 19:18:48,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:48,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588309788] [2023-12-16 19:18:48,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588309788] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:48,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:48,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 19:18:48,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640588795] [2023-12-16 19:18:48,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:48,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 19:18:48,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:48,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 19:18:48,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:18:48,113 INFO L87 Difference]: Start difference. First operand 558 states and 842 transitions. Second operand has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:48,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:48,258 INFO L93 Difference]: Finished difference Result 1764 states and 2605 transitions. [2023-12-16 19:18:48,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 19:18:48,258 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 171 [2023-12-16 19:18:48,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:48,262 INFO L225 Difference]: With dead ends: 1764 [2023-12-16 19:18:48,262 INFO L226 Difference]: Without dead ends: 1282 [2023-12-16 19:18:48,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-12-16 19:18:48,263 INFO L413 NwaCegarLoop]: 793 mSDtfsCounter, 2684 mSDsluCounter, 1929 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2687 SdHoareTripleChecker+Valid, 2722 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:48,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2687 Valid, 2722 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:18:48,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2023-12-16 19:18:48,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 813. [2023-12-16 19:18:48,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 801 states have (on average 1.4581772784019975) internal successors, (1168), 801 states have internal predecessors, (1168), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 19:18:48,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1188 transitions. [2023-12-16 19:18:48,291 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1188 transitions. Word has length 171 [2023-12-16 19:18:48,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:48,291 INFO L495 AbstractCegarLoop]: Abstraction has 813 states and 1188 transitions. [2023-12-16 19:18:48,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 19:18:48,291 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1188 transitions. [2023-12-16 19:18:48,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2023-12-16 19:18:48,294 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:48,295 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:48,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-12-16 19:18:48,295 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:48,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:48,295 INFO L85 PathProgramCache]: Analyzing trace with hash -2128044390, now seen corresponding path program 1 times [2023-12-16 19:18:48,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:48,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371300280] [2023-12-16 19:18:48,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:48,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:48,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:48,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:18:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:48,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-16 19:18:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:48,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-16 19:18:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:48,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2023-12-16 19:18:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:48,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2023-12-16 19:18:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:48,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2023-12-16 19:18:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:48,885 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:18:48,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:48,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371300280] [2023-12-16 19:18:48,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371300280] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:48,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:48,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:48,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733561543] [2023-12-16 19:18:48,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:48,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:48,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:48,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:48,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:48,887 INFO L87 Difference]: Start difference. First operand 813 states and 1188 transitions. Second operand has 5 states, 5 states have (on average 80.4) internal successors, (402), 5 states have internal predecessors, (402), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:49,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:49,013 INFO L93 Difference]: Finished difference Result 1295 states and 1904 transitions. [2023-12-16 19:18:49,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:49,014 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 80.4) internal successors, (402), 5 states have internal predecessors, (402), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 429 [2023-12-16 19:18:49,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:49,016 INFO L225 Difference]: With dead ends: 1295 [2023-12-16 19:18:49,016 INFO L226 Difference]: Without dead ends: 813 [2023-12-16 19:18:49,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:18:49,017 INFO L413 NwaCegarLoop]: 600 mSDtfsCounter, 596 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 599 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:49,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [599 Valid, 1208 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:18:49,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2023-12-16 19:18:49,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2023-12-16 19:18:49,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 801 states have (on average 1.4569288389513109) internal successors, (1167), 801 states have internal predecessors, (1167), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 19:18:49,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1187 transitions. [2023-12-16 19:18:49,044 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1187 transitions. Word has length 429 [2023-12-16 19:18:49,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:49,044 INFO L495 AbstractCegarLoop]: Abstraction has 813 states and 1187 transitions. [2023-12-16 19:18:49,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.4) internal successors, (402), 5 states have internal predecessors, (402), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:49,044 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1187 transitions. [2023-12-16 19:18:49,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2023-12-16 19:18:49,048 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:49,048 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:49,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-12-16 19:18:49,049 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:49,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:49,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1033877562, now seen corresponding path program 1 times [2023-12-16 19:18:49,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:49,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106260916] [2023-12-16 19:18:49,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:49,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:49,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:49,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:18:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:49,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-16 19:18:49,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:49,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-16 19:18:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:49,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2023-12-16 19:18:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:49,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2023-12-16 19:18:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:49,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2023-12-16 19:18:49,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:49,648 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:18:49,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:49,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106260916] [2023-12-16 19:18:49,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106260916] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:49,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:49,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:49,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686182689] [2023-12-16 19:18:49,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:49,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:49,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:49,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:49,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:49,652 INFO L87 Difference]: Start difference. First operand 813 states and 1187 transitions. Second operand has 5 states, 5 states have (on average 80.6) internal successors, (403), 5 states have internal predecessors, (403), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:49,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:49,768 INFO L93 Difference]: Finished difference Result 1295 states and 1902 transitions. [2023-12-16 19:18:49,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:49,768 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 80.6) internal successors, (403), 5 states have internal predecessors, (403), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 430 [2023-12-16 19:18:49,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:49,771 INFO L225 Difference]: With dead ends: 1295 [2023-12-16 19:18:49,771 INFO L226 Difference]: Without dead ends: 813 [2023-12-16 19:18:49,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:18:49,777 INFO L413 NwaCegarLoop]: 600 mSDtfsCounter, 588 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:49,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 1208 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:18:49,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2023-12-16 19:18:49,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2023-12-16 19:18:49,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 801 states have (on average 1.4556803995006242) internal successors, (1166), 801 states have internal predecessors, (1166), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 19:18:49,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1186 transitions. [2023-12-16 19:18:49,803 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1186 transitions. Word has length 430 [2023-12-16 19:18:49,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:49,805 INFO L495 AbstractCegarLoop]: Abstraction has 813 states and 1186 transitions. [2023-12-16 19:18:49,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.6) internal successors, (403), 5 states have internal predecessors, (403), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:49,805 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1186 transitions. [2023-12-16 19:18:49,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2023-12-16 19:18:49,808 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:49,808 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:49,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2023-12-16 19:18:49,808 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:49,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:49,808 INFO L85 PathProgramCache]: Analyzing trace with hash -915270298, now seen corresponding path program 1 times [2023-12-16 19:18:49,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:49,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124219078] [2023-12-16 19:18:49,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:49,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:49,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:50,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:18:50,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:50,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-16 19:18:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:50,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-16 19:18:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:50,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2023-12-16 19:18:50,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:50,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2023-12-16 19:18:50,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:50,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2023-12-16 19:18:50,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:50,431 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:18:50,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:50,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124219078] [2023-12-16 19:18:50,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124219078] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:50,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:50,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:50,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764111050] [2023-12-16 19:18:50,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:50,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:50,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:50,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:50,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:50,433 INFO L87 Difference]: Start difference. First operand 813 states and 1186 transitions. Second operand has 5 states, 5 states have (on average 80.8) internal successors, (404), 5 states have internal predecessors, (404), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:50,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:50,544 INFO L93 Difference]: Finished difference Result 1295 states and 1900 transitions. [2023-12-16 19:18:50,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:50,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 80.8) internal successors, (404), 5 states have internal predecessors, (404), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 431 [2023-12-16 19:18:50,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:50,557 INFO L225 Difference]: With dead ends: 1295 [2023-12-16 19:18:50,557 INFO L226 Difference]: Without dead ends: 813 [2023-12-16 19:18:50,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:18:50,558 INFO L413 NwaCegarLoop]: 600 mSDtfsCounter, 1039 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1042 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:50,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1042 Valid, 1202 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:18:50,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2023-12-16 19:18:50,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2023-12-16 19:18:50,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 801 states have (on average 1.4544319600499376) internal successors, (1165), 801 states have internal predecessors, (1165), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 19:18:50,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1185 transitions. [2023-12-16 19:18:50,589 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1185 transitions. Word has length 431 [2023-12-16 19:18:50,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:50,589 INFO L495 AbstractCegarLoop]: Abstraction has 813 states and 1185 transitions. [2023-12-16 19:18:50,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.8) internal successors, (404), 5 states have internal predecessors, (404), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:50,590 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1185 transitions. [2023-12-16 19:18:50,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2023-12-16 19:18:50,592 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:50,592 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:50,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2023-12-16 19:18:50,593 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:50,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:50,593 INFO L85 PathProgramCache]: Analyzing trace with hash 764553238, now seen corresponding path program 1 times [2023-12-16 19:18:50,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:50,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857968000] [2023-12-16 19:18:50,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:50,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:50,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:51,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:18:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:51,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-16 19:18:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:51,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-16 19:18:51,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:51,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2023-12-16 19:18:51,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:51,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2023-12-16 19:18:51,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:51,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 349 [2023-12-16 19:18:51,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:51,202 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:18:51,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:51,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857968000] [2023-12-16 19:18:51,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857968000] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:51,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:51,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:51,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812342642] [2023-12-16 19:18:51,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:51,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:51,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:51,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:51,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:51,204 INFO L87 Difference]: Start difference. First operand 813 states and 1185 transitions. Second operand has 5 states, 5 states have (on average 81.0) internal successors, (405), 5 states have internal predecessors, (405), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:51,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:51,297 INFO L93 Difference]: Finished difference Result 1295 states and 1898 transitions. [2023-12-16 19:18:51,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:51,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 81.0) internal successors, (405), 5 states have internal predecessors, (405), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 432 [2023-12-16 19:18:51,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:51,300 INFO L225 Difference]: With dead ends: 1295 [2023-12-16 19:18:51,301 INFO L226 Difference]: Without dead ends: 813 [2023-12-16 19:18:51,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:18:51,303 INFO L413 NwaCegarLoop]: 600 mSDtfsCounter, 572 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:51,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 1208 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:18:51,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2023-12-16 19:18:51,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2023-12-16 19:18:51,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 801 states have (on average 1.453183520599251) internal successors, (1164), 801 states have internal predecessors, (1164), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 19:18:51,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1184 transitions. [2023-12-16 19:18:51,328 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1184 transitions. Word has length 432 [2023-12-16 19:18:51,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:51,328 INFO L495 AbstractCegarLoop]: Abstraction has 813 states and 1184 transitions. [2023-12-16 19:18:51,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.0) internal successors, (405), 5 states have internal predecessors, (405), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:51,328 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1184 transitions. [2023-12-16 19:18:51,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2023-12-16 19:18:51,331 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:51,331 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:51,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2023-12-16 19:18:51,331 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:51,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:51,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1085297164, now seen corresponding path program 1 times [2023-12-16 19:18:51,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:51,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584404968] [2023-12-16 19:18:51,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:51,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:51,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:18:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:51,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-16 19:18:51,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:51,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-16 19:18:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:51,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2023-12-16 19:18:51,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:51,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2023-12-16 19:18:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:51,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2023-12-16 19:18:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:51,858 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:18:51,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:51,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584404968] [2023-12-16 19:18:51,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584404968] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:51,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:51,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:51,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527095904] [2023-12-16 19:18:51,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:51,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:51,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:51,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:51,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:51,860 INFO L87 Difference]: Start difference. First operand 813 states and 1184 transitions. Second operand has 5 states, 5 states have (on average 81.2) internal successors, (406), 5 states have internal predecessors, (406), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:51,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:51,956 INFO L93 Difference]: Finished difference Result 1295 states and 1896 transitions. [2023-12-16 19:18:51,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:51,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 81.2) internal successors, (406), 5 states have internal predecessors, (406), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 433 [2023-12-16 19:18:51,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:51,958 INFO L225 Difference]: With dead ends: 1295 [2023-12-16 19:18:51,958 INFO L226 Difference]: Without dead ends: 813 [2023-12-16 19:18:51,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:18:51,959 INFO L413 NwaCegarLoop]: 600 mSDtfsCounter, 1007 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1010 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:51,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1010 Valid, 1202 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:18:51,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2023-12-16 19:18:51,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2023-12-16 19:18:51,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 801 states have (on average 1.4519350811485643) internal successors, (1163), 801 states have internal predecessors, (1163), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 19:18:51,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1183 transitions. [2023-12-16 19:18:51,983 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1183 transitions. Word has length 433 [2023-12-16 19:18:51,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:51,984 INFO L495 AbstractCegarLoop]: Abstraction has 813 states and 1183 transitions. [2023-12-16 19:18:51,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.2) internal successors, (406), 5 states have internal predecessors, (406), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:51,984 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1183 transitions. [2023-12-16 19:18:51,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2023-12-16 19:18:51,986 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:51,987 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:51,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2023-12-16 19:18:51,987 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:51,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:51,987 INFO L85 PathProgramCache]: Analyzing trace with hash 590260452, now seen corresponding path program 1 times [2023-12-16 19:18:51,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:51,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879274660] [2023-12-16 19:18:51,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:51,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:52,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:18:52,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:52,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-16 19:18:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:52,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-16 19:18:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:52,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 322 [2023-12-16 19:18:52,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:52,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2023-12-16 19:18:52,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:52,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 351 [2023-12-16 19:18:52,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:52,641 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:18:52,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:52,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879274660] [2023-12-16 19:18:52,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879274660] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:52,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:52,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:52,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453528447] [2023-12-16 19:18:52,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:52,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:52,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:52,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:52,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:52,643 INFO L87 Difference]: Start difference. First operand 813 states and 1183 transitions. Second operand has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:52,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:52,744 INFO L93 Difference]: Finished difference Result 1295 states and 1894 transitions. [2023-12-16 19:18:52,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:52,745 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 434 [2023-12-16 19:18:52,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:52,746 INFO L225 Difference]: With dead ends: 1295 [2023-12-16 19:18:52,746 INFO L226 Difference]: Without dead ends: 813 [2023-12-16 19:18:52,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:18:52,747 INFO L413 NwaCegarLoop]: 600 mSDtfsCounter, 991 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 994 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:52,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [994 Valid, 1202 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:18:52,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2023-12-16 19:18:52,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2023-12-16 19:18:52,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 801 states have (on average 1.4506866416978776) internal successors, (1162), 801 states have internal predecessors, (1162), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 19:18:52,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1182 transitions. [2023-12-16 19:18:52,771 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1182 transitions. Word has length 434 [2023-12-16 19:18:52,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:52,772 INFO L495 AbstractCegarLoop]: Abstraction has 813 states and 1182 transitions. [2023-12-16 19:18:52,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.4) internal successors, (407), 5 states have internal predecessors, (407), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:52,772 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1182 transitions. [2023-12-16 19:18:52,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2023-12-16 19:18:52,774 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:52,775 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:52,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2023-12-16 19:18:52,775 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:52,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:52,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1359249088, now seen corresponding path program 1 times [2023-12-16 19:18:52,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:52,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746078333] [2023-12-16 19:18:52,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:52,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:53,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:18:53,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:53,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-16 19:18:53,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:53,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-16 19:18:53,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:53,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2023-12-16 19:18:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:53,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2023-12-16 19:18:53,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:53,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 352 [2023-12-16 19:18:53,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:53,309 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:18:53,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:53,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746078333] [2023-12-16 19:18:53,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746078333] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:53,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:53,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:53,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70100749] [2023-12-16 19:18:53,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:53,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:53,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:53,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:53,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:53,311 INFO L87 Difference]: Start difference. First operand 813 states and 1182 transitions. Second operand has 5 states, 5 states have (on average 81.6) internal successors, (408), 5 states have internal predecessors, (408), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:53,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:53,418 INFO L93 Difference]: Finished difference Result 1295 states and 1892 transitions. [2023-12-16 19:18:53,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:53,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 81.6) internal successors, (408), 5 states have internal predecessors, (408), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 435 [2023-12-16 19:18:53,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:53,420 INFO L225 Difference]: With dead ends: 1295 [2023-12-16 19:18:53,420 INFO L226 Difference]: Without dead ends: 813 [2023-12-16 19:18:53,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:18:53,421 INFO L413 NwaCegarLoop]: 600 mSDtfsCounter, 548 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:53,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 1208 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:18:53,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2023-12-16 19:18:53,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2023-12-16 19:18:53,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 801 states have (on average 1.449438202247191) internal successors, (1161), 801 states have internal predecessors, (1161), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 19:18:53,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1181 transitions. [2023-12-16 19:18:53,444 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1181 transitions. Word has length 435 [2023-12-16 19:18:53,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:53,444 INFO L495 AbstractCegarLoop]: Abstraction has 813 states and 1181 transitions. [2023-12-16 19:18:53,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.6) internal successors, (408), 5 states have internal predecessors, (408), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:53,444 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1181 transitions. [2023-12-16 19:18:53,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2023-12-16 19:18:53,447 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:53,447 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:53,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2023-12-16 19:18:53,447 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:53,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:53,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1438789452, now seen corresponding path program 1 times [2023-12-16 19:18:53,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:53,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603074732] [2023-12-16 19:18:53,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:53,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:53,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:53,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:18:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:53,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-16 19:18:53,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:53,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-16 19:18:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:53,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2023-12-16 19:18:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:53,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2023-12-16 19:18:53,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:53,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 353 [2023-12-16 19:18:53,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:53,973 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:18:53,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:53,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603074732] [2023-12-16 19:18:53,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603074732] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:53,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:53,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:53,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501713322] [2023-12-16 19:18:53,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:53,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:53,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:53,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:53,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:53,975 INFO L87 Difference]: Start difference. First operand 813 states and 1181 transitions. Second operand has 5 states, 5 states have (on average 81.8) internal successors, (409), 5 states have internal predecessors, (409), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:54,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:54,078 INFO L93 Difference]: Finished difference Result 1295 states and 1890 transitions. [2023-12-16 19:18:54,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:54,078 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 81.8) internal successors, (409), 5 states have internal predecessors, (409), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 436 [2023-12-16 19:18:54,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:54,080 INFO L225 Difference]: With dead ends: 1295 [2023-12-16 19:18:54,080 INFO L226 Difference]: Without dead ends: 813 [2023-12-16 19:18:54,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:18:54,081 INFO L413 NwaCegarLoop]: 600 mSDtfsCounter, 959 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 962 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:54,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [962 Valid, 1202 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:18:54,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2023-12-16 19:18:54,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2023-12-16 19:18:54,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 801 states have (on average 1.4481897627965044) internal successors, (1160), 801 states have internal predecessors, (1160), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 19:18:54,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1180 transitions. [2023-12-16 19:18:54,108 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1180 transitions. Word has length 436 [2023-12-16 19:18:54,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:54,109 INFO L495 AbstractCegarLoop]: Abstraction has 813 states and 1180 transitions. [2023-12-16 19:18:54,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 81.8) internal successors, (409), 5 states have internal predecessors, (409), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:54,109 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1180 transitions. [2023-12-16 19:18:54,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2023-12-16 19:18:54,111 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:54,111 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:54,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2023-12-16 19:18:54,112 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:54,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:54,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1748630606, now seen corresponding path program 1 times [2023-12-16 19:18:54,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:54,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552020900] [2023-12-16 19:18:54,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:54,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:54,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:54,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:18:54,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:54,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-16 19:18:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:54,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-16 19:18:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:54,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2023-12-16 19:18:54,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:54,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2023-12-16 19:18:54,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:54,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 354 [2023-12-16 19:18:54,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:54,691 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:18:54,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:54,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552020900] [2023-12-16 19:18:54,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552020900] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:54,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:54,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:54,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905729789] [2023-12-16 19:18:54,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:54,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:54,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:54,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:54,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:54,693 INFO L87 Difference]: Start difference. First operand 813 states and 1180 transitions. Second operand has 5 states, 5 states have (on average 82.0) internal successors, (410), 5 states have internal predecessors, (410), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:54,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:54,780 INFO L93 Difference]: Finished difference Result 1295 states and 1888 transitions. [2023-12-16 19:18:54,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:54,780 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 82.0) internal successors, (410), 5 states have internal predecessors, (410), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 437 [2023-12-16 19:18:54,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:54,782 INFO L225 Difference]: With dead ends: 1295 [2023-12-16 19:18:54,782 INFO L226 Difference]: Without dead ends: 813 [2023-12-16 19:18:54,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:18:54,783 INFO L413 NwaCegarLoop]: 616 mSDtfsCounter, 520 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:54,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 1240 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:18:54,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2023-12-16 19:18:54,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2023-12-16 19:18:54,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 801 states have (on average 1.4469413233458177) internal successors, (1159), 801 states have internal predecessors, (1159), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 19:18:54,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1179 transitions. [2023-12-16 19:18:54,807 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1179 transitions. Word has length 437 [2023-12-16 19:18:54,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:54,807 INFO L495 AbstractCegarLoop]: Abstraction has 813 states and 1179 transitions. [2023-12-16 19:18:54,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.0) internal successors, (410), 5 states have internal predecessors, (410), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:54,808 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1179 transitions. [2023-12-16 19:18:54,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2023-12-16 19:18:54,810 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:54,810 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:54,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2023-12-16 19:18:54,810 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:54,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:54,811 INFO L85 PathProgramCache]: Analyzing trace with hash 2114441986, now seen corresponding path program 1 times [2023-12-16 19:18:54,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:54,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666006827] [2023-12-16 19:18:54,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:54,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:54,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:55,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:18:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:55,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-16 19:18:55,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:55,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-16 19:18:55,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:55,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-12-16 19:18:55,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:55,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2023-12-16 19:18:55,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:55,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 355 [2023-12-16 19:18:55,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:55,350 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:18:55,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:55,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666006827] [2023-12-16 19:18:55,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666006827] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:55,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:55,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:55,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274623193] [2023-12-16 19:18:55,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:55,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:55,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:55,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:55,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:55,352 INFO L87 Difference]: Start difference. First operand 813 states and 1179 transitions. Second operand has 5 states, 5 states have (on average 82.2) internal successors, (411), 5 states have internal predecessors, (411), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:55,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:55,429 INFO L93 Difference]: Finished difference Result 1295 states and 1886 transitions. [2023-12-16 19:18:55,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:55,429 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 82.2) internal successors, (411), 5 states have internal predecessors, (411), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 438 [2023-12-16 19:18:55,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:55,431 INFO L225 Difference]: With dead ends: 1295 [2023-12-16 19:18:55,432 INFO L226 Difference]: Without dead ends: 813 [2023-12-16 19:18:55,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:18:55,433 INFO L413 NwaCegarLoop]: 616 mSDtfsCounter, 512 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 1240 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.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:55,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 1240 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:18:55,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2023-12-16 19:18:55,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2023-12-16 19:18:55,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 801 states have (on average 1.445692883895131) internal successors, (1158), 801 states have internal predecessors, (1158), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 19:18:55,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1178 transitions. [2023-12-16 19:18:55,458 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1178 transitions. Word has length 438 [2023-12-16 19:18:55,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:55,459 INFO L495 AbstractCegarLoop]: Abstraction has 813 states and 1178 transitions. [2023-12-16 19:18:55,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.2) internal successors, (411), 5 states have internal predecessors, (411), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:55,459 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1178 transitions. [2023-12-16 19:18:55,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2023-12-16 19:18:55,462 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:55,462 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:55,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2023-12-16 19:18:55,462 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:55,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:55,462 INFO L85 PathProgramCache]: Analyzing trace with hash -916100070, now seen corresponding path program 1 times [2023-12-16 19:18:55,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:55,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288168020] [2023-12-16 19:18:55,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:55,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:55,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:18:55,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:55,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-16 19:18:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:55,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-16 19:18:55,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:55,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2023-12-16 19:18:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:56,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2023-12-16 19:18:56,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:56,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2023-12-16 19:18:56,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:56,006 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:18:56,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:56,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288168020] [2023-12-16 19:18:56,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288168020] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:56,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:56,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:56,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354487290] [2023-12-16 19:18:56,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:56,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:56,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:56,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:56,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:56,010 INFO L87 Difference]: Start difference. First operand 813 states and 1178 transitions. Second operand has 5 states, 5 states have (on average 82.4) internal successors, (412), 5 states have internal predecessors, (412), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:56,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:56,079 INFO L93 Difference]: Finished difference Result 1295 states and 1884 transitions. [2023-12-16 19:18:56,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:56,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 82.4) internal successors, (412), 5 states have internal predecessors, (412), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 439 [2023-12-16 19:18:56,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:56,081 INFO L225 Difference]: With dead ends: 1295 [2023-12-16 19:18:56,081 INFO L226 Difference]: Without dead ends: 813 [2023-12-16 19:18:56,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:18:56,083 INFO L413 NwaCegarLoop]: 616 mSDtfsCounter, 899 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 902 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:56,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [902 Valid, 1234 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:18:56,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2023-12-16 19:18:56,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2023-12-16 19:18:56,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 801 states have (on average 1.4444444444444444) internal successors, (1157), 801 states have internal predecessors, (1157), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 19:18:56,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1177 transitions. [2023-12-16 19:18:56,108 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1177 transitions. Word has length 439 [2023-12-16 19:18:56,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:56,108 INFO L495 AbstractCegarLoop]: Abstraction has 813 states and 1177 transitions. [2023-12-16 19:18:56,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.4) internal successors, (412), 5 states have internal predecessors, (412), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:56,108 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1177 transitions. [2023-12-16 19:18:56,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2023-12-16 19:18:56,111 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:56,111 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:56,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2023-12-16 19:18:56,111 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:56,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:56,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1535442350, now seen corresponding path program 1 times [2023-12-16 19:18:56,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:56,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613065200] [2023-12-16 19:18:56,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:56,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:56,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:18:56,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:56,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-16 19:18:56,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:56,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-16 19:18:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:56,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2023-12-16 19:18:56,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:56,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2023-12-16 19:18:56,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:56,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2023-12-16 19:18:56,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:56,652 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:18:56,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:56,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613065200] [2023-12-16 19:18:56,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613065200] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:56,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:56,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:56,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675683142] [2023-12-16 19:18:56,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:56,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:56,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:56,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:56,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:56,654 INFO L87 Difference]: Start difference. First operand 813 states and 1177 transitions. Second operand has 5 states, 5 states have (on average 82.6) internal successors, (413), 5 states have internal predecessors, (413), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:56,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:56,716 INFO L93 Difference]: Finished difference Result 1295 states and 1882 transitions. [2023-12-16 19:18:56,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:56,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 82.6) internal successors, (413), 5 states have internal predecessors, (413), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 440 [2023-12-16 19:18:56,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:56,718 INFO L225 Difference]: With dead ends: 1295 [2023-12-16 19:18:56,718 INFO L226 Difference]: Without dead ends: 813 [2023-12-16 19:18:56,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:18:56,719 INFO L413 NwaCegarLoop]: 616 mSDtfsCounter, 496 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:56,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 1240 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:18:56,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2023-12-16 19:18:56,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2023-12-16 19:18:56,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 801 states have (on average 1.4431960049937578) internal successors, (1156), 801 states have internal predecessors, (1156), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 19:18:56,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1176 transitions. [2023-12-16 19:18:56,748 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1176 transitions. Word has length 440 [2023-12-16 19:18:56,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:56,748 INFO L495 AbstractCegarLoop]: Abstraction has 813 states and 1176 transitions. [2023-12-16 19:18:56,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.6) internal successors, (413), 5 states have internal predecessors, (413), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:56,748 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1176 transitions. [2023-12-16 19:18:56,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2023-12-16 19:18:56,752 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:56,752 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:56,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2023-12-16 19:18:56,752 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:56,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:56,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1159460440, now seen corresponding path program 1 times [2023-12-16 19:18:56,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:56,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788125616] [2023-12-16 19:18:56,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:56,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:56,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:57,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:18:57,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:57,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-16 19:18:57,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:57,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-16 19:18:57,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:57,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2023-12-16 19:18:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:57,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 345 [2023-12-16 19:18:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:57,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2023-12-16 19:18:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:57,369 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:18:57,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:57,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788125616] [2023-12-16 19:18:57,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788125616] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:57,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:57,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:57,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482986517] [2023-12-16 19:18:57,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:57,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:57,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:57,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:57,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:57,371 INFO L87 Difference]: Start difference. First operand 813 states and 1176 transitions. Second operand has 5 states, 5 states have (on average 82.8) internal successors, (414), 5 states have internal predecessors, (414), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:57,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:57,428 INFO L93 Difference]: Finished difference Result 1295 states and 1880 transitions. [2023-12-16 19:18:57,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:57,428 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 82.8) internal successors, (414), 5 states have internal predecessors, (414), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 441 [2023-12-16 19:18:57,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:57,429 INFO L225 Difference]: With dead ends: 1295 [2023-12-16 19:18:57,430 INFO L226 Difference]: Without dead ends: 813 [2023-12-16 19:18:57,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:18:57,430 INFO L413 NwaCegarLoop]: 625 mSDtfsCounter, 861 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:57,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [864 Valid, 1252 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:18:57,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2023-12-16 19:18:57,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2023-12-16 19:18:57,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 801 states have (on average 1.4419475655430711) internal successors, (1155), 801 states have internal predecessors, (1155), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 19:18:57,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1175 transitions. [2023-12-16 19:18:57,460 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1175 transitions. Word has length 441 [2023-12-16 19:18:57,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:57,461 INFO L495 AbstractCegarLoop]: Abstraction has 813 states and 1175 transitions. [2023-12-16 19:18:57,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.8) internal successors, (414), 5 states have internal predecessors, (414), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:57,461 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1175 transitions. [2023-12-16 19:18:57,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2023-12-16 19:18:57,464 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:57,464 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:57,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2023-12-16 19:18:57,464 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:57,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:57,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1586018784, now seen corresponding path program 1 times [2023-12-16 19:18:57,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:57,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409675604] [2023-12-16 19:18:57,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:57,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:58,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:18:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:58,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-16 19:18:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:58,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-16 19:18:58,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:58,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2023-12-16 19:18:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:58,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 346 [2023-12-16 19:18:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:58,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2023-12-16 19:18:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:58,083 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:18:58,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:58,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409675604] [2023-12-16 19:18:58,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409675604] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:58,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:58,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:58,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030342939] [2023-12-16 19:18:58,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:58,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:58,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:58,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:58,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:58,085 INFO L87 Difference]: Start difference. First operand 813 states and 1175 transitions. Second operand has 5 states, 5 states have (on average 83.0) internal successors, (415), 5 states have internal predecessors, (415), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:58,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:58,132 INFO L93 Difference]: Finished difference Result 1295 states and 1878 transitions. [2023-12-16 19:18:58,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:58,133 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 83.0) internal successors, (415), 5 states have internal predecessors, (415), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 442 [2023-12-16 19:18:58,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:58,134 INFO L225 Difference]: With dead ends: 1295 [2023-12-16 19:18:58,134 INFO L226 Difference]: Without dead ends: 813 [2023-12-16 19:18:58,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:18:58,135 INFO L413 NwaCegarLoop]: 625 mSDtfsCounter, 474 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:58,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 1258 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:18:58,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2023-12-16 19:18:58,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2023-12-16 19:18:58,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 801 states have (on average 1.4406991260923845) internal successors, (1154), 801 states have internal predecessors, (1154), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 19:18:58,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1174 transitions. [2023-12-16 19:18:58,158 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1174 transitions. Word has length 442 [2023-12-16 19:18:58,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:58,158 INFO L495 AbstractCegarLoop]: Abstraction has 813 states and 1174 transitions. [2023-12-16 19:18:58,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.0) internal successors, (415), 5 states have internal predecessors, (415), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:58,158 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1174 transitions. [2023-12-16 19:18:58,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2023-12-16 19:18:58,161 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:58,161 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:58,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2023-12-16 19:18:58,161 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:58,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:58,162 INFO L85 PathProgramCache]: Analyzing trace with hash 227300852, now seen corresponding path program 1 times [2023-12-16 19:18:58,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:58,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001678579] [2023-12-16 19:18:58,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:58,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:58,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:58,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:18:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:58,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-16 19:18:58,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:58,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-16 19:18:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:58,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2023-12-16 19:18:58,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:58,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2023-12-16 19:18:58,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:58,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 360 [2023-12-16 19:18:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:18:58,782 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:18:58,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:18:58,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001678579] [2023-12-16 19:18:58,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001678579] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:18:58,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:18:58,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:18:58,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360062408] [2023-12-16 19:18:58,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:18:58,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:18:58,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:18:58,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:18:58,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:18:58,784 INFO L87 Difference]: Start difference. First operand 813 states and 1174 transitions. Second operand has 5 states, 5 states have (on average 83.2) internal successors, (416), 5 states have internal predecessors, (416), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:59,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:18:59,021 INFO L93 Difference]: Finished difference Result 1295 states and 1876 transitions. [2023-12-16 19:18:59,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:18:59,021 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 83.2) internal successors, (416), 5 states have internal predecessors, (416), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 443 [2023-12-16 19:18:59,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:18:59,023 INFO L225 Difference]: With dead ends: 1295 [2023-12-16 19:18:59,023 INFO L226 Difference]: Without dead ends: 813 [2023-12-16 19:18:59,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:18:59,024 INFO L413 NwaCegarLoop]: 478 mSDtfsCounter, 421 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 19:18:59,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 964 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 19:18:59,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2023-12-16 19:18:59,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2023-12-16 19:18:59,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 801 states have (on average 1.4394506866416978) internal successors, (1153), 801 states have internal predecessors, (1153), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 19:18:59,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1173 transitions. [2023-12-16 19:18:59,048 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1173 transitions. Word has length 443 [2023-12-16 19:18:59,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:18:59,048 INFO L495 AbstractCegarLoop]: Abstraction has 813 states and 1173 transitions. [2023-12-16 19:18:59,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.2) internal successors, (416), 5 states have internal predecessors, (416), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:18:59,048 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1173 transitions. [2023-12-16 19:18:59,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2023-12-16 19:18:59,051 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:18:59,051 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:18:59,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2023-12-16 19:18:59,052 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:18:59,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:18:59,052 INFO L85 PathProgramCache]: Analyzing trace with hash 620051696, now seen corresponding path program 1 times [2023-12-16 19:18:59,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:18:59,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315600513] [2023-12-16 19:18:59,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:18:59,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:18:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:00,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:19:00,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:00,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-16 19:19:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:00,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-16 19:19:00,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:00,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2023-12-16 19:19:00,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:00,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2023-12-16 19:19:00,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:00,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2023-12-16 19:19:00,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:00,101 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:19:00,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:00,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315600513] [2023-12-16 19:19:00,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315600513] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:00,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:00,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:00,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675405171] [2023-12-16 19:19:00,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:00,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:00,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:00,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:00,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:00,103 INFO L87 Difference]: Start difference. First operand 813 states and 1173 transitions. Second operand has 5 states, 5 states have (on average 83.4) internal successors, (417), 5 states have internal predecessors, (417), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:19:00,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:00,180 INFO L93 Difference]: Finished difference Result 1295 states and 1874 transitions. [2023-12-16 19:19:00,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:00,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 83.4) internal successors, (417), 5 states have internal predecessors, (417), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 444 [2023-12-16 19:19:00,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:00,182 INFO L225 Difference]: With dead ends: 1295 [2023-12-16 19:19:00,183 INFO L226 Difference]: Without dead ends: 813 [2023-12-16 19:19:00,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:00,184 INFO L413 NwaCegarLoop]: 613 mSDtfsCounter, 521 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:00,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 1234 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:19:00,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2023-12-16 19:19:00,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2023-12-16 19:19:00,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 801 states have (on average 1.4382022471910112) internal successors, (1152), 801 states have internal predecessors, (1152), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 19:19:00,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1172 transitions. [2023-12-16 19:19:00,207 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1172 transitions. Word has length 444 [2023-12-16 19:19:00,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:00,207 INFO L495 AbstractCegarLoop]: Abstraction has 813 states and 1172 transitions. [2023-12-16 19:19:00,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.4) internal successors, (417), 5 states have internal predecessors, (417), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:19:00,208 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1172 transitions. [2023-12-16 19:19:00,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2023-12-16 19:19:00,211 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:00,211 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:00,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2023-12-16 19:19:00,211 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:00,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:00,211 INFO L85 PathProgramCache]: Analyzing trace with hash 146816046, now seen corresponding path program 1 times [2023-12-16 19:19:00,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:00,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087255458] [2023-12-16 19:19:00,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:00,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:00,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:01,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:19:01,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:01,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-16 19:19:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:01,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-16 19:19:01,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:01,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2023-12-16 19:19:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:01,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2023-12-16 19:19:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:01,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2023-12-16 19:19:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:01,203 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:19:01,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:01,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087255458] [2023-12-16 19:19:01,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087255458] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:01,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:01,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:19:01,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938938441] [2023-12-16 19:19:01,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:01,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:19:01,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:01,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:19:01,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:19:01,205 INFO L87 Difference]: Start difference. First operand 813 states and 1172 transitions. Second operand has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:19:01,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:01,264 INFO L93 Difference]: Finished difference Result 1295 states and 1872 transitions. [2023-12-16 19:19:01,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:01,265 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 444 [2023-12-16 19:19:01,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:01,267 INFO L225 Difference]: With dead ends: 1295 [2023-12-16 19:19:01,267 INFO L226 Difference]: Without dead ends: 813 [2023-12-16 19:19:01,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:01,269 INFO L413 NwaCegarLoop]: 613 mSDtfsCounter, 383 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:01,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 1228 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 19:19:01,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2023-12-16 19:19:01,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2023-12-16 19:19:01,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 801 states have (on average 1.4369538077403246) internal successors, (1151), 801 states have internal predecessors, (1151), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 19:19:01,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1171 transitions. [2023-12-16 19:19:01,295 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1171 transitions. Word has length 444 [2023-12-16 19:19:01,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:01,296 INFO L495 AbstractCegarLoop]: Abstraction has 813 states and 1171 transitions. [2023-12-16 19:19:01,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:19:01,296 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1171 transitions. [2023-12-16 19:19:01,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2023-12-16 19:19:01,301 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:01,301 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:01,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2023-12-16 19:19:01,301 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:01,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:01,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1304348336, now seen corresponding path program 1 times [2023-12-16 19:19:01,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:01,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831275916] [2023-12-16 19:19:01,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:01,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:01,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:02,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:19:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:02,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-16 19:19:02,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:02,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-16 19:19:02,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:02,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2023-12-16 19:19:02,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:02,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2023-12-16 19:19:02,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:02,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2023-12-16 19:19:02,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:02,408 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:19:02,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:02,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831275916] [2023-12-16 19:19:02,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831275916] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:02,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:02,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:02,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863171512] [2023-12-16 19:19:02,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:02,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:02,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:02,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:02,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:02,410 INFO L87 Difference]: Start difference. First operand 813 states and 1171 transitions. Second operand has 5 states, 5 states have (on average 83.4) internal successors, (417), 5 states have internal predecessors, (417), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:19:02,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:02,508 INFO L93 Difference]: Finished difference Result 1295 states and 1870 transitions. [2023-12-16 19:19:02,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:02,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 83.4) internal successors, (417), 5 states have internal predecessors, (417), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 444 [2023-12-16 19:19:02,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:02,510 INFO L225 Difference]: With dead ends: 1295 [2023-12-16 19:19:02,510 INFO L226 Difference]: Without dead ends: 813 [2023-12-16 19:19:02,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:02,511 INFO L413 NwaCegarLoop]: 591 mSDtfsCounter, 507 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 1190 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:02,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 1190 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:02,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2023-12-16 19:19:02,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2023-12-16 19:19:02,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 801 states have (on average 1.435705368289638) internal successors, (1150), 801 states have internal predecessors, (1150), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 19:19:02,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1170 transitions. [2023-12-16 19:19:02,535 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1170 transitions. Word has length 444 [2023-12-16 19:19:02,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:02,536 INFO L495 AbstractCegarLoop]: Abstraction has 813 states and 1170 transitions. [2023-12-16 19:19:02,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.4) internal successors, (417), 5 states have internal predecessors, (417), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:19:02,536 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1170 transitions. [2023-12-16 19:19:02,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2023-12-16 19:19:02,538 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:02,539 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:02,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2023-12-16 19:19:02,539 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:02,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:02,539 INFO L85 PathProgramCache]: Analyzing trace with hash -631573522, now seen corresponding path program 1 times [2023-12-16 19:19:02,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:02,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232591815] [2023-12-16 19:19:02,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:02,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:02,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:03,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:19:03,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:03,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-16 19:19:03,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:03,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-16 19:19:03,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:03,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2023-12-16 19:19:03,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:03,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2023-12-16 19:19:03,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:03,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2023-12-16 19:19:03,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:03,540 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:19:03,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:03,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232591815] [2023-12-16 19:19:03,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232591815] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:03,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:03,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 19:19:03,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384511305] [2023-12-16 19:19:03,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:03,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 19:19:03,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:03,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 19:19:03,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 19:19:03,542 INFO L87 Difference]: Start difference. First operand 813 states and 1170 transitions. Second operand has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:19:03,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:03,622 INFO L93 Difference]: Finished difference Result 1295 states and 1868 transitions. [2023-12-16 19:19:03,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:03,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 444 [2023-12-16 19:19:03,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:03,623 INFO L225 Difference]: With dead ends: 1295 [2023-12-16 19:19:03,623 INFO L226 Difference]: Without dead ends: 813 [2023-12-16 19:19:03,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:03,624 INFO L413 NwaCegarLoop]: 591 mSDtfsCounter, 437 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:03,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 1184 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:03,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2023-12-16 19:19:03,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2023-12-16 19:19:03,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 801 states have (on average 1.4344569288389513) internal successors, (1149), 801 states have internal predecessors, (1149), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 19:19:03,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1169 transitions. [2023-12-16 19:19:03,647 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1169 transitions. Word has length 444 [2023-12-16 19:19:03,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:03,647 INFO L495 AbstractCegarLoop]: Abstraction has 813 states and 1169 transitions. [2023-12-16 19:19:03,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:19:03,647 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1169 transitions. [2023-12-16 19:19:03,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2023-12-16 19:19:03,649 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:03,650 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:03,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2023-12-16 19:19:03,650 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:03,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:03,650 INFO L85 PathProgramCache]: Analyzing trace with hash -278917008, now seen corresponding path program 1 times [2023-12-16 19:19:03,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:03,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061512187] [2023-12-16 19:19:03,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:03,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:04,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:04,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:19:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:04,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-16 19:19:04,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:04,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-16 19:19:04,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:04,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2023-12-16 19:19:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:04,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2023-12-16 19:19:04,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:04,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2023-12-16 19:19:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:04,600 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:19:04,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:04,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061512187] [2023-12-16 19:19:04,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061512187] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:04,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:04,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:04,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794269522] [2023-12-16 19:19:04,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:04,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:04,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:04,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:04,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:04,602 INFO L87 Difference]: Start difference. First operand 813 states and 1169 transitions. Second operand has 5 states, 5 states have (on average 83.4) internal successors, (417), 5 states have internal predecessors, (417), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:19:04,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:04,697 INFO L93 Difference]: Finished difference Result 1295 states and 1866 transitions. [2023-12-16 19:19:04,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:04,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 83.4) internal successors, (417), 5 states have internal predecessors, (417), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 444 [2023-12-16 19:19:04,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:04,699 INFO L225 Difference]: With dead ends: 1295 [2023-12-16 19:19:04,699 INFO L226 Difference]: Without dead ends: 813 [2023-12-16 19:19:04,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:04,700 INFO L413 NwaCegarLoop]: 591 mSDtfsCounter, 933 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:04,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [933 Valid, 1184 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:04,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2023-12-16 19:19:04,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2023-12-16 19:19:04,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 801 states have (on average 1.4332084893882646) internal successors, (1148), 801 states have internal predecessors, (1148), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 19:19:04,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1168 transitions. [2023-12-16 19:19:04,723 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1168 transitions. Word has length 444 [2023-12-16 19:19:04,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:04,724 INFO L495 AbstractCegarLoop]: Abstraction has 813 states and 1168 transitions. [2023-12-16 19:19:04,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.4) internal successors, (417), 5 states have internal predecessors, (417), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:19:04,724 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1168 transitions. [2023-12-16 19:19:04,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2023-12-16 19:19:04,726 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:04,726 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:04,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2023-12-16 19:19:04,727 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:04,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:04,727 INFO L85 PathProgramCache]: Analyzing trace with hash 701833774, now seen corresponding path program 1 times [2023-12-16 19:19:04,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:04,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640656988] [2023-12-16 19:19:04,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:04,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:05,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:05,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:19:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:05,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-16 19:19:05,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:05,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-16 19:19:05,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:05,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2023-12-16 19:19:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:05,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2023-12-16 19:19:05,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:05,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2023-12-16 19:19:05,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:05,709 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:19:05,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:05,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640656988] [2023-12-16 19:19:05,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640656988] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:05,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:05,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:05,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390099572] [2023-12-16 19:19:05,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:05,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:05,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:05,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:05,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:05,710 INFO L87 Difference]: Start difference. First operand 813 states and 1168 transitions. Second operand has 5 states, 5 states have (on average 83.4) internal successors, (417), 5 states have internal predecessors, (417), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:19:05,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:05,823 INFO L93 Difference]: Finished difference Result 1295 states and 1864 transitions. [2023-12-16 19:19:05,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:05,825 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 83.4) internal successors, (417), 5 states have internal predecessors, (417), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 444 [2023-12-16 19:19:05,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:05,826 INFO L225 Difference]: With dead ends: 1295 [2023-12-16 19:19:05,826 INFO L226 Difference]: Without dead ends: 813 [2023-12-16 19:19:05,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:05,829 INFO L413 NwaCegarLoop]: 591 mSDtfsCounter, 504 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 1190 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:05,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 1190 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:05,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2023-12-16 19:19:05,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2023-12-16 19:19:05,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 801 states have (on average 1.431960049937578) internal successors, (1147), 801 states have internal predecessors, (1147), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 19:19:05,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1167 transitions. [2023-12-16 19:19:05,853 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1167 transitions. Word has length 444 [2023-12-16 19:19:05,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:05,855 INFO L495 AbstractCegarLoop]: Abstraction has 813 states and 1167 transitions. [2023-12-16 19:19:05,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.4) internal successors, (417), 5 states have internal predecessors, (417), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:19:05,855 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1167 transitions. [2023-12-16 19:19:05,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2023-12-16 19:19:05,858 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:05,858 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:05,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2023-12-16 19:19:05,858 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:05,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:05,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1888811116, now seen corresponding path program 1 times [2023-12-16 19:19:05,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:05,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40264081] [2023-12-16 19:19:05,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:05,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:06,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:06,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:19:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:06,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-16 19:19:06,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:06,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-16 19:19:06,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:06,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2023-12-16 19:19:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:06,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2023-12-16 19:19:06,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:06,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2023-12-16 19:19:06,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:06,966 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:19:06,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:06,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40264081] [2023-12-16 19:19:06,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40264081] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:06,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:06,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 19:19:06,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396205658] [2023-12-16 19:19:06,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:06,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 19:19:06,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:06,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 19:19:06,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 19:19:06,969 INFO L87 Difference]: Start difference. First operand 813 states and 1167 transitions. Second operand has 5 states, 5 states have (on average 83.4) internal successors, (417), 5 states have internal predecessors, (417), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:19:07,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:07,080 INFO L93 Difference]: Finished difference Result 1295 states and 1862 transitions. [2023-12-16 19:19:07,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 19:19:07,081 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 83.4) internal successors, (417), 5 states have internal predecessors, (417), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 444 [2023-12-16 19:19:07,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:07,082 INFO L225 Difference]: With dead ends: 1295 [2023-12-16 19:19:07,082 INFO L226 Difference]: Without dead ends: 813 [2023-12-16 19:19:07,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:07,084 INFO L413 NwaCegarLoop]: 591 mSDtfsCounter, 908 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:07,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 1184 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 19:19:07,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2023-12-16 19:19:07,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 813. [2023-12-16 19:19:07,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 801 states have (on average 1.4307116104868913) internal successors, (1146), 801 states have internal predecessors, (1146), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 19:19:07,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1166 transitions. [2023-12-16 19:19:07,108 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1166 transitions. Word has length 444 [2023-12-16 19:19:07,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:07,108 INFO L495 AbstractCegarLoop]: Abstraction has 813 states and 1166 transitions. [2023-12-16 19:19:07,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.4) internal successors, (417), 5 states have internal predecessors, (417), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:19:07,108 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1166 transitions. [2023-12-16 19:19:07,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2023-12-16 19:19:07,111 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:07,111 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:07,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2023-12-16 19:19:07,112 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:07,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:07,112 INFO L85 PathProgramCache]: Analyzing trace with hash 2018675694, now seen corresponding path program 1 times [2023-12-16 19:19:07,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:07,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709910752] [2023-12-16 19:19:07,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:07,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 19:19:07,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:08,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-16 19:19:08,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:08,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-16 19:19:08,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:08,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-16 19:19:08,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:08,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2023-12-16 19:19:08,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:08,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2023-12-16 19:19:08,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:08,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2023-12-16 19:19:08,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 19:19:08,371 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-16 19:19:08,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 19:19:08,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709910752] [2023-12-16 19:19:08,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709910752] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 19:19:08,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 19:19:08,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 19:19:08,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023094387] [2023-12-16 19:19:08,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 19:19:08,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 19:19:08,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 19:19:08,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 19:19:08,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 19:19:08,376 INFO L87 Difference]: Start difference. First operand 813 states and 1166 transitions. Second operand has 6 states, 6 states have (on average 69.5) internal successors, (417), 6 states have internal predecessors, (417), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:19:08,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 19:19:08,693 INFO L93 Difference]: Finished difference Result 1910 states and 2756 transitions. [2023-12-16 19:19:08,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 19:19:08,693 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 69.5) internal successors, (417), 6 states have internal predecessors, (417), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 444 [2023-12-16 19:19:08,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 19:19:08,695 INFO L225 Difference]: With dead ends: 1910 [2023-12-16 19:19:08,695 INFO L226 Difference]: Without dead ends: 1428 [2023-12-16 19:19:08,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 19:19:08,696 INFO L413 NwaCegarLoop]: 511 mSDtfsCounter, 624 mSDsluCounter, 1701 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 2212 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 19:19:08,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 2212 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 19:19:08,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2023-12-16 19:19:08,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1261. [2023-12-16 19:19:08,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 1244 states have (on average 1.4284565916398715) internal successors, (1777), 1244 states have internal predecessors, (1777), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-16 19:19:08,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 1807 transitions. [2023-12-16 19:19:08,746 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 1807 transitions. Word has length 444 [2023-12-16 19:19:08,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 19:19:08,747 INFO L495 AbstractCegarLoop]: Abstraction has 1261 states and 1807 transitions. [2023-12-16 19:19:08,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.5) internal successors, (417), 6 states have internal predecessors, (417), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-16 19:19:08,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 1807 transitions. [2023-12-16 19:19:08,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2023-12-16 19:19:08,750 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 19:19:08,750 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:08,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2023-12-16 19:19:08,750 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 19:19:08,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 19:19:08,751 INFO L85 PathProgramCache]: Analyzing trace with hash -186892538, now seen corresponding path program 1 times [2023-12-16 19:19:08,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 19:19:08,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055654305] [2023-12-16 19:19:08,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 19:19:08,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms Received shutdown request... [2023-12-16 19:19:09,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2023-12-16 19:19:09,087 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 19:19:09,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2023-12-16 19:19:09,087 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 446 with TraceHistMax 6,while AutomatonFreeRefinementEngine was Timeout during feasibility check between IpTcStrategyModuleSmtInterpolCraig [2055654305] and IpTcStrategyModuleZ3 [109388071]. [2023-12-16 19:19:09,091 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:19:09,093 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 19:19:09,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 07:19:09 BoogieIcfgContainer [2023-12-16 19:19:09,095 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 19:19:09,096 INFO L158 Benchmark]: Toolchain (without parser) took 48077.36ms. Allocated memory was 217.1MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 172.1MB in the beginning and 1.1GB in the end (delta: -968.6MB). Peak memory consumption was 283.7MB. Max. memory is 8.0GB. [2023-12-16 19:19:09,096 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 176.2MB. Free memory is still 129.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 19:19:09,096 INFO L158 Benchmark]: CACSL2BoogieTranslator took 472.43ms. Allocated memory is still 217.1MB. Free memory was 171.8MB in the beginning and 133.9MB in the end (delta: 37.9MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2023-12-16 19:19:09,096 INFO L158 Benchmark]: Boogie Procedure Inliner took 218.93ms. Allocated memory is still 217.1MB. Free memory was 133.9MB in the beginning and 147.9MB in the end (delta: -14.0MB). Peak memory consumption was 19.8MB. Max. memory is 8.0GB. [2023-12-16 19:19:09,096 INFO L158 Benchmark]: Boogie Preprocessor took 315.19ms. Allocated memory is still 217.1MB. Free memory was 147.9MB in the beginning and 145.3MB in the end (delta: 2.6MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2023-12-16 19:19:09,096 INFO L158 Benchmark]: RCFGBuilder took 1427.99ms. Allocated memory was 217.1MB in the beginning and 357.6MB in the end (delta: 140.5MB). Free memory was 145.3MB in the beginning and 228.0MB in the end (delta: -82.7MB). Peak memory consumption was 85.2MB. Max. memory is 8.0GB. [2023-12-16 19:19:09,096 INFO L158 Benchmark]: TraceAbstraction took 45638.09ms. Allocated memory was 357.6MB in the beginning and 1.5GB in the end (delta: 1.1GB). Free memory was 227.0MB in the beginning and 1.1GB in the end (delta: -913.8MB). Peak memory consumption was 197.7MB. Max. memory is 8.0GB. [2023-12-16 19:19:09,097 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 176.2MB. Free memory is still 129.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 472.43ms. Allocated memory is still 217.1MB. Free memory was 171.8MB in the beginning and 133.9MB in the end (delta: 37.9MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 218.93ms. Allocated memory is still 217.1MB. Free memory was 133.9MB in the beginning and 147.9MB in the end (delta: -14.0MB). Peak memory consumption was 19.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 315.19ms. Allocated memory is still 217.1MB. Free memory was 147.9MB in the beginning and 145.3MB in the end (delta: 2.6MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1427.99ms. Allocated memory was 217.1MB in the beginning and 357.6MB in the end (delta: 140.5MB). Free memory was 145.3MB in the beginning and 228.0MB in the end (delta: -82.7MB). Peak memory consumption was 85.2MB. Max. memory is 8.0GB. * TraceAbstraction took 45638.09ms. Allocated memory was 357.6MB in the beginning and 1.5GB in the end (delta: 1.1GB). Free memory was 227.0MB in the beginning and 1.1GB in the end (delta: -913.8MB). Peak memory consumption was 197.7MB. 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: 22]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 22). Cancelled while NwaCegarLoop was analyzing trace of length 446 with TraceHistMax 6,while AutomatonFreeRefinementEngine was Timeout during feasibility check between IpTcStrategyModuleSmtInterpolCraig [2055654305] and IpTcStrategyModuleZ3 [109388071]. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 417 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 45.6s, OverallIterations: 65, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 49214 SdHoareTripleChecker+Valid, 7.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 49128 mSDsluCounter, 104440 SdHoareTripleChecker+Invalid, 6.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 62813 mSDsCounter, 162 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10653 IncrementalHoareTripleChecker+Invalid, 10815 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 162 mSolverCounterUnsat, 41627 mSDtfsCounter, 10653 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 927 GetRequests, 634 SyntacticMatches, 1 SemanticMatches, 292 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1261occurred in iteration=64, InterpolantAutomatonStates: 303, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 64 MinimizatonAttempts, 3195 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 8.9s SatisfiabilityAnalysisTime, 22.9s InterpolantComputationTime, 16749 NumberOfCodeBlocks, 16749 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 16685 ConstructedInterpolants, 0 QuantifiedInterpolants, 89013 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 64 InterpolantComputations, 64 PerfectInterpolantSequences, 4287/4287 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 [2023-12-16 19:19:09,101 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown