/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-20 23:03:50,741 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 23:03:50,796 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-20 23:03:50,799 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 23:03:50,799 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 23:03:50,829 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 23:03:50,830 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 23:03:50,830 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 23:03:50,831 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 23:03:50,834 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 23:03:50,834 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 23:03:50,834 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 23:03:50,835 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 23:03:50,836 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 23:03:50,836 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 23:03:50,836 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 23:03:50,836 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 23:03:50,836 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 23:03:50,836 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 23:03:50,837 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 23:03:50,837 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 23:03:50,838 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 23:03:50,838 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 23:03:50,838 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 23:03:50,838 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 23:03:50,838 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 23:03:50,838 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 23:03:50,839 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 23:03:50,839 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 23:03:50,839 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 23:03:50,840 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 23:03:50,840 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 23:03:50,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 23:03:50,840 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 23:03:50,840 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 23:03:50,841 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 23:03:50,841 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 23:03:50,841 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 23:03:50,841 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 23:03:50,841 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 23:03:50,841 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 23:03:50,841 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 23:03:50,841 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 23:03:50,841 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-20 23:03:51,004 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 23:03:51,017 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 23:03:51,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 23:03:51,020 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 23:03:51,020 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 23:03:51,021 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-20 23:03:52,102 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 23:03:52,252 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 23:03:52,252 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-34.i [2023-12-20 23:03:52,263 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f1a884fb/ae0617b2caff4f69aeccbdd3614770ec/FLAG8d9068bc0 [2023-12-20 23:03:52,274 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f1a884fb/ae0617b2caff4f69aeccbdd3614770ec [2023-12-20 23:03:52,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 23:03:52,278 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 23:03:52,278 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 23:03:52,278 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 23:03:52,282 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 23:03:52,283 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 11:03:52" (1/1) ... [2023-12-20 23:03:52,283 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c6ed036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:03:52, skipping insertion in model container [2023-12-20 23:03:52,283 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 11:03:52" (1/1) ... [2023-12-20 23:03:52,309 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 23:03:52,400 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-20 23:03:52,422 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 23:03:52,429 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 23:03:52,437 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-20 23:03:52,447 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 23:03:52,458 INFO L206 MainTranslator]: Completed translation [2023-12-20 23:03:52,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:03:52 WrapperNode [2023-12-20 23:03:52,458 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 23:03:52,459 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 23:03:52,459 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 23:03:52,459 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 23:03:52,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:03:52" (1/1) ... [2023-12-20 23:03:52,469 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:03:52" (1/1) ... [2023-12-20 23:03:52,488 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 88 [2023-12-20 23:03:52,488 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 23:03:52,489 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 23:03:52,489 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 23:03:52,489 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 23:03:52,496 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:03:52" (1/1) ... [2023-12-20 23:03:52,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:03:52" (1/1) ... [2023-12-20 23:03:52,498 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:03:52" (1/1) ... [2023-12-20 23:03:52,507 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-20 23:03:52,507 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:03:52" (1/1) ... [2023-12-20 23:03:52,507 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:03:52" (1/1) ... [2023-12-20 23:03:52,511 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:03:52" (1/1) ... [2023-12-20 23:03:52,513 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:03:52" (1/1) ... [2023-12-20 23:03:52,514 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:03:52" (1/1) ... [2023-12-20 23:03:52,514 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:03:52" (1/1) ... [2023-12-20 23:03:52,516 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 23:03:52,516 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 23:03:52,516 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 23:03:52,516 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 23:03:52,517 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:03:52" (1/1) ... [2023-12-20 23:03:52,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 23:03:52,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 23:03:52,588 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-20 23:03:52,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-20 23:03:52,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 23:03:52,606 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-20 23:03:52,607 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-20 23:03:52,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 23:03:52,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 23:03:52,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 23:03:52,678 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 23:03:52,684 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 23:03:52,819 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 23:03:52,844 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 23:03:52,845 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-20 23:03:52,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 11:03:52 BoogieIcfgContainer [2023-12-20 23:03:52,845 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 23:03:52,846 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 23:03:52,847 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 23:03:52,856 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 23:03:52,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 11:03:52" (1/3) ... [2023-12-20 23:03:52,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d9e948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 11:03:52, skipping insertion in model container [2023-12-20 23:03:52,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:03:52" (2/3) ... [2023-12-20 23:03:52,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d9e948 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 11:03:52, skipping insertion in model container [2023-12-20 23:03:52,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 11:03:52" (3/3) ... [2023-12-20 23:03:52,858 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-34.i [2023-12-20 23:03:52,869 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 23:03:52,869 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 23:03:52,896 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 23:03:52,900 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;@7272f52, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 23:03:52,900 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 23:03:52,902 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-20 23:03:52,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-20 23:03:52,926 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 23:03:52,926 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-20 23:03:52,927 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 23:03:52,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 23:03:52,933 INFO L85 PathProgramCache]: Analyzing trace with hash 571880049, now seen corresponding path program 1 times [2023-12-20 23:03:52,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 23:03:52,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724005219] [2023-12-20 23:03:52,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 23:03:52,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 23:03:53,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:53,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 23:03:53,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:53,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-20 23:03:53,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:53,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 23:03:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:53,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 23:03:53,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:53,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 23:03:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:53,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 23:03:53,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:53,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 23:03:53,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:53,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 23:03:53,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:53,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 23:03:53,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:53,159 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-20 23:03:53,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 23:03:53,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724005219] [2023-12-20 23:03:53,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724005219] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 23:03:53,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 23:03:53,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 23:03:53,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317900054] [2023-12-20 23:03:53,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 23:03:53,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-20 23:03:53,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 23:03:53,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-20 23:03:53,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 23:03:53,193 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-20 23:03:53,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 23:03:53,215 INFO L93 Difference]: Finished difference Result 63 states and 105 transitions. [2023-12-20 23:03:53,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-20 23:03:53,217 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-20 23:03:53,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 23:03:53,236 INFO L225 Difference]: With dead ends: 63 [2023-12-20 23:03:53,236 INFO L226 Difference]: Without dead ends: 31 [2023-12-20 23:03:53,238 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-20 23:03:53,240 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-20 23:03:53,241 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-20 23:03:53,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-20 23:03:53,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-12-20 23:03:53,262 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-20 23:03:53,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2023-12-20 23:03:53,264 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 44 transitions. Word has length 59 [2023-12-20 23:03:53,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 23:03:53,264 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 44 transitions. [2023-12-20 23:03:53,264 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-20 23:03:53,265 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 44 transitions. [2023-12-20 23:03:53,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-20 23:03:53,266 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 23:03:53,266 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-20 23:03:53,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 23:03:53,267 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 23:03:53,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 23:03:53,267 INFO L85 PathProgramCache]: Analyzing trace with hash 614092019, now seen corresponding path program 1 times [2023-12-20 23:03:53,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 23:03:53,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226751992] [2023-12-20 23:03:53,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 23:03:53,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 23:03:53,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:54,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 23:03:54,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:54,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-20 23:03:54,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:54,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 23:03:54,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:54,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 23:03:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:54,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 23:03:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:54,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 23:03:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:54,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 23:03:54,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:54,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 23:03:54,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:54,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 23:03:54,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:54,964 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-20 23:03:54,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 23:03:54,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226751992] [2023-12-20 23:03:54,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226751992] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 23:03:54,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 23:03:54,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-20 23:03:54,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207707938] [2023-12-20 23:03:54,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 23:03:54,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-20 23:03:54,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 23:03:54,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-20 23:03:54,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-12-20 23:03:54,971 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-20 23:03:55,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 23:03:55,241 INFO L93 Difference]: Finished difference Result 85 states and 115 transitions. [2023-12-20 23:03:55,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-20 23:03:55,242 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-20 23:03:55,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 23:03:55,244 INFO L225 Difference]: With dead ends: 85 [2023-12-20 23:03:55,244 INFO L226 Difference]: Without dead ends: 83 [2023-12-20 23:03:55,244 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-20 23:03:55,245 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-20 23:03:55,245 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-20 23:03:55,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-12-20 23:03:55,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 64. [2023-12-20 23:03:55,269 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-20 23:03:55,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 93 transitions. [2023-12-20 23:03:55,273 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 93 transitions. Word has length 59 [2023-12-20 23:03:55,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 23:03:55,273 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 93 transitions. [2023-12-20 23:03:55,273 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-20 23:03:55,274 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 93 transitions. [2023-12-20 23:03:55,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-20 23:03:55,275 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 23:03:55,275 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-20 23:03:55,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 23:03:55,275 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 23:03:55,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 23:03:55,275 INFO L85 PathProgramCache]: Analyzing trace with hash 614151601, now seen corresponding path program 1 times [2023-12-20 23:03:55,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 23:03:55,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977809337] [2023-12-20 23:03:55,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 23:03:55,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 23:03:55,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:56,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 23:03:56,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:56,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-20 23:03:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:56,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 23:03:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:56,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 23:03:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:56,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 23:03:56,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:56,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 23:03:56,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:56,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 23:03:56,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:56,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 23:03:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:56,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 23:03:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:56,273 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-20 23:03:56,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 23:03:56,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977809337] [2023-12-20 23:03:56,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977809337] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 23:03:56,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 23:03:56,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-20 23:03:56,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311766061] [2023-12-20 23:03:56,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 23:03:56,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 23:03:56,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 23:03:56,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 23:03:56,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-20 23:03:56,277 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-20 23:03:56,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 23:03:56,505 INFO L93 Difference]: Finished difference Result 215 states and 296 transitions. [2023-12-20 23:03:56,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-20 23:03:56,505 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-20 23:03:56,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 23:03:56,509 INFO L225 Difference]: With dead ends: 215 [2023-12-20 23:03:56,509 INFO L226 Difference]: Without dead ends: 152 [2023-12-20 23:03:56,511 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-20 23:03:56,513 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-20 23:03:56,514 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-20 23:03:56,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-12-20 23:03:56,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 129. [2023-12-20 23:03:56,535 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-20 23:03:56,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 172 transitions. [2023-12-20 23:03:56,536 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 172 transitions. Word has length 59 [2023-12-20 23:03:56,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 23:03:56,536 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 172 transitions. [2023-12-20 23:03:56,536 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-20 23:03:56,536 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 172 transitions. [2023-12-20 23:03:56,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-20 23:03:56,537 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 23:03:56,537 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-20 23:03:56,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-20 23:03:56,538 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 23:03:56,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 23:03:56,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1438364895, now seen corresponding path program 1 times [2023-12-20 23:03:56,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 23:03:56,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909829677] [2023-12-20 23:03:56,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 23:03:56,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 23:03:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:56,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 23:03:56,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:56,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-20 23:03:56,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:56,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 23:03:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:56,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 23:03:56,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:56,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 23:03:56,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:56,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 23:03:56,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:56,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 23:03:56,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:56,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 23:03:56,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:56,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 23:03:56,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:56,603 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-20 23:03:56,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 23:03:56,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909829677] [2023-12-20 23:03:56,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909829677] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 23:03:56,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 23:03:56,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 23:03:56,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799584510] [2023-12-20 23:03:56,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 23:03:56,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 23:03:56,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 23:03:56,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 23:03:56,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 23:03:56,604 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-20 23:03:56,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 23:03:56,658 INFO L93 Difference]: Finished difference Result 302 states and 405 transitions. [2023-12-20 23:03:56,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 23:03:56,658 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-20 23:03:56,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 23:03:56,659 INFO L225 Difference]: With dead ends: 302 [2023-12-20 23:03:56,659 INFO L226 Difference]: Without dead ends: 174 [2023-12-20 23:03:56,660 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-20 23:03:56,661 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-20 23:03:56,661 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-20 23:03:56,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-12-20 23:03:56,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 150. [2023-12-20 23:03:56,677 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-20 23:03:56,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 202 transitions. [2023-12-20 23:03:56,678 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 202 transitions. Word has length 60 [2023-12-20 23:03:56,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 23:03:56,679 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 202 transitions. [2023-12-20 23:03:56,679 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-20 23:03:56,679 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 202 transitions. [2023-12-20 23:03:56,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-20 23:03:56,680 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 23:03:56,680 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-20 23:03:56,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-20 23:03:56,680 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 23:03:56,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 23:03:56,680 INFO L85 PathProgramCache]: Analyzing trace with hash 336642467, now seen corresponding path program 1 times [2023-12-20 23:03:56,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 23:03:56,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961467956] [2023-12-20 23:03:56,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 23:03:56,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 23:03:56,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:56,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 23:03:56,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:56,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-20 23:03:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:56,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 23:03:56,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:56,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 23:03:56,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:56,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 23:03:56,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:56,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 23:03:56,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:56,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 23:03:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:56,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 23:03:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:56,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 23:03:56,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:56,763 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-20 23:03:56,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 23:03:56,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961467956] [2023-12-20 23:03:56,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961467956] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 23:03:56,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 23:03:56,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 23:03:56,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43886747] [2023-12-20 23:03:56,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 23:03:56,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 23:03:56,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 23:03:56,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 23:03:56,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 23:03:56,764 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-20 23:03:56,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 23:03:56,823 INFO L93 Difference]: Finished difference Result 366 states and 490 transitions. [2023-12-20 23:03:56,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 23:03:56,824 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-20 23:03:56,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 23:03:56,825 INFO L225 Difference]: With dead ends: 366 [2023-12-20 23:03:56,825 INFO L226 Difference]: Without dead ends: 237 [2023-12-20 23:03:56,826 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-20 23:03:56,826 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-20 23:03:56,826 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-20 23:03:56,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2023-12-20 23:03:56,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 171. [2023-12-20 23:03:56,843 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-20 23:03:56,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 232 transitions. [2023-12-20 23:03:56,844 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 232 transitions. Word has length 60 [2023-12-20 23:03:56,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 23:03:56,845 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 232 transitions. [2023-12-20 23:03:56,845 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-20 23:03:56,845 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 232 transitions. [2023-12-20 23:03:56,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-20 23:03:56,846 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 23:03:56,846 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-20 23:03:56,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-20 23:03:56,846 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 23:03:56,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 23:03:56,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1618044216, now seen corresponding path program 1 times [2023-12-20 23:03:56,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 23:03:56,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125305023] [2023-12-20 23:03:56,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 23:03:56,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 23:03:56,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:58,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 23:03:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:58,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-20 23:03:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:58,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 23:03:58,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:58,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 23:03:58,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:58,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 23:03:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:58,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 23:03:58,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:58,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 23:03:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:58,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 23:03:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:58,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 23:03:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:58,080 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-20 23:03:58,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 23:03:58,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125305023] [2023-12-20 23:03:58,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125305023] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 23:03:58,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 23:03:58,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-20 23:03:58,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701182502] [2023-12-20 23:03:58,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 23:03:58,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-20 23:03:58,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 23:03:58,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-20 23:03:58,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-20 23:03:58,082 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-20 23:03:58,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 23:03:58,403 INFO L93 Difference]: Finished difference Result 292 states and 392 transitions. [2023-12-20 23:03:58,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-20 23:03:58,404 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-20 23:03:58,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 23:03:58,406 INFO L225 Difference]: With dead ends: 292 [2023-12-20 23:03:58,406 INFO L226 Difference]: Without dead ends: 207 [2023-12-20 23:03:58,407 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-20 23:03:58,408 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-20 23:03:58,409 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-20 23:03:58,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2023-12-20 23:03:58,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 176. [2023-12-20 23:03:58,429 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-20 23:03:58,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 239 transitions. [2023-12-20 23:03:58,431 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 239 transitions. Word has length 60 [2023-12-20 23:03:58,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 23:03:58,431 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 239 transitions. [2023-12-20 23:03:58,431 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-20 23:03:58,431 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 239 transitions. [2023-12-20 23:03:58,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-20 23:03:58,433 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 23:03:58,433 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-20 23:03:58,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-20 23:03:58,434 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 23:03:58,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 23:03:58,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1619891258, now seen corresponding path program 1 times [2023-12-20 23:03:58,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 23:03:58,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224520613] [2023-12-20 23:03:58,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 23:03:58,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 23:03:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:58,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 23:03:58,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:58,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-20 23:03:58,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:58,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 23:03:58,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:58,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 23:03:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:58,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 23:03:58,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:58,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 23:03:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:58,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 23:03:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:58,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 23:03:58,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:58,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 23:03:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:58,566 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-20 23:03:58,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 23:03:58,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224520613] [2023-12-20 23:03:58,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224520613] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 23:03:58,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636204833] [2023-12-20 23:03:58,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 23:03:58,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 23:03:58,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 23:03:58,584 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 23:03:58,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-20 23:03:58,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:58,673 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-20 23:03:58,682 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 23:03:58,755 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-20 23:03:58,755 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 23:03:58,856 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-20 23:03:58,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636204833] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 23:03:58,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 23:03:58,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2023-12-20 23:03:58,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326453040] [2023-12-20 23:03:58,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 23:03:58,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-20 23:03:58,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 23:03:58,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-20 23:03:58,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-20 23:03:58,858 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-20 23:03:58,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 23:03:58,961 INFO L93 Difference]: Finished difference Result 286 states and 375 transitions. [2023-12-20 23:03:58,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-20 23:03:58,961 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-20 23:03:58,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 23:03:58,962 INFO L225 Difference]: With dead ends: 286 [2023-12-20 23:03:58,962 INFO L226 Difference]: Without dead ends: 111 [2023-12-20 23:03:58,962 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-20 23:03:58,963 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-20 23:03:58,963 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-20 23:03:58,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-12-20 23:03:58,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 99. [2023-12-20 23:03:58,974 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-20 23:03:58,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 123 transitions. [2023-12-20 23:03:58,974 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 123 transitions. Word has length 60 [2023-12-20 23:03:58,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 23:03:58,974 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 123 transitions. [2023-12-20 23:03:58,975 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-20 23:03:58,975 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 123 transitions. [2023-12-20 23:03:58,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-20 23:03:58,976 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 23:03:58,976 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-20 23:03:58,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-20 23:03:59,180 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-20 23:03:59,180 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 23:03:59,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 23:03:59,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1515412901, now seen corresponding path program 1 times [2023-12-20 23:03:59,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 23:03:59,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677814025] [2023-12-20 23:03:59,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 23:03:59,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 23:03:59,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:59,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 23:03:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:59,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-20 23:03:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:59,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 23:03:59,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:59,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 23:03:59,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:59,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 23:03:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:59,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 23:03:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:59,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 23:03:59,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:59,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 23:03:59,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:59,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 23:03:59,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:59,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-20 23:03:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:59,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-20 23:03:59,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:59,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-20 23:03:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:59,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-20 23:03:59,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:59,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-20 23:03:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:59,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-20 23:03:59,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:59,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-20 23:03:59,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:59,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-12-20 23:03:59,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:59,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-20 23:03:59,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:03:59,416 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-20 23:03:59,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 23:03:59,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677814025] [2023-12-20 23:03:59,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677814025] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 23:03:59,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 23:03:59,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-20 23:03:59,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035718549] [2023-12-20 23:03:59,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 23:03:59,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-20 23:03:59,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 23:03:59,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-20 23:03:59,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-20 23:03:59,417 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-20 23:03:59,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 23:03:59,487 INFO L93 Difference]: Finished difference Result 205 states and 251 transitions. [2023-12-20 23:03:59,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 23:03:59,488 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-20 23:03:59,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 23:03:59,489 INFO L225 Difference]: With dead ends: 205 [2023-12-20 23:03:59,489 INFO L226 Difference]: Without dead ends: 107 [2023-12-20 23:03:59,490 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-20 23:03:59,491 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-20 23:03:59,491 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-20 23:03:59,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-12-20 23:03:59,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 90. [2023-12-20 23:03:59,505 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-20 23:03:59,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 107 transitions. [2023-12-20 23:03:59,505 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 107 transitions. Word has length 118 [2023-12-20 23:03:59,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 23:03:59,506 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 107 transitions. [2023-12-20 23:03:59,506 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-20 23:03:59,506 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 107 transitions. [2023-12-20 23:03:59,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-20 23:03:59,507 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 23:03:59,507 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-20 23:03:59,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-20 23:03:59,507 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 23:03:59,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 23:03:59,507 INFO L85 PathProgramCache]: Analyzing trace with hash 259594461, now seen corresponding path program 1 times [2023-12-20 23:03:59,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 23:03:59,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552700187] [2023-12-20 23:03:59,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 23:03:59,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 23:03:59,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:04:00,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 23:04:00,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:04:00,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-20 23:04:00,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:04:00,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 23:04:00,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:04:00,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 23:04:00,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:04:00,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 23:04:00,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:04:00,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 23:04:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:04:00,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 23:04:00,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:04:00,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 23:04:00,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:04:00,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 23:04:00,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:04:00,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-20 23:04:00,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:04:00,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-20 23:04:00,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:04:00,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-20 23:04:00,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:04:00,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-20 23:04:00,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:04:00,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-20 23:04:00,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:04:00,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-20 23:04:00,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:04:00,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-20 23:04:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:04:00,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-12-20 23:04:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:04:00,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-20 23:04:00,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:04:00,530 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-20 23:04:00,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 23:04:00,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552700187] [2023-12-20 23:04:00,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552700187] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 23:04:00,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942607735] [2023-12-20 23:04:00,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 23:04:00,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 23:04:00,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 23:04:00,532 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-20 23:04:00,553 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-20 23:04:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:04:00,601 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 39 conjunts are in the unsatisfiable core [2023-12-20 23:04:00,604 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 23:04:34,777 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-20 23:04:34,778 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 23:04:59,597 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-20 23:04:59,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942607735] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-20 23:04:59,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-20 23:04:59,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 11] total 22 [2023-12-20 23:04:59,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160656397] [2023-12-20 23:04:59,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 23:04:59,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 23:04:59,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 23:04:59,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 23:04:59,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2023-12-20 23:04:59,600 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-20 23:05:00,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 23:05:00,195 INFO L93 Difference]: Finished difference Result 113 states and 133 transitions. [2023-12-20 23:05:00,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-20 23:05:00,195 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-20 23:05:00,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 23:05:00,198 INFO L225 Difference]: With dead ends: 113 [2023-12-20 23:05:00,199 INFO L226 Difference]: Without dead ends: 111 [2023-12-20 23:05:00,199 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-20 23:05:00,200 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-20 23:05:00,201 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-20 23:05:00,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-12-20 23:05:00,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 88. [2023-12-20 23:05:00,218 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-20 23:05:00,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 104 transitions. [2023-12-20 23:05:00,218 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 104 transitions. Word has length 118 [2023-12-20 23:05:00,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 23:05:00,219 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 104 transitions. [2023-12-20 23:05:00,219 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-20 23:05:00,219 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 104 transitions. [2023-12-20 23:05:00,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-20 23:05:00,220 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 23:05:00,220 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-20 23:05:00,227 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-20 23:05:00,428 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-20 23:05:00,428 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 23:05:00,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 23:05:00,429 INFO L85 PathProgramCache]: Analyzing trace with hash 259654043, now seen corresponding path program 1 times [2023-12-20 23:05:00,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 23:05:00,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163913533] [2023-12-20 23:05:00,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 23:05:00,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 23:05:00,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:05:01,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 23:05:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:05:01,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-20 23:05:01,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:05:01,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 23:05:01,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:05:01,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 23:05:01,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:05:01,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 23:05:01,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:05:01,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 23:05:01,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:05:01,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 23:05:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:05:01,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 23:05:01,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:05:01,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 23:05:01,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:05:01,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-20 23:05:01,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:05:01,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-20 23:05:01,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:05:01,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-20 23:05:01,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:05:01,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-20 23:05:01,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:05:01,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-20 23:05:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:05:01,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-20 23:05:01,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:05:01,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-20 23:05:01,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:05:01,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-12-20 23:05:01,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:05:01,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-20 23:05:01,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:05:01,282 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-20 23:05:01,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 23:05:01,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163913533] [2023-12-20 23:05:01,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163913533] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 23:05:01,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 23:05:01,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-20 23:05:01,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463125914] [2023-12-20 23:05:01,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 23:05:01,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-20 23:05:01,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 23:05:01,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-20 23:05:01,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-12-20 23:05:01,284 INFO L87 Difference]: Start difference. First operand 88 states and 104 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 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-20 23:05:01,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 23:05:01,416 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2023-12-20 23:05:01,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-20 23:05:01,416 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 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-20 23:05:01,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 23:05:01,417 INFO L225 Difference]: With dead ends: 93 [2023-12-20 23:05:01,417 INFO L226 Difference]: Without dead ends: 0 [2023-12-20 23:05:01,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2023-12-20 23:05:01,417 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 11 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 23:05:01,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 107 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 23:05:01,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-20 23:05:01,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-20 23:05:01,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-20 23:05:01,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-20 23:05:01,418 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 118 [2023-12-20 23:05:01,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 23:05:01,418 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-20 23:05:01,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 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-20 23:05:01,418 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-20 23:05:01,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-20 23:05:01,420 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-20 23:05:01,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-20 23:05:01,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-20 23:05:03,156 INFO L899 garLoopResultBuilder]: For program point L64(line 64) no Hoare annotation was computed. [2023-12-20 23:05:03,156 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-20 23:05:03,156 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-20 23:05:03,156 INFO L899 garLoopResultBuilder]: For program point L48(lines 48 52) no Hoare annotation was computed. [2023-12-20 23:05:03,156 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-20 23:05:03,156 INFO L899 garLoopResultBuilder]: For program point L48-1(lines 38 58) no Hoare annotation was computed. [2023-12-20 23:05:03,156 INFO L899 garLoopResultBuilder]: For program point L73(lines 59 74) no Hoare annotation was computed. [2023-12-20 23:05:03,156 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 42) no Hoare annotation was computed. [2023-12-20 23:05:03,156 INFO L895 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: (and (= (* (div ~var_1_11~0 256) 256) ~var_1_11~0) (<= ~var_1_17~0 (* 256 (div ~var_1_17~0 256))) (= ~var_1_8~0 0) (<= ~last_1_var_1_17~0 (* 256 (div ~last_1_var_1_17~0 256)))) [2023-12-20 23:05:03,157 INFO L895 garLoopResultBuilder]: At program point L69-1(line 69) the Hoare annotation is: (and (= (* (div ~var_1_11~0 256) 256) ~var_1_11~0) (<= ~var_1_17~0 (* 256 (div ~var_1_17~0 256))) (= ~var_1_8~0 0) (<= ~last_1_var_1_17~0 (* 256 (div ~last_1_var_1_17~0 256)))) [2023-12-20 23:05:03,157 INFO L895 garLoopResultBuilder]: At program point L61(line 61) the Hoare annotation is: (and (<= ~var_1_17~0 ~var_1_11~0) (<= ~var_1_11~0 (* 256 (div ~var_1_17~0 256))) (= ~var_1_8~0 0) (<= ~last_1_var_1_17~0 (* 256 (div ~last_1_var_1_17~0 256)))) [2023-12-20 23:05:03,157 INFO L899 garLoopResultBuilder]: For program point L61-1(line 61) no Hoare annotation was computed. [2023-12-20 23:05:03,157 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-20 23:05:03,157 INFO L895 garLoopResultBuilder]: At program point L86-2(lines 86 92) the Hoare annotation is: (and (<= ~var_1_17~0 ~var_1_11~0) (<= ~var_1_11~0 (* 256 (div ~var_1_17~0 256))) (= ~var_1_8~0 0) (<= ~last_1_var_1_17~0 (* 256 (div ~last_1_var_1_17~0 256)))) [2023-12-20 23:05:03,157 INFO L899 garLoopResultBuilder]: For program point L86-3(lines 86 92) no Hoare annotation was computed. [2023-12-20 23:05:03,157 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 51) no Hoare annotation was computed. [2023-12-20 23:05:03,157 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2023-12-20 23:05:03,157 INFO L895 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: (and (<= ~var_1_17~0 (* 256 (div ~var_1_17~0 256))) (= ~var_1_8~0 0) (<= ~last_1_var_1_17~0 (* 256 (div ~last_1_var_1_17~0 256)))) [2023-12-20 23:05:03,157 INFO L895 garLoopResultBuilder]: At program point L66-1(line 66) the Hoare annotation is: (and (<= ~var_1_17~0 (* 256 (div ~var_1_17~0 256))) (= ~var_1_8~0 0) (<= ~last_1_var_1_17~0 (* 256 (div ~last_1_var_1_17~0 256)))) [2023-12-20 23:05:03,157 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-20 23:05:03,157 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-20 23:05:03,157 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 58) no Hoare annotation was computed. [2023-12-20 23:05:03,157 INFO L899 garLoopResultBuilder]: For program point L67(line 67) no Hoare annotation was computed. [2023-12-20 23:05:03,157 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (and (<= ~var_1_17~0 ~var_1_11~0) (<= ~var_1_11~0 (* 256 (div ~var_1_17~0 256))) (= ~var_1_8~0 0) (<= ~last_1_var_1_17~0 (* 256 (div ~last_1_var_1_17~0 256)))) [2023-12-20 23:05:03,157 INFO L895 garLoopResultBuilder]: At program point L63-1(line 63) the Hoare annotation is: (and (<= ~var_1_17~0 ~var_1_11~0) (<= ~var_1_11~0 (* 256 (div ~var_1_17~0 256))) (= ~var_1_8~0 0) (<= ~last_1_var_1_17~0 (* 256 (div ~last_1_var_1_17~0 256)))) [2023-12-20 23:05:03,158 INFO L895 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: (and (= (* (div ~var_1_11~0 256) 256) ~var_1_11~0) (<= ~var_1_17~0 (* 256 (div ~var_1_17~0 256))) (= ~var_1_8~0 0) (<= ~last_1_var_1_17~0 (* 256 (div ~last_1_var_1_17~0 256)))) [2023-12-20 23:05:03,158 INFO L895 garLoopResultBuilder]: At program point L72-1(line 72) the Hoare annotation is: (and (= (* (div ~var_1_11~0 256) 256) ~var_1_11~0) (<= ~var_1_17~0 (* 256 (div ~var_1_17~0 256))) (= ~var_1_8~0 0) (<= ~last_1_var_1_17~0 (* 256 (div ~last_1_var_1_17~0 256)))) [2023-12-20 23:05:03,158 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 43) no Hoare annotation was computed. [2023-12-20 23:05:03,158 INFO L899 garLoopResultBuilder]: For program point L39-1(lines 39 43) no Hoare annotation was computed. [2023-12-20 23:05:03,158 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-20 23:05:03,158 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-20 23:05:03,158 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-20 23:05:03,158 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-20 23:05:03,160 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 23:05:03,161 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 23:05:03,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 11:05:03 BoogieIcfgContainer [2023-12-20 23:05:03,168 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 23:05:03,168 INFO L158 Benchmark]: Toolchain (without parser) took 70890.54ms. Allocated memory was 339.7MB in the beginning and 820.0MB in the end (delta: 480.2MB). Free memory was 287.7MB in the beginning and 383.0MB in the end (delta: -95.3MB). Peak memory consumption was 477.5MB. Max. memory is 8.0GB. [2023-12-20 23:05:03,168 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 203.4MB. Free memory is still 153.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 23:05:03,168 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.16ms. Allocated memory is still 339.7MB. Free memory was 287.5MB in the beginning and 275.5MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-20 23:05:03,168 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.37ms. Allocated memory is still 339.7MB. Free memory was 275.3MB in the beginning and 273.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-20 23:05:03,169 INFO L158 Benchmark]: Boogie Preprocessor took 26.80ms. Allocated memory is still 339.7MB. Free memory was 273.2MB in the beginning and 270.7MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-20 23:05:03,169 INFO L158 Benchmark]: RCFGBuilder took 328.83ms. Allocated memory is still 339.7MB. Free memory was 270.7MB in the beginning and 255.6MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-20 23:05:03,169 INFO L158 Benchmark]: TraceAbstraction took 70321.27ms. Allocated memory was 339.7MB in the beginning and 820.0MB in the end (delta: 480.2MB). Free memory was 255.0MB in the beginning and 383.0MB in the end (delta: -128.0MB). Peak memory consumption was 445.0MB. Max. memory is 8.0GB. [2023-12-20 23:05:03,170 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.11ms. Allocated memory is still 203.4MB. Free memory is still 153.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 180.16ms. Allocated memory is still 339.7MB. Free memory was 287.5MB in the beginning and 275.5MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.37ms. Allocated memory is still 339.7MB. Free memory was 275.3MB in the beginning and 273.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.80ms. Allocated memory is still 339.7MB. Free memory was 273.2MB in the beginning and 270.7MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 328.83ms. Allocated memory is still 339.7MB. Free memory was 270.7MB in the beginning and 255.6MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 70321.27ms. Allocated memory was 339.7MB in the beginning and 820.0MB in the end (delta: 480.2MB). Free memory was 255.0MB in the beginning and 383.0MB in the end (delta: -128.0MB). Peak memory consumption was 445.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 70.3s, OverallIterations: 10, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 400 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 398 mSDsluCounter, 1199 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 783 mSDsCounter, 161 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 483 IncrementalHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 161 mSolverCounterUnsat, 416 mSDtfsCounter, 483 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 704 GetRequests, 613 SyntacticMatches, 4 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=176occurred in iteration=6, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 215 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 238 PreInvPairs, 264 NumberOfFragments, 221 HoareAnnotationTreeSize, 238 FormulaSimplifications, 200704 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 11 FormulaSimplificationsInter, 8522 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 65.4s InterpolantComputationTime, 949 NumberOfCodeBlocks, 949 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1113 ConstructedInterpolants, 0 QuantifiedInterpolants, 5493 SizeOfPredicates, 29 NumberOfNonLiveVariables, 460 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 14 InterpolantComputations, 9 PerfectInterpolantSequences, 4068/4461 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 86]: Loop Invariant Derived loop invariant: ((((var_1_17 <= var_1_11) && (var_1_11 <= (256 * (var_1_17 / 256)))) && (var_1_8 == 0)) && (last_1_var_1_17 <= (256 * (last_1_var_1_17 / 256)))) RESULT: Ultimate proved your program to be correct! [2023-12-20 23:05:03,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...