/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/recursive/Primes.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 05:47:32,123 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 05:47:32,260 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-16 05:47:32,264 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 05:47:32,264 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 05:47:32,306 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 05:47:32,306 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 05:47:32,306 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 05:47:32,307 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 05:47:32,310 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 05:47:32,310 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 05:47:32,310 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 05:47:32,311 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 05:47:32,312 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 05:47:32,312 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 05:47:32,312 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 05:47:32,312 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 05:47:32,312 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 05:47:32,313 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 05:47:32,313 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 05:47:32,313 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 05:47:32,314 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 05:47:32,314 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 05:47:32,314 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 05:47:32,314 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 05:47:32,314 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 05:47:32,314 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 05:47:32,314 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 05:47:32,316 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 05:47:32,316 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 05:47:32,317 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 05:47:32,317 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 05:47:32,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 05:47:32,317 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 05:47:32,317 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 05:47:32,317 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 05:47:32,317 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 05:47:32,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 05:47:32,317 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 05:47:32,318 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 05:47:32,318 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 05:47:32,340 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 05:47:32,340 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 05:47:32,340 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-16 05:47:32,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 05:47:32,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 05:47:32,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 05:47:32,690 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 05:47:32,692 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 05:47:32,713 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Primes.c [2023-12-16 05:47:34,266 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 05:47:34,473 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 05:47:34,473 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Primes.c [2023-12-16 05:47:34,479 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c1e4385f/301b7b3d3bc54c3880b415c98d2d0515/FLAG374a98b17 [2023-12-16 05:47:34,493 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c1e4385f/301b7b3d3bc54c3880b415c98d2d0515 [2023-12-16 05:47:34,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 05:47:34,495 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 05:47:34,497 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 05:47:34,498 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 05:47:34,501 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 05:47:34,501 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:47:34" (1/1) ... [2023-12-16 05:47:34,502 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d87305b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:47:34, skipping insertion in model container [2023-12-16 05:47:34,502 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:47:34" (1/1) ... [2023-12-16 05:47:34,518 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 05:47:34,732 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive/Primes.c[2190,2203] [2023-12-16 05:47:34,751 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 05:47:34,758 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 05:47:34,781 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive/Primes.c[2190,2203] [2023-12-16 05:47:34,782 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 05:47:34,803 INFO L206 MainTranslator]: Completed translation [2023-12-16 05:47:34,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:47:34 WrapperNode [2023-12-16 05:47:34,804 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 05:47:34,805 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 05:47:34,805 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 05:47:34,805 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 05:47:34,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:47:34" (1/1) ... [2023-12-16 05:47:34,813 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:47:34" (1/1) ... [2023-12-16 05:47:34,855 INFO L138 Inliner]: procedures = 16, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 56 [2023-12-16 05:47:34,856 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 05:47:34,856 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 05:47:34,857 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 05:47:34,857 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 05:47:34,864 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:47:34" (1/1) ... [2023-12-16 05:47:34,864 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:47:34" (1/1) ... [2023-12-16 05:47:34,865 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:47:34" (1/1) ... [2023-12-16 05:47:34,873 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-16 05:47:34,873 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:47:34" (1/1) ... [2023-12-16 05:47:34,873 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:47:34" (1/1) ... [2023-12-16 05:47:34,876 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:47:34" (1/1) ... [2023-12-16 05:47:34,877 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:47:34" (1/1) ... [2023-12-16 05:47:34,878 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:47:34" (1/1) ... [2023-12-16 05:47:34,879 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:47:34" (1/1) ... [2023-12-16 05:47:34,891 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 05:47:34,899 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 05:47:34,899 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 05:47:34,899 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 05:47:34,900 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:47:34" (1/1) ... [2023-12-16 05:47:34,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 05:47:34,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 05:47:34,949 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 05:47:35,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 05:47:35,040 INFO L130 BoogieDeclarations]: Found specification of procedure multiple_of [2023-12-16 05:47:35,040 INFO L138 BoogieDeclarations]: Found implementation of procedure multiple_of [2023-12-16 05:47:35,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 05:47:35,040 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2023-12-16 05:47:35,040 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2023-12-16 05:47:35,040 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime_ [2023-12-16 05:47:35,041 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime_ [2023-12-16 05:47:35,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 05:47:35,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 05:47:35,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 05:47:35,106 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 05:47:35,108 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 05:47:35,403 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 05:47:35,424 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 05:47:35,424 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-16 05:47:35,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:47:35 BoogieIcfgContainer [2023-12-16 05:47:35,425 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 05:47:35,426 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 05:47:35,426 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 05:47:35,428 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 05:47:35,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 05:47:34" (1/3) ... [2023-12-16 05:47:35,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c15830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:47:35, skipping insertion in model container [2023-12-16 05:47:35,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:47:34" (2/3) ... [2023-12-16 05:47:35,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c15830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:47:35, skipping insertion in model container [2023-12-16 05:47:35,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:47:35" (3/3) ... [2023-12-16 05:47:35,430 INFO L112 eAbstractionObserver]: Analyzing ICFG Primes.c [2023-12-16 05:47:35,451 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 05:47:35,451 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 05:47:35,479 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 05:47:35,484 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;@3d23efbf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 05:47:35,484 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 05:47:35,487 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 36 states have internal predecessors, (53), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-16 05:47:35,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-16 05:47:35,491 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:47:35,492 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 05:47:35,492 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:47:35,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:47:35,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1349448312, now seen corresponding path program 1 times [2023-12-16 05:47:35,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:47:35,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323206244] [2023-12-16 05:47:35,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:47:35,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:47:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:35,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 05:47:35,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:35,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 05:47:35,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:47:35,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323206244] [2023-12-16 05:47:35,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323206244] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:47:35,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 05:47:35,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 05:47:35,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274568315] [2023-12-16 05:47:35,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:47:35,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 05:47:35,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:47:35,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 05:47:35,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 05:47:35,769 INFO L87 Difference]: Start difference. First operand has 49 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 36 states have internal predecessors, (53), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 05:47:35,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:47:35,815 INFO L93 Difference]: Finished difference Result 54 states and 76 transitions. [2023-12-16 05:47:35,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 05:47:35,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-12-16 05:47:35,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:47:35,823 INFO L225 Difference]: With dead ends: 54 [2023-12-16 05:47:35,823 INFO L226 Difference]: Without dead ends: 47 [2023-12-16 05:47:35,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 05:47:35,827 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 05:47:35,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 05:47:35,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-16 05:47:35,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-12-16 05:47:35,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-16 05:47:35,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2023-12-16 05:47:35,879 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 13 [2023-12-16 05:47:35,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:47:35,880 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2023-12-16 05:47:35,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-16 05:47:35,880 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2023-12-16 05:47:35,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-16 05:47:35,882 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:47:35,882 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 05:47:35,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 05:47:35,883 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:47:35,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:47:35,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1094481281, now seen corresponding path program 1 times [2023-12-16 05:47:35,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:47:35,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113334511] [2023-12-16 05:47:35,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:47:35,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:47:35,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:36,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 05:47:36,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:36,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-16 05:47:36,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:36,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 05:47:36,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:47:36,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113334511] [2023-12-16 05:47:36,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113334511] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:47:36,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 05:47:36,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 05:47:36,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142127720] [2023-12-16 05:47:36,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:47:36,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 05:47:36,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:47:36,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 05:47:36,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 05:47:36,126 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 05:47:36,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:47:36,179 INFO L93 Difference]: Finished difference Result 68 states and 90 transitions. [2023-12-16 05:47:36,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 05:47:36,179 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2023-12-16 05:47:36,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:47:36,182 INFO L225 Difference]: With dead ends: 68 [2023-12-16 05:47:36,182 INFO L226 Difference]: Without dead ends: 49 [2023-12-16 05:47:36,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-16 05:47:36,184 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 1 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 05:47:36,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 296 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 05:47:36,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-16 05:47:36,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-12-16 05:47:36,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2023-12-16 05:47:36,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 66 transitions. [2023-12-16 05:47:36,206 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 66 transitions. Word has length 20 [2023-12-16 05:47:36,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:47:36,206 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 66 transitions. [2023-12-16 05:47:36,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 05:47:36,206 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 66 transitions. [2023-12-16 05:47:36,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-16 05:47:36,210 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:47:36,210 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 05:47:36,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 05:47:36,212 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:47:36,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:47:36,212 INFO L85 PathProgramCache]: Analyzing trace with hash -306925128, now seen corresponding path program 1 times [2023-12-16 05:47:36,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:47:36,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189326028] [2023-12-16 05:47:36,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:47:36,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:47:36,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:36,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 05:47:36,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:36,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-16 05:47:36,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:36,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 05:47:36,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:47:36,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189326028] [2023-12-16 05:47:36,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189326028] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:47:36,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 05:47:36,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 05:47:36,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774312081] [2023-12-16 05:47:36,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:47:36,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 05:47:36,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:47:36,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 05:47:36,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 05:47:36,481 INFO L87 Difference]: Start difference. First operand 49 states and 66 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-16 05:47:36,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:47:36,531 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2023-12-16 05:47:36,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 05:47:36,534 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2023-12-16 05:47:36,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:47:36,536 INFO L225 Difference]: With dead ends: 55 [2023-12-16 05:47:36,536 INFO L226 Difference]: Without dead ends: 51 [2023-12-16 05:47:36,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 05:47:36,539 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 4 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 05:47:36,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 286 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 05:47:36,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-16 05:47:36,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-12-16 05:47:36,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 38 states have internal predecessors, (48), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-12-16 05:47:36,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2023-12-16 05:47:36,568 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 21 [2023-12-16 05:47:36,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:47:36,568 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2023-12-16 05:47:36,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-16 05:47:36,568 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2023-12-16 05:47:36,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-16 05:47:36,569 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:47:36,569 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 05:47:36,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 05:47:36,570 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:47:36,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:47:36,570 INFO L85 PathProgramCache]: Analyzing trace with hash -224959538, now seen corresponding path program 1 times [2023-12-16 05:47:36,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:47:36,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378820802] [2023-12-16 05:47:36,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:47:36,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:47:36,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:36,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 05:47:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:36,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-16 05:47:36,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:36,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 05:47:36,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:47:36,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378820802] [2023-12-16 05:47:36,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378820802] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:47:36,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 05:47:36,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 05:47:36,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732744268] [2023-12-16 05:47:36,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:47:36,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 05:47:36,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:47:36,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 05:47:36,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 05:47:36,686 INFO L87 Difference]: Start difference. First operand 51 states and 69 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-16 05:47:36,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:47:36,750 INFO L93 Difference]: Finished difference Result 57 states and 76 transitions. [2023-12-16 05:47:36,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 05:47:36,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2023-12-16 05:47:36,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:47:36,751 INFO L225 Difference]: With dead ends: 57 [2023-12-16 05:47:36,751 INFO L226 Difference]: Without dead ends: 53 [2023-12-16 05:47:36,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 05:47:36,752 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 9 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 05:47:36,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 195 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 05:47:36,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-12-16 05:47:36,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2023-12-16 05:47:36,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 38 states have internal predecessors, (48), 9 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-12-16 05:47:36,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2023-12-16 05:47:36,781 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 22 [2023-12-16 05:47:36,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:47:36,782 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2023-12-16 05:47:36,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-16 05:47:36,783 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2023-12-16 05:47:36,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-16 05:47:36,784 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:47:36,784 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 05:47:36,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 05:47:36,785 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:47:36,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:47:36,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1677803704, now seen corresponding path program 1 times [2023-12-16 05:47:36,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:47:36,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46180408] [2023-12-16 05:47:36,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:47:36,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:47:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:36,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 05:47:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:36,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-16 05:47:36,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:36,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-16 05:47:36,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:36,926 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 05:47:36,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:47:36,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46180408] [2023-12-16 05:47:36,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46180408] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 05:47:36,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518813346] [2023-12-16 05:47:36,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:47:36,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 05:47:36,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 05:47:36,930 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 05:47:36,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-16 05:47:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:37,023 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 05:47:37,028 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 05:47:37,135 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-16 05:47:37,135 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 05:47:37,347 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 05:47:37,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518813346] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 05:47:37,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 05:47:37,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 12 [2023-12-16 05:47:37,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844578850] [2023-12-16 05:47:37,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 05:47:37,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 05:47:37,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:47:37,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 05:47:37,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-12-16 05:47:37,362 INFO L87 Difference]: Start difference. First operand 51 states and 69 transitions. Second operand has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-16 05:47:37,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:47:37,516 INFO L93 Difference]: Finished difference Result 66 states and 88 transitions. [2023-12-16 05:47:37,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 05:47:37,517 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 29 [2023-12-16 05:47:37,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:47:37,519 INFO L225 Difference]: With dead ends: 66 [2023-12-16 05:47:37,519 INFO L226 Difference]: Without dead ends: 49 [2023-12-16 05:47:37,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2023-12-16 05:47:37,520 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 27 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 05:47:37,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 347 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 05:47:37,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-16 05:47:37,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-12-16 05:47:37,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 37 states have internal predecessors, (45), 8 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2023-12-16 05:47:37,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2023-12-16 05:47:37,533 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 29 [2023-12-16 05:47:37,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:47:37,534 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2023-12-16 05:47:37,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-16 05:47:37,536 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2023-12-16 05:47:37,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-16 05:47:37,539 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:47:37,539 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 05:47:37,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-16 05:47:37,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 05:47:37,744 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:47:37,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:47:37,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1617599152, now seen corresponding path program 1 times [2023-12-16 05:47:37,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:47:37,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555437728] [2023-12-16 05:47:37,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:47:37,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:47:37,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:37,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 05:47:37,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:37,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-16 05:47:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:38,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-16 05:47:38,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:38,058 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 05:47:38,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:47:38,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555437728] [2023-12-16 05:47:38,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555437728] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 05:47:38,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925580460] [2023-12-16 05:47:38,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:47:38,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 05:47:38,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 05:47:38,077 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 05:47:38,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-16 05:47:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:38,206 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-16 05:47:38,208 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 05:47:38,365 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 05:47:38,365 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 05:47:38,656 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 05:47:38,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925580460] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 05:47:38,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 05:47:38,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2023-12-16 05:47:38,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302404530] [2023-12-16 05:47:38,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 05:47:38,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-16 05:47:38,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:47:38,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-16 05:47:38,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2023-12-16 05:47:38,659 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand has 22 states, 20 states have (on average 2.2) internal successors, (44), 16 states have internal predecessors, (44), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2023-12-16 05:47:38,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:47:38,969 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2023-12-16 05:47:38,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-16 05:47:38,969 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.2) internal successors, (44), 16 states have internal predecessors, (44), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) Word has length 30 [2023-12-16 05:47:38,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:47:38,972 INFO L225 Difference]: With dead ends: 68 [2023-12-16 05:47:38,972 INFO L226 Difference]: Without dead ends: 52 [2023-12-16 05:47:38,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=805, Unknown=0, NotChecked=0, Total=930 [2023-12-16 05:47:38,975 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 41 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 05:47:38,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 569 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 05:47:38,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-12-16 05:47:38,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2023-12-16 05:47:38,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.2) internal successors, (42), 37 states have internal predecessors, (42), 8 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2023-12-16 05:47:38,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2023-12-16 05:47:38,988 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 30 [2023-12-16 05:47:38,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:47:38,988 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2023-12-16 05:47:38,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.2) internal successors, (44), 16 states have internal predecessors, (44), 6 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2023-12-16 05:47:38,988 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2023-12-16 05:47:38,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-16 05:47:38,989 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:47:38,989 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 05:47:38,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-16 05:47:39,194 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,SelfDestructingSolverStorable5 [2023-12-16 05:47:39,194 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:47:39,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:47:39,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1287840268, now seen corresponding path program 1 times [2023-12-16 05:47:39,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:47:39,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927894479] [2023-12-16 05:47:39,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:47:39,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:47:39,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:39,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 05:47:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:39,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 05:47:39,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:39,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-16 05:47:39,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:39,353 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-16 05:47:39,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:47:39,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927894479] [2023-12-16 05:47:39,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927894479] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:47:39,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 05:47:39,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 05:47:39,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809998059] [2023-12-16 05:47:39,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:47:39,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 05:47:39,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:47:39,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 05:47:39,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 05:47:39,355 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 05:47:39,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:47:39,412 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2023-12-16 05:47:39,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 05:47:39,413 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2023-12-16 05:47:39,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:47:39,414 INFO L225 Difference]: With dead ends: 70 [2023-12-16 05:47:39,414 INFO L226 Difference]: Without dead ends: 51 [2023-12-16 05:47:39,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 05:47:39,415 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 9 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 05:47:39,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 242 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 05:47:39,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-16 05:47:39,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2023-12-16 05:47:39,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.2) internal successors, (42), 37 states have internal predecessors, (42), 8 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2023-12-16 05:47:39,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2023-12-16 05:47:39,422 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 32 [2023-12-16 05:47:39,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:47:39,422 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2023-12-16 05:47:39,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 05:47:39,422 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2023-12-16 05:47:39,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-16 05:47:39,423 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:47:39,423 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 05:47:39,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 05:47:39,423 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:47:39,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:47:39,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1285376925, now seen corresponding path program 1 times [2023-12-16 05:47:39,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:47:39,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043050177] [2023-12-16 05:47:39,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:47:39,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:47:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:39,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 05:47:39,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:39,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-16 05:47:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:39,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 05:47:39,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:39,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 05:47:39,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:39,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-16 05:47:39,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:39,544 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-16 05:47:39,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:47:39,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043050177] [2023-12-16 05:47:39,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043050177] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:47:39,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 05:47:39,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 05:47:39,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79853515] [2023-12-16 05:47:39,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:47:39,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 05:47:39,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:47:39,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 05:47:39,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 05:47:39,553 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-16 05:47:39,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:47:39,630 INFO L93 Difference]: Finished difference Result 101 states and 128 transitions. [2023-12-16 05:47:39,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 05:47:39,630 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 50 [2023-12-16 05:47:39,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:47:39,631 INFO L225 Difference]: With dead ends: 101 [2023-12-16 05:47:39,631 INFO L226 Difference]: Without dead ends: 49 [2023-12-16 05:47:39,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 05:47:39,632 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 21 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 05:47:39,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 160 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 05:47:39,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-16 05:47:39,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2023-12-16 05:47:39,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 36 states have internal predecessors, (39), 7 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2023-12-16 05:47:39,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2023-12-16 05:47:39,635 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 50 [2023-12-16 05:47:39,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:47:39,635 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2023-12-16 05:47:39,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-16 05:47:39,635 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2023-12-16 05:47:39,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-16 05:47:39,636 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:47:39,636 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 05:47:39,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 05:47:39,636 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:47:39,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:47:39,636 INFO L85 PathProgramCache]: Analyzing trace with hash -68737779, now seen corresponding path program 1 times [2023-12-16 05:47:39,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:47:39,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690130917] [2023-12-16 05:47:39,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:47:39,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:47:39,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:39,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 05:47:39,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:39,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-16 05:47:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:39,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-16 05:47:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:39,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-12-16 05:47:39,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:39,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-16 05:47:39,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:39,805 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-16 05:47:39,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:47:39,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690130917] [2023-12-16 05:47:39,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690130917] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 05:47:39,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554432500] [2023-12-16 05:47:39,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:47:39,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 05:47:39,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 05:47:39,806 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 05:47:39,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-16 05:47:39,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:39,921 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 05:47:39,923 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 05:47:39,942 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-16 05:47:39,942 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 05:47:39,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554432500] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:47:39,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 05:47:39,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-12-16 05:47:39,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312366860] [2023-12-16 05:47:39,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:47:39,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 05:47:39,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:47:39,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 05:47:39,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-16 05:47:39,943 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-16 05:47:39,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:47:39,985 INFO L93 Difference]: Finished difference Result 93 states and 113 transitions. [2023-12-16 05:47:39,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 05:47:39,985 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) Word has length 51 [2023-12-16 05:47:39,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:47:39,985 INFO L225 Difference]: With dead ends: 93 [2023-12-16 05:47:39,986 INFO L226 Difference]: Without dead ends: 49 [2023-12-16 05:47:39,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-16 05:47:39,989 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 14 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 05:47:39,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 140 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 05:47:39,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-16 05:47:39,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-12-16 05:47:39,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 38 states have internal predecessors, (40), 7 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2023-12-16 05:47:39,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2023-12-16 05:47:39,994 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 51 [2023-12-16 05:47:39,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:47:39,995 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2023-12-16 05:47:39,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-16 05:47:39,995 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2023-12-16 05:47:39,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-16 05:47:39,996 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:47:39,996 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 05:47:40,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-16 05:47:40,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 05:47:40,201 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:47:40,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:47:40,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1340831987, now seen corresponding path program 1 times [2023-12-16 05:47:40,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:47:40,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621750429] [2023-12-16 05:47:40,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:47:40,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:47:40,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:40,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 05:47:40,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:40,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-16 05:47:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:40,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-16 05:47:40,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:40,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 05:47:40,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:40,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 05:47:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:40,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-16 05:47:40,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:40,489 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-16 05:47:40,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:47:40,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621750429] [2023-12-16 05:47:40,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621750429] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 05:47:40,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456328094] [2023-12-16 05:47:40,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:47:40,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 05:47:40,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 05:47:40,490 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 05:47:40,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:40,578 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-16 05:47:40,582 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 05:47:40,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-16 05:47:40,694 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-16 05:47:40,695 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 05:47:41,074 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-16 05:47:41,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456328094] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 05:47:41,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 05:47:41,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 18 [2023-12-16 05:47:41,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044727661] [2023-12-16 05:47:41,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 05:47:41,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-16 05:47:41,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:47:41,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-16 05:47:41,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2023-12-16 05:47:41,088 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 10 states have call successors, (13), 2 states have call predecessors, (13), 6 states have return successors, (14), 5 states have call predecessors, (14), 10 states have call successors, (14) [2023-12-16 05:47:41,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:47:41,371 INFO L93 Difference]: Finished difference Result 87 states and 109 transitions. [2023-12-16 05:47:41,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 05:47:41,372 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 10 states have call successors, (13), 2 states have call predecessors, (13), 6 states have return successors, (14), 5 states have call predecessors, (14), 10 states have call successors, (14) Word has length 60 [2023-12-16 05:47:41,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:47:41,374 INFO L225 Difference]: With dead ends: 87 [2023-12-16 05:47:41,374 INFO L226 Difference]: Without dead ends: 57 [2023-12-16 05:47:41,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 122 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2023-12-16 05:47:41,375 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 58 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 05:47:41,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 244 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 05:47:41,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-12-16 05:47:41,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2023-12-16 05:47:41,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 37 states have (on average 1.135135135135135) internal successors, (42), 40 states have internal predecessors, (42), 7 states have call successors, (7), 3 states have call predecessors, (7), 7 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2023-12-16 05:47:41,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2023-12-16 05:47:41,381 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 60 [2023-12-16 05:47:41,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:47:41,382 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2023-12-16 05:47:41,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 10 states have call successors, (13), 2 states have call predecessors, (13), 6 states have return successors, (14), 5 states have call predecessors, (14), 10 states have call successors, (14) [2023-12-16 05:47:41,382 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2023-12-16 05:47:41,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-12-16 05:47:41,383 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:47:41,383 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 05:47:41,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-16 05:47:41,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 05:47:41,588 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:47:41,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:47:41,588 INFO L85 PathProgramCache]: Analyzing trace with hash -2129490437, now seen corresponding path program 2 times [2023-12-16 05:47:41,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:47:41,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219305619] [2023-12-16 05:47:41,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:47:41,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:47:41,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:41,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 05:47:41,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:41,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-16 05:47:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:42,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-16 05:47:42,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:42,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-16 05:47:42,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:42,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-12-16 05:47:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:42,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 05:47:42,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:42,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-16 05:47:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:42,389 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-16 05:47:42,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:47:42,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219305619] [2023-12-16 05:47:42,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219305619] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 05:47:42,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242056899] [2023-12-16 05:47:42,389 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 05:47:42,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 05:47:42,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 05:47:42,390 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 05:47:42,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-16 05:47:42,508 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 05:47:42,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 05:47:42,509 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-16 05:47:42,515 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 05:47:42,756 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-16 05:47:42,756 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 05:47:43,676 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-16 05:47:43,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242056899] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 05:47:43,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 05:47:43,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 23 [2023-12-16 05:47:43,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413334888] [2023-12-16 05:47:43,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 05:47:43,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-16 05:47:43,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:47:43,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-16 05:47:43,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2023-12-16 05:47:43,679 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 23 states, 20 states have (on average 4.7) internal successors, (94), 23 states have internal predecessors, (94), 12 states have call successors, (15), 2 states have call predecessors, (15), 8 states have return successors, (19), 8 states have call predecessors, (19), 12 states have call successors, (19) [2023-12-16 05:47:43,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:47:43,964 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2023-12-16 05:47:43,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 05:47:43,965 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 4.7) internal successors, (94), 23 states have internal predecessors, (94), 12 states have call successors, (15), 2 states have call predecessors, (15), 8 states have return successors, (19), 8 states have call predecessors, (19), 12 states have call successors, (19) Word has length 69 [2023-12-16 05:47:43,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:47:43,966 INFO L225 Difference]: With dead ends: 89 [2023-12-16 05:47:43,966 INFO L226 Difference]: Without dead ends: 70 [2023-12-16 05:47:43,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 137 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=762, Unknown=0, NotChecked=0, Total=930 [2023-12-16 05:47:43,966 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 81 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 05:47:43,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 351 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 05:47:43,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-12-16 05:47:43,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2023-12-16 05:47:43,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 48 states have internal predecessors, (51), 8 states have call successors, (8), 3 states have call predecessors, (8), 10 states have return successors, (22), 12 states have call predecessors, (22), 8 states have call successors, (22) [2023-12-16 05:47:43,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 81 transitions. [2023-12-16 05:47:43,971 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 81 transitions. Word has length 69 [2023-12-16 05:47:43,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:47:43,972 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 81 transitions. [2023-12-16 05:47:43,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 4.7) internal successors, (94), 23 states have internal predecessors, (94), 12 states have call successors, (15), 2 states have call predecessors, (15), 8 states have return successors, (19), 8 states have call predecessors, (19), 12 states have call successors, (19) [2023-12-16 05:47:43,972 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 81 transitions. [2023-12-16 05:47:43,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-16 05:47:43,972 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:47:43,973 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 05:47:43,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-16 05:47:44,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-16 05:47:44,178 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:47:44,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:47:44,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1734203497, now seen corresponding path program 1 times [2023-12-16 05:47:44,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:47:44,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226485072] [2023-12-16 05:47:44,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:47:44,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:47:44,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:44,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 05:47:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:44,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-16 05:47:44,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:44,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-16 05:47:44,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:44,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-16 05:47:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:44,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-16 05:47:44,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:44,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 05:47:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:44,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-16 05:47:44,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:44,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-16 05:47:44,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:44,328 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-16 05:47:44,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:47:44,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226485072] [2023-12-16 05:47:44,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226485072] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:47:44,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 05:47:44,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 05:47:44,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351351993] [2023-12-16 05:47:44,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:47:44,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 05:47:44,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:47:44,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 05:47:44,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 05:47:44,329 INFO L87 Difference]: Start difference. First operand 64 states and 81 transitions. Second operand has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-16 05:47:44,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:47:44,357 INFO L93 Difference]: Finished difference Result 125 states and 173 transitions. [2023-12-16 05:47:44,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 05:47:44,358 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 76 [2023-12-16 05:47:44,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:47:44,359 INFO L225 Difference]: With dead ends: 125 [2023-12-16 05:47:44,359 INFO L226 Difference]: Without dead ends: 64 [2023-12-16 05:47:44,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 05:47:44,359 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 10 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 05:47:44,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 151 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 05:47:44,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-12-16 05:47:44,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2023-12-16 05:47:44,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 48 states have internal predecessors, (51), 8 states have call successors, (8), 3 states have call predecessors, (8), 10 states have return successors, (20), 12 states have call predecessors, (20), 8 states have call successors, (20) [2023-12-16 05:47:44,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2023-12-16 05:47:44,365 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 76 [2023-12-16 05:47:44,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:47:44,365 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2023-12-16 05:47:44,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2023-12-16 05:47:44,365 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2023-12-16 05:47:44,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-16 05:47:44,366 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:47:44,367 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 05:47:44,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-16 05:47:44,367 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:47:44,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:47:44,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1605702583, now seen corresponding path program 2 times [2023-12-16 05:47:44,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:47:44,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422104535] [2023-12-16 05:47:44,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:47:44,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:47:44,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:44,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 05:47:44,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:44,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-16 05:47:44,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:44,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-16 05:47:44,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:44,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-16 05:47:44,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:44,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-16 05:47:44,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:44,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-16 05:47:44,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:44,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-16 05:47:44,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:44,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-12-16 05:47:44,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:44,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-12-16 05:47:44,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:47:44,751 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 38 proven. 19 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-16 05:47:44,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:47:44,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422104535] [2023-12-16 05:47:44,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422104535] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 05:47:44,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139035638] [2023-12-16 05:47:44,751 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 05:47:44,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 05:47:44,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 05:47:44,752 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 05:47:44,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-16 05:47:44,843 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 05:47:44,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 05:47:44,844 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-16 05:47:44,849 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 05:47:45,203 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 4 proven. 60 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-16 05:47:45,203 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 05:47:47,432 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 2 proven. 62 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-16 05:47:47,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139035638] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 05:47:47,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 05:47:47,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 26 [2023-12-16 05:47:47,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596596854] [2023-12-16 05:47:47,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 05:47:47,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-16 05:47:47,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:47:47,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-16 05:47:47,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2023-12-16 05:47:47,436 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand has 26 states, 25 states have (on average 5.04) internal successors, (126), 26 states have internal predecessors, (126), 16 states have call successors, (22), 2 states have call predecessors, (22), 8 states have return successors, (23), 7 states have call predecessors, (23), 16 states have call successors, (23) [2023-12-16 05:47:47,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:47:47,649 INFO L93 Difference]: Finished difference Result 100 states and 134 transitions. [2023-12-16 05:47:47,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 05:47:47,649 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 5.04) internal successors, (126), 26 states have internal predecessors, (126), 16 states have call successors, (22), 2 states have call predecessors, (22), 8 states have return successors, (23), 7 states have call predecessors, (23), 16 states have call successors, (23) Word has length 85 [2023-12-16 05:47:47,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:47:47,650 INFO L225 Difference]: With dead ends: 100 [2023-12-16 05:47:47,650 INFO L226 Difference]: Without dead ends: 0 [2023-12-16 05:47:47,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 169 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=247, Invalid=943, Unknown=0, NotChecked=0, Total=1190 [2023-12-16 05:47:47,651 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 103 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 05:47:47,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 130 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 05:47:47,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-16 05:47:47,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-16 05:47:47,651 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-16 05:47:47,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-16 05:47:47,651 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2023-12-16 05:47:47,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:47:47,651 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-16 05:47:47,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 5.04) internal successors, (126), 26 states have internal predecessors, (126), 16 states have call successors, (22), 2 states have call predecessors, (22), 8 states have return successors, (23), 7 states have call predecessors, (23), 16 states have call successors, (23) [2023-12-16 05:47:47,652 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-16 05:47:47,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-16 05:47:47,653 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 05:47:47,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-16 05:47:47,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 05:47:47,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-16 05:47:48,014 INFO L895 garLoopResultBuilder]: At program point L33(line 33) the Hoare annotation is: (and (= |multiple_of_#in~m| multiple_of_~m) (<= |multiple_of_#in~m| 0)) [2023-12-16 05:47:48,014 INFO L899 garLoopResultBuilder]: For program point L32(lines 32 34) no Hoare annotation was computed. [2023-12-16 05:47:48,014 INFO L899 garLoopResultBuilder]: For program point L33-1(line 33) no Hoare annotation was computed. [2023-12-16 05:47:48,014 INFO L899 garLoopResultBuilder]: For program point multiple_ofFINAL(lines 31 45) no Hoare annotation was computed. [2023-12-16 05:47:48,014 INFO L895 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: (and (= |multiple_of_#in~m| multiple_of_~m) (= |multiple_of_#in~n| multiple_of_~n) (<= 1 multiple_of_~n)) [2023-12-16 05:47:48,014 INFO L899 garLoopResultBuilder]: For program point L44-1(line 44) no Hoare annotation was computed. [2023-12-16 05:47:48,014 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 31 45) the Hoare annotation is: true [2023-12-16 05:47:48,014 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 43) no Hoare annotation was computed. [2023-12-16 05:47:48,014 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 40) no Hoare annotation was computed. [2023-12-16 05:47:48,014 INFO L895 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (and (< |multiple_of_#in~n| 0) (= |multiple_of_#in~m| multiple_of_~m) (= |multiple_of_#in~n| multiple_of_~n)) [2023-12-16 05:47:48,014 INFO L899 garLoopResultBuilder]: For program point multiple_ofEXIT(lines 31 45) no Hoare annotation was computed. [2023-12-16 05:47:48,014 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 37) no Hoare annotation was computed. [2023-12-16 05:47:48,014 INFO L899 garLoopResultBuilder]: For program point L36-1(line 36) no Hoare annotation was computed. [2023-12-16 05:47:48,014 INFO L895 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (and (= |mult_#in~n| mult_~n) (= |mult_#in~m| mult_~m) (<= 2 mult_~m)) [2023-12-16 05:47:48,014 INFO L899 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2023-12-16 05:47:48,014 INFO L899 garLoopResultBuilder]: For program point L24(lines 24 26) no Hoare annotation was computed. [2023-12-16 05:47:48,014 INFO L899 garLoopResultBuilder]: For program point L21(lines 21 23) no Hoare annotation was computed. [2023-12-16 05:47:48,015 INFO L895 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (and (= |mult_#in~m| mult_~m) (<= |mult_#in~m| 0)) [2023-12-16 05:47:48,015 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2023-12-16 05:47:48,015 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-16 05:47:48,015 INFO L899 garLoopResultBuilder]: For program point multFINAL(lines 17 28) no Hoare annotation was computed. [2023-12-16 05:47:48,015 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 17 28) the Hoare annotation is: true [2023-12-16 05:47:48,015 INFO L899 garLoopResultBuilder]: For program point multEXIT(lines 17 28) no Hoare annotation was computed. [2023-12-16 05:47:48,015 INFO L899 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2023-12-16 05:47:48,015 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-16 05:47:48,015 INFO L895 garLoopResultBuilder]: At program point L97-1(line 97) the Hoare annotation is: (and (<= |ULTIMATE.start_main_~n~0#1| 2) (<= 1 |ULTIMATE.start_main_~n~0#1|)) [2023-12-16 05:47:48,015 INFO L899 garLoopResultBuilder]: For program point L97-2(line 97) no Hoare annotation was computed. [2023-12-16 05:47:48,015 INFO L899 garLoopResultBuilder]: For program point L97-4(lines 97 101) no Hoare annotation was computed. [2023-12-16 05:47:48,015 INFO L899 garLoopResultBuilder]: For program point L97-5(lines 76 102) no Hoare annotation was computed. [2023-12-16 05:47:48,015 INFO L899 garLoopResultBuilder]: For program point L91(lines 91 95) no Hoare annotation was computed. [2023-12-16 05:47:48,015 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 89) no Hoare annotation was computed. [2023-12-16 05:47:48,015 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-16 05:47:48,015 INFO L899 garLoopResultBuilder]: For program point L98(line 98) no Hoare annotation was computed. [2023-12-16 05:47:48,015 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 98) no Hoare annotation was computed. [2023-12-16 05:47:48,015 INFO L895 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (and (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_is_prime_~n#1|)) [2023-12-16 05:47:48,015 INFO L899 garLoopResultBuilder]: For program point L53-1(line 53) no Hoare annotation was computed. [2023-12-16 05:47:48,015 INFO L899 garLoopResultBuilder]: For program point L78(lines 78 82) no Hoare annotation was computed. [2023-12-16 05:47:48,015 INFO L899 garLoopResultBuilder]: For program point L65(lines 65 72) no Hoare annotation was computed. [2023-12-16 05:47:48,016 INFO L899 garLoopResultBuilder]: For program point is_prime_EXIT(lines 57 74) no Hoare annotation was computed. [2023-12-16 05:47:48,016 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 73) no Hoare annotation was computed. [2023-12-16 05:47:48,016 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 63) no Hoare annotation was computed. [2023-12-16 05:47:48,016 INFO L899 garLoopResultBuilder]: For program point is_prime_FINAL(lines 57 74) no Hoare annotation was computed. [2023-12-16 05:47:48,016 INFO L899 garLoopResultBuilder]: For program point L58(lines 58 60) no Hoare annotation was computed. [2023-12-16 05:47:48,016 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 57 74) the Hoare annotation is: true [2023-12-16 05:47:48,016 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (and (= |is_prime__#in~n| is_prime__~n) (= |is_prime__#in~m| is_prime__~m) (<= 2 is_prime__~m) (or (<= (* 2 |is_prime__#in~m|) |is_prime__#in~n|) (and (<= is_prime__~n |is_prime__#in~m|) (<= 3 is_prime__~n)))) [2023-12-16 05:47:48,016 INFO L899 garLoopResultBuilder]: For program point L71-1(line 71) no Hoare annotation was computed. [2023-12-16 05:47:48,016 INFO L895 garLoopResultBuilder]: At program point L68(line 68) the Hoare annotation is: (and (= |is_prime__#in~n| is_prime__~n) (= |is_prime__#in~m| is_prime__~m) (<= 2 is_prime__~m) (<= 3 is_prime__~n)) [2023-12-16 05:47:48,016 INFO L899 garLoopResultBuilder]: For program point L68-1(line 68) no Hoare annotation was computed. [2023-12-16 05:47:48,016 INFO L899 garLoopResultBuilder]: For program point L68-2(lines 68 70) no Hoare annotation was computed. [2023-12-16 05:47:48,018 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 05:47:48,019 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 05:47:48,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 05:47:48 BoogieIcfgContainer [2023-12-16 05:47:48,022 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 05:47:48,023 INFO L158 Benchmark]: Toolchain (without parser) took 13527.38ms. Allocated memory was 241.2MB in the beginning and 289.4MB in the end (delta: 48.2MB). Free memory was 188.3MB in the beginning and 139.1MB in the end (delta: 49.2MB). Peak memory consumption was 97.9MB. Max. memory is 8.0GB. [2023-12-16 05:47:48,024 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 162.5MB. Free memory is still 112.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 05:47:48,024 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.88ms. Allocated memory is still 241.2MB. Free memory was 187.8MB in the beginning and 176.2MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 05:47:48,024 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.10ms. Allocated memory is still 241.2MB. Free memory was 176.2MB in the beginning and 175.1MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-16 05:47:48,025 INFO L158 Benchmark]: Boogie Preprocessor took 34.58ms. Allocated memory is still 241.2MB. Free memory was 175.1MB in the beginning and 173.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 05:47:48,025 INFO L158 Benchmark]: RCFGBuilder took 525.89ms. Allocated memory is still 241.2MB. Free memory was 173.1MB in the beginning and 157.3MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-16 05:47:48,025 INFO L158 Benchmark]: TraceAbstraction took 12595.98ms. Allocated memory was 241.2MB in the beginning and 289.4MB in the end (delta: 48.2MB). Free memory was 156.8MB in the beginning and 139.1MB in the end (delta: 17.7MB). Peak memory consumption was 66.5MB. Max. memory is 8.0GB. [2023-12-16 05:47:48,026 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.15ms. Allocated memory is still 162.5MB. Free memory is still 112.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 306.88ms. Allocated memory is still 241.2MB. Free memory was 187.8MB in the beginning and 176.2MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.10ms. Allocated memory is still 241.2MB. Free memory was 176.2MB in the beginning and 175.1MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.58ms. Allocated memory is still 241.2MB. Free memory was 175.1MB in the beginning and 173.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 525.89ms. Allocated memory is still 241.2MB. Free memory was 173.1MB in the beginning and 157.3MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * TraceAbstraction took 12595.98ms. Allocated memory was 241.2MB in the beginning and 289.4MB in the end (delta: 48.2MB). Free memory was 156.8MB in the beginning and 139.1MB in the end (delta: 17.7MB). Peak memory consumption was 66.5MB. 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: 98]: 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 4 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.5s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 409 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 378 mSDsluCounter, 3238 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2622 mSDsCounter, 183 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1315 IncrementalHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 183 mSolverCounterUnsat, 616 mSDtfsCounter, 1315 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 841 GetRequests, 657 SyntacticMatches, 17 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 694 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=11, InterpolantAutomatonStates: 102, 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, 13 MinimizatonAttempts, 20 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 154 PreInvPairs, 182 NumberOfFragments, 97 HoareAnnotationTreeSize, 154 FormulaSimplifications, 453 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FormulaSimplificationsInter, 152 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 882 NumberOfCodeBlocks, 882 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1131 ConstructedInterpolants, 0 QuantifiedInterpolants, 3114 SizeOfPredicates, 32 NumberOfNonLiveVariables, 990 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 24 InterpolantComputations, 8 PerfectInterpolantSequences, 283/540 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 RESULT: Ultimate proved your program to be correct! [2023-12-16 05:47:48,052 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...