/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-34.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 03:46:31,822 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 03:46:31,878 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-16 03:46:31,885 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 03:46:31,885 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 03:46:31,914 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 03:46:31,915 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 03:46:31,915 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 03:46:31,916 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 03:46:31,919 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 03:46:31,919 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 03:46:31,920 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 03:46:31,921 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 03:46:31,922 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 03:46:31,922 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 03:46:31,922 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 03:46:31,922 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 03:46:31,922 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 03:46:31,923 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 03:46:31,923 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 03:46:31,923 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 03:46:31,923 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 03:46:31,923 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 03:46:31,924 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 03:46:31,924 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 03:46:31,924 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 03:46:31,924 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 03:46:31,924 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 03:46:31,925 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 03:46:31,925 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 03:46:31,926 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 03:46:31,926 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 03:46:31,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 03:46:31,926 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 03:46:31,926 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 03:46:31,926 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 03:46:31,927 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 03:46:31,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 03:46:31,927 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 03:46:31,927 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 03:46:31,927 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 03:46:31,927 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 03:46:31,928 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 03:46:31,928 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-16 03:46:32,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 03:46:32,138 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 03:46:32,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 03:46:32,140 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 03:46:32,140 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 03:46:32,141 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-34.i [2023-12-16 03:46:33,211 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 03:46:33,352 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 03:46:33,352 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-34.i [2023-12-16 03:46:33,358 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cc16d51b/42a245191d44445280f80394f5dcf79d/FLAG40e6e17e3 [2023-12-16 03:46:33,368 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cc16d51b/42a245191d44445280f80394f5dcf79d [2023-12-16 03:46:33,369 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 03:46:33,370 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 03:46:33,371 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 03:46:33,371 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 03:46:33,374 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 03:46:33,374 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:46:33" (1/1) ... [2023-12-16 03:46:33,375 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48efc880 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:46:33, skipping insertion in model container [2023-12-16 03:46:33,375 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:46:33" (1/1) ... [2023-12-16 03:46:33,397 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 03:46:33,505 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-34.i[915,928] [2023-12-16 03:46:33,531 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 03:46:33,540 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 03:46:33,547 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-34.i[915,928] [2023-12-16 03:46:33,558 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 03:46:33,568 INFO L206 MainTranslator]: Completed translation [2023-12-16 03:46:33,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:46:33 WrapperNode [2023-12-16 03:46:33,568 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 03:46:33,569 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 03:46:33,569 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 03:46:33,569 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 03:46:33,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:46:33" (1/1) ... [2023-12-16 03:46:33,579 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:46:33" (1/1) ... [2023-12-16 03:46:33,594 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 88 [2023-12-16 03:46:33,594 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 03:46:33,595 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 03:46:33,595 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 03:46:33,595 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 03:46:33,602 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:46:33" (1/1) ... [2023-12-16 03:46:33,602 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:46:33" (1/1) ... [2023-12-16 03:46:33,603 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:46:33" (1/1) ... [2023-12-16 03:46:33,611 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 03:46:33,611 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:46:33" (1/1) ... [2023-12-16 03:46:33,611 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:46:33" (1/1) ... [2023-12-16 03:46:33,614 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:46:33" (1/1) ... [2023-12-16 03:46:33,616 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:46:33" (1/1) ... [2023-12-16 03:46:33,617 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:46:33" (1/1) ... [2023-12-16 03:46:33,618 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:46:33" (1/1) ... [2023-12-16 03:46:33,619 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 03:46:33,620 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 03:46:33,620 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 03:46:33,620 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 03:46:33,620 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:46:33" (1/1) ... [2023-12-16 03:46:33,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 03:46:33,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 03:46:33,642 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 03:46:33,673 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 03:46:33,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 03:46:33,675 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 03:46:33,676 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 03:46:33,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 03:46:33,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 03:46:33,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 03:46:33,723 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 03:46:33,724 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 03:46:33,905 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 03:46:33,941 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 03:46:33,942 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 03:46:33,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:46:33 BoogieIcfgContainer [2023-12-16 03:46:33,942 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 03:46:33,943 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 03:46:33,944 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 03:46:33,946 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 03:46:33,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 03:46:33" (1/3) ... [2023-12-16 03:46:33,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1efacb77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:46:33, skipping insertion in model container [2023-12-16 03:46:33,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:46:33" (2/3) ... [2023-12-16 03:46:33,947 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1efacb77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:46:33, skipping insertion in model container [2023-12-16 03:46:33,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:46:33" (3/3) ... [2023-12-16 03:46:33,947 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-34.i [2023-12-16 03:46:33,960 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 03:46:33,960 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 03:46:34,000 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 03:46:34,004 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;@7fee366, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 03:46:34,004 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 03:46:34,007 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-16 03:46:34,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-16 03:46:34,018 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:46:34,019 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:46:34,019 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:46:34,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:46:34,025 INFO L85 PathProgramCache]: Analyzing trace with hash 571880049, now seen corresponding path program 1 times [2023-12-16 03:46:34,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:46:34,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732718404] [2023-12-16 03:46:34,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:46:34,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:46:34,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:34,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:46:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:34,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 03:46:34,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:34,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:46:34,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:34,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-16 03:46:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:34,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:46:34,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:34,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 03:46:34,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:34,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:46:34,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:34,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 03:46:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:34,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:46:34,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:34,236 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-16 03:46:34,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:46:34,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732718404] [2023-12-16 03:46:34,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732718404] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:46:34,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:46:34,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 03:46:34,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328159514] [2023-12-16 03:46:34,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:46:34,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 03:46:34,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:46:34,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 03:46:34,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 03:46:34,266 INFO L87 Difference]: Start difference. First operand has 33 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-16 03:46:34,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:46:34,293 INFO L93 Difference]: Finished difference Result 63 states and 105 transitions. [2023-12-16 03:46:34,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 03:46:34,295 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 59 [2023-12-16 03:46:34,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:46:34,299 INFO L225 Difference]: With dead ends: 63 [2023-12-16 03:46:34,299 INFO L226 Difference]: Without dead ends: 31 [2023-12-16 03:46:34,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 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 03:46:34,304 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 03:46:34,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:46:34,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-16 03:46:34,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-12-16 03:46:34,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-16 03:46:34,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2023-12-16 03:46:34,329 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 44 transitions. Word has length 59 [2023-12-16 03:46:34,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:46:34,329 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 44 transitions. [2023-12-16 03:46:34,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-16 03:46:34,329 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 44 transitions. [2023-12-16 03:46:34,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-16 03:46:34,331 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:46:34,331 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:46:34,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 03:46:34,331 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:46:34,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:46:34,332 INFO L85 PathProgramCache]: Analyzing trace with hash 614092019, now seen corresponding path program 1 times [2023-12-16 03:46:34,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:46:34,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913080212] [2023-12-16 03:46:34,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:46:34,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:46:34,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:36,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:46:36,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:36,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 03:46:36,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:36,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:46:36,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:36,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-16 03:46:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:36,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:46:36,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:36,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 03:46:36,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:36,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:46:36,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:36,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 03:46:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:36,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:46:36,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:36,112 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-16 03:46:36,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:46:36,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913080212] [2023-12-16 03:46:36,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913080212] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:46:36,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:46:36,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 03:46:36,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130750664] [2023-12-16 03:46:36,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:46:36,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 03:46:36,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:46:36,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 03:46:36,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-12-16 03:46:36,119 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-16 03:46:36,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:46:36,380 INFO L93 Difference]: Finished difference Result 85 states and 115 transitions. [2023-12-16 03:46:36,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 03:46:36,381 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 59 [2023-12-16 03:46:36,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:46:36,385 INFO L225 Difference]: With dead ends: 85 [2023-12-16 03:46:36,385 INFO L226 Difference]: Without dead ends: 83 [2023-12-16 03:46:36,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2023-12-16 03:46:36,387 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 72 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 03:46:36,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 134 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 03:46:36,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-12-16 03:46:36,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 64. [2023-12-16 03:46:36,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 43 states have internal predecessors, (57), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-16 03:46:36,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 93 transitions. [2023-12-16 03:46:36,415 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 93 transitions. Word has length 59 [2023-12-16 03:46:36,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:46:36,416 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 93 transitions. [2023-12-16 03:46:36,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-16 03:46:36,417 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 93 transitions. [2023-12-16 03:46:36,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-16 03:46:36,419 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:46:36,420 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:46:36,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 03:46:36,422 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:46:36,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:46:36,425 INFO L85 PathProgramCache]: Analyzing trace with hash 614151601, now seen corresponding path program 1 times [2023-12-16 03:46:36,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:46:36,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503930866] [2023-12-16 03:46:36,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:46:36,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:46:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:37,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:46:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:37,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 03:46:37,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:37,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:46:37,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:37,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-16 03:46:37,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:37,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:46:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:37,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 03:46:37,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:37,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:46:37,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:37,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 03:46:37,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:37,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:46:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:37,336 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-16 03:46:37,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:46:37,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503930866] [2023-12-16 03:46:37,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503930866] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:46:37,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:46:37,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 03:46:37,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708595174] [2023-12-16 03:46:37,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:46:37,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 03:46:37,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:46:37,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 03:46:37,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 03:46:37,338 INFO L87 Difference]: Start difference. First operand 64 states and 93 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-16 03:46:37,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:46:37,606 INFO L93 Difference]: Finished difference Result 215 states and 296 transitions. [2023-12-16 03:46:37,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 03:46:37,607 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 59 [2023-12-16 03:46:37,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:46:37,610 INFO L225 Difference]: With dead ends: 215 [2023-12-16 03:46:37,610 INFO L226 Difference]: Without dead ends: 152 [2023-12-16 03:46:37,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2023-12-16 03:46:37,615 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 86 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 03:46:37,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 183 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 03:46:37,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-12-16 03:46:37,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 129. [2023-12-16 03:46:37,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 36 states have call successors, (36), 8 states have call predecessors, (36), 8 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-16 03:46:37,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 172 transitions. [2023-12-16 03:46:37,650 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 172 transitions. Word has length 59 [2023-12-16 03:46:37,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:46:37,651 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 172 transitions. [2023-12-16 03:46:37,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-16 03:46:37,651 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 172 transitions. [2023-12-16 03:46:37,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-16 03:46:37,655 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:46:37,655 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:46:37,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 03:46:37,656 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:46:37,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:46:37,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1438364895, now seen corresponding path program 1 times [2023-12-16 03:46:37,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:46:37,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144100941] [2023-12-16 03:46:37,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:46:37,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:46:37,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:37,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:46:37,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:37,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 03:46:37,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:37,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:46:37,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:37,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-16 03:46:37,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:37,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:46:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:37,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 03:46:37,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:37,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:46:37,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:37,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 03:46:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:37,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:46:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:37,760 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-16 03:46:37,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:46:37,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144100941] [2023-12-16 03:46:37,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144100941] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:46:37,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:46:37,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 03:46:37,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497269803] [2023-12-16 03:46:37,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:46:37,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 03:46:37,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:46:37,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 03:46:37,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 03:46:37,763 INFO L87 Difference]: Start difference. First operand 129 states and 172 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-16 03:46:37,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:46:37,826 INFO L93 Difference]: Finished difference Result 302 states and 405 transitions. [2023-12-16 03:46:37,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 03:46:37,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 60 [2023-12-16 03:46:37,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:46:37,828 INFO L225 Difference]: With dead ends: 302 [2023-12-16 03:46:37,828 INFO L226 Difference]: Without dead ends: 174 [2023-12-16 03:46:37,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 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 03:46:37,837 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 29 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 03:46:37,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 117 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:46:37,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-12-16 03:46:37,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 150. [2023-12-16 03:46:37,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 95 states have (on average 1.1789473684210525) internal successors, (112), 95 states have internal predecessors, (112), 45 states have call successors, (45), 9 states have call predecessors, (45), 9 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2023-12-16 03:46:37,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 202 transitions. [2023-12-16 03:46:37,857 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 202 transitions. Word has length 60 [2023-12-16 03:46:37,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:46:37,858 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 202 transitions. [2023-12-16 03:46:37,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-16 03:46:37,858 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 202 transitions. [2023-12-16 03:46:37,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-16 03:46:37,858 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:46:37,859 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:46:37,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 03:46:37,859 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:46:37,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:46:37,859 INFO L85 PathProgramCache]: Analyzing trace with hash 336642467, now seen corresponding path program 1 times [2023-12-16 03:46:37,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:46:37,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102742448] [2023-12-16 03:46:37,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:46:37,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:46:37,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:37,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:46:37,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:37,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 03:46:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:37,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:46:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:37,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-16 03:46:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:37,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:46:37,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:37,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 03:46:37,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:37,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:46:37,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:37,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 03:46:37,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:37,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:46:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:37,973 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-16 03:46:37,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:46:37,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102742448] [2023-12-16 03:46:37,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102742448] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:46:37,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:46:37,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 03:46:37,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878660608] [2023-12-16 03:46:37,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:46:37,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 03:46:37,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:46:37,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 03:46:37,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 03:46:37,975 INFO L87 Difference]: Start difference. First operand 150 states and 202 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-16 03:46:38,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:46:38,039 INFO L93 Difference]: Finished difference Result 366 states and 490 transitions. [2023-12-16 03:46:38,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 03:46:38,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 60 [2023-12-16 03:46:38,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:46:38,041 INFO L225 Difference]: With dead ends: 366 [2023-12-16 03:46:38,041 INFO L226 Difference]: Without dead ends: 237 [2023-12-16 03:46:38,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 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 03:46:38,042 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 42 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 03:46:38,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 126 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:46:38,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2023-12-16 03:46:38,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 171. [2023-12-16 03:46:38,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 106 states have (on average 1.169811320754717) internal successors, (124), 108 states have internal predecessors, (124), 54 states have call successors, (54), 10 states have call predecessors, (54), 10 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-16 03:46:38,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 232 transitions. [2023-12-16 03:46:38,062 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 232 transitions. Word has length 60 [2023-12-16 03:46:38,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:46:38,062 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 232 transitions. [2023-12-16 03:46:38,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-16 03:46:38,062 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 232 transitions. [2023-12-16 03:46:38,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-16 03:46:38,063 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:46:38,063 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:46:38,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 03:46:38,063 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:46:38,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:46:38,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1618044216, now seen corresponding path program 1 times [2023-12-16 03:46:38,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:46:38,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031322581] [2023-12-16 03:46:38,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:46:38,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:46:38,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:39,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:46:39,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:39,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 03:46:39,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:39,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:46:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:39,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-16 03:46:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:39,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:46:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:39,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 03:46:39,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:39,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:46:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:39,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 03:46:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:39,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:46:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:39,338 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-16 03:46:39,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:46:39,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031322581] [2023-12-16 03:46:39,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031322581] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:46:39,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:46:39,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 03:46:39,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314739706] [2023-12-16 03:46:39,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:46:39,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 03:46:39,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:46:39,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 03:46:39,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 03:46:39,339 INFO L87 Difference]: Start difference. First operand 171 states and 232 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-16 03:46:39,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:46:39,672 INFO L93 Difference]: Finished difference Result 292 states and 392 transitions. [2023-12-16 03:46:39,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 03:46:39,673 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 60 [2023-12-16 03:46:39,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:46:39,675 INFO L225 Difference]: With dead ends: 292 [2023-12-16 03:46:39,675 INFO L226 Difference]: Without dead ends: 207 [2023-12-16 03:46:39,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2023-12-16 03:46:39,676 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 26 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 03:46:39,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 173 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 03:46:39,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2023-12-16 03:46:39,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 176. [2023-12-16 03:46:39,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 111 states have (on average 1.1801801801801801) internal successors, (131), 113 states have internal predecessors, (131), 54 states have call successors, (54), 10 states have call predecessors, (54), 10 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-16 03:46:39,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 239 transitions. [2023-12-16 03:46:39,694 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 239 transitions. Word has length 60 [2023-12-16 03:46:39,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:46:39,694 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 239 transitions. [2023-12-16 03:46:39,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-16 03:46:39,694 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 239 transitions. [2023-12-16 03:46:39,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-16 03:46:39,695 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:46:39,695 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:46:39,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 03:46:39,695 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:46:39,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:46:39,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1619891258, now seen corresponding path program 1 times [2023-12-16 03:46:39,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:46:39,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465851705] [2023-12-16 03:46:39,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:46:39,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:46:39,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:39,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:46:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:39,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 03:46:39,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:39,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:46:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:39,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-16 03:46:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:39,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:46:39,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:39,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 03:46:39,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:39,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:46:39,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:39,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 03:46:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:39,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:46:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:39,794 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-12-16 03:46:39,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:46:39,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465851705] [2023-12-16 03:46:39,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465851705] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 03:46:39,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846416208] [2023-12-16 03:46:39,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:46:39,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 03:46:39,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 03:46:39,797 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 03:46:39,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-16 03:46:39,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:39,868 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 03:46:39,873 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 03:46:39,933 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 12 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-12-16 03:46:39,933 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 03:46:40,056 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-12-16 03:46:40,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846416208] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 03:46:40,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 03:46:40,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2023-12-16 03:46:40,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435987647] [2023-12-16 03:46:40,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 03:46:40,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 03:46:40,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:46:40,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 03:46:40,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-16 03:46:40,058 INFO L87 Difference]: Start difference. First operand 176 states and 239 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 03:46:40,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:46:40,180 INFO L93 Difference]: Finished difference Result 286 states and 375 transitions. [2023-12-16 03:46:40,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 03:46:40,181 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 60 [2023-12-16 03:46:40,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:46:40,182 INFO L225 Difference]: With dead ends: 286 [2023-12-16 03:46:40,182 INFO L226 Difference]: Without dead ends: 111 [2023-12-16 03:46:40,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 133 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2023-12-16 03:46:40,183 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 49 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 03:46:40,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 57 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 03:46:40,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-12-16 03:46:40,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 99. [2023-12-16 03:46:40,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 63 states have (on average 1.0952380952380953) internal successors, (69), 64 states have internal predecessors, (69), 27 states have call successors, (27), 8 states have call predecessors, (27), 8 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-16 03:46:40,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 123 transitions. [2023-12-16 03:46:40,206 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 123 transitions. Word has length 60 [2023-12-16 03:46:40,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:46:40,206 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 123 transitions. [2023-12-16 03:46:40,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-16 03:46:40,207 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 123 transitions. [2023-12-16 03:46:40,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-16 03:46:40,210 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:46:40,210 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 2, 2, 2, 2, 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] [2023-12-16 03:46:40,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-16 03:46:40,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 03:46:40,414 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:46:40,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:46:40,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1515412901, now seen corresponding path program 1 times [2023-12-16 03:46:40,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:46:40,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710649705] [2023-12-16 03:46:40,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:46:40,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:46:40,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:40,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:46:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:40,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 03:46:40,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:40,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:46:40,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:40,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-16 03:46:40,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:40,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:46:40,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:40,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 03:46:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:40,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:46:40,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:40,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 03:46:40,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:40,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:46:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:40,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-16 03:46:40,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:40,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-16 03:46:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:40,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 03:46:40,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:40,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 03:46:40,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:40,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-16 03:46:40,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:40,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-16 03:46:40,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:40,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-16 03:46:40,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:40,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-12-16 03:46:40,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:40,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 03:46:40,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:40,643 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-16 03:46:40,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:46:40,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710649705] [2023-12-16 03:46:40,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710649705] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 03:46:40,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 03:46:40,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 03:46:40,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663394852] [2023-12-16 03:46:40,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:46:40,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 03:46:40,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:46:40,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 03:46:40,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 03:46:40,645 INFO L87 Difference]: Start difference. First operand 99 states and 123 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-16 03:46:40,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:46:40,717 INFO L93 Difference]: Finished difference Result 205 states and 251 transitions. [2023-12-16 03:46:40,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 03:46:40,718 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 118 [2023-12-16 03:46:40,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:46:40,718 INFO L225 Difference]: With dead ends: 205 [2023-12-16 03:46:40,718 INFO L226 Difference]: Without dead ends: 107 [2023-12-16 03:46:40,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-16 03:46:40,719 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 57 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 03:46:40,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 43 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 03:46:40,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-12-16 03:46:40,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 90. [2023-12-16 03:46:40,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 61 states have internal predecessors, (65), 21 states have call successors, (21), 8 states have call predecessors, (21), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-16 03:46:40,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 107 transitions. [2023-12-16 03:46:40,732 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 107 transitions. Word has length 118 [2023-12-16 03:46:40,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:46:40,732 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 107 transitions. [2023-12-16 03:46:40,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-16 03:46:40,732 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 107 transitions. [2023-12-16 03:46:40,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-16 03:46:40,733 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:46:40,733 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 2, 2, 2, 2, 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] [2023-12-16 03:46:40,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 03:46:40,733 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:46:40,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:46:40,734 INFO L85 PathProgramCache]: Analyzing trace with hash 259594461, now seen corresponding path program 1 times [2023-12-16 03:46:40,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:46:40,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556925104] [2023-12-16 03:46:40,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:46:40,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:46:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:41,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 03:46:41,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:41,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 03:46:41,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:41,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 03:46:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:41,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-16 03:46:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:41,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 03:46:41,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:41,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 03:46:41,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:41,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 03:46:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:41,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 03:46:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:41,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 03:46:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:41,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-16 03:46:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:41,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-16 03:46:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:41,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 03:46:41,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:41,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 03:46:41,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:41,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-16 03:46:41,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:41,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-16 03:46:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:41,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-16 03:46:41,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:41,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-12-16 03:46:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:41,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 03:46:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:41,874 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2023-12-16 03:46:41,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 03:46:41,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556925104] [2023-12-16 03:46:41,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556925104] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 03:46:41,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695950832] [2023-12-16 03:46:41,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:46:41,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 03:46:41,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 03:46:41,875 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 03:46:41,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-16 03:46:41,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 03:46:41,949 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 39 conjunts are in the unsatisfiable core [2023-12-16 03:46:41,953 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 03:47:17,633 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 13 proven. 356 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 03:47:17,633 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 03:47:43,116 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2023-12-16 03:47:43,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695950832] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 03:47:43,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-16 03:47:43,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 11] total 22 [2023-12-16 03:47:43,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502854800] [2023-12-16 03:47:43,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 03:47:43,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 03:47:43,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 03:47:43,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 03:47:43,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2023-12-16 03:47:43,118 INFO L87 Difference]: Start difference. First operand 90 states and 107 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-16 03:47:43,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 03:47:43,671 INFO L93 Difference]: Finished difference Result 113 states and 133 transitions. [2023-12-16 03:47:43,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 03:47:43,672 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 118 [2023-12-16 03:47:43,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 03:47:43,672 INFO L225 Difference]: With dead ends: 113 [2023-12-16 03:47:43,672 INFO L226 Difference]: Without dead ends: 111 [2023-12-16 03:47:43,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2023-12-16 03:47:43,673 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 26 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 03:47:43,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 218 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 03:47:43,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-12-16 03:47:43,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 88. [2023-12-16 03:47:43,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.0689655172413792) internal successors, (62), 59 states have internal predecessors, (62), 21 states have call successors, (21), 8 states have call predecessors, (21), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-16 03:47:43,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 104 transitions. [2023-12-16 03:47:43,688 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 104 transitions. Word has length 118 [2023-12-16 03:47:43,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 03:47:43,688 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 104 transitions. [2023-12-16 03:47:43,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-16 03:47:43,689 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2023-12-16 03:47:43,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-16 03:47:43,689 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 03:47:43,689 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 2, 2, 2, 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] [2023-12-16 03:47:43,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-16 03:47:43,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-12-16 03:47:43,895 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 03:47:43,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 03:47:43,896 INFO L85 PathProgramCache]: Analyzing trace with hash 259654043, now seen corresponding path program 1 times [2023-12-16 03:47:43,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 03:47:43,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994478824] [2023-12-16 03:47:43,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 03:47:43,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 03:47:43,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2023-12-16 03:47:44,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 03:47:44,128 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Termination requested (timeout or resource limit) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkResolutionNode(Interpolator.java:275) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:152) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:260) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:237) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:869) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:793) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:352) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:283) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:327) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-16 03:47:44,131 INFO L158 Benchmark]: Toolchain (without parser) took 70760.61ms. Allocated memory was 196.1MB in the beginning and 803.2MB in the end (delta: 607.1MB). Free memory was 158.9MB in the beginning and 472.6MB in the end (delta: -313.7MB). Peak memory consumption was 295.0MB. Max. memory is 8.0GB. [2023-12-16 03:47:44,131 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 196.1MB. Free memory is still 152.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 03:47:44,131 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.86ms. Allocated memory is still 196.1MB. Free memory was 158.5MB in the beginning and 146.4MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 03:47:44,131 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.31ms. Allocated memory is still 196.1MB. Free memory was 146.4MB in the beginning and 144.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 03:47:44,131 INFO L158 Benchmark]: Boogie Preprocessor took 24.29ms. Allocated memory is still 196.1MB. Free memory was 144.4MB in the beginning and 141.7MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 03:47:44,131 INFO L158 Benchmark]: RCFGBuilder took 322.29ms. Allocated memory is still 196.1MB. Free memory was 141.7MB in the beginning and 126.6MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-16 03:47:44,132 INFO L158 Benchmark]: TraceAbstraction took 70186.90ms. Allocated memory was 196.1MB in the beginning and 803.2MB in the end (delta: 607.1MB). Free memory was 126.0MB in the beginning and 472.6MB in the end (delta: -346.7MB). Peak memory consumption was 261.4MB. Max. memory is 8.0GB. [2023-12-16 03:47:44,133 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.13ms. Allocated memory is still 196.1MB. Free memory is still 152.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 197.86ms. Allocated memory is still 196.1MB. Free memory was 158.5MB in the beginning and 146.4MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.31ms. Allocated memory is still 196.1MB. Free memory was 146.4MB in the beginning and 144.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.29ms. Allocated memory is still 196.1MB. Free memory was 144.4MB in the beginning and 141.7MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 322.29ms. Allocated memory is still 196.1MB. Free memory was 141.7MB in the beginning and 126.6MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 70186.90ms. Allocated memory was 196.1MB in the beginning and 803.2MB in the end (delta: 607.1MB). Free memory was 126.0MB in the beginning and 472.6MB in the end (delta: -346.7MB). Peak memory consumption was 261.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Termination requested (timeout or resource limit) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Termination requested (timeout or resource limit): de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkResolutionNode(Interpolator.java:275) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown