./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Primes.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/Primes.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 16beca065b3aeb336c54dcf96f3abbe61553e7d28b28c1a40f525ad89a5da56e --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:17:53,558 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:17:53,613 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:17:53,617 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:17:53,618 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:17:53,638 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:17:53,639 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:17:53,639 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:17:53,640 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:17:53,640 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:17:53,641 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:17:53,641 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:17:53,642 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:17:53,642 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:17:53,642 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:17:53,643 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:17:53,643 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:17:53,644 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:17:53,644 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:17:53,644 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:17:53,645 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:17:53,648 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:17:53,648 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:17:53,649 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:17:53,649 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:17:53,649 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:17:53,649 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:17:53,650 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:17:53,650 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:17:53,650 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:17:53,650 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:17:53,650 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:17:53,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:17:53,651 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:17:53,653 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:17:53,653 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:17:53,653 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:17:53,653 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:17:53,654 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:17:53,654 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:17:53,654 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:17:53,654 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:17:53,655 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 16beca065b3aeb336c54dcf96f3abbe61553e7d28b28c1a40f525ad89a5da56e [2024-11-08 15:17:53,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:17:53,924 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:17:53,926 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:17:53,928 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:17:53,929 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:17:53,930 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Primes.c [2024-11-08 15:17:55,321 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:17:55,490 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:17:55,491 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Primes.c [2024-11-08 15:17:55,500 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad2c91a9a/9f463dda11d94659a8529dc36e2a4347/FLAG2f41acb18 [2024-11-08 15:17:55,512 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad2c91a9a/9f463dda11d94659a8529dc36e2a4347 [2024-11-08 15:17:55,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:17:55,516 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:17:55,517 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:17:55,517 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:17:55,525 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:17:55,526 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:17:55" (1/1) ... [2024-11-08 15:17:55,527 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e739717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:17:55, skipping insertion in model container [2024-11-08 15:17:55,528 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:17:55" (1/1) ... [2024-11-08 15:17:55,550 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:17:55,743 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Primes.c[2190,2203] [2024-11-08 15:17:55,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:17:55,756 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:17:55,775 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Primes.c[2190,2203] [2024-11-08 15:17:55,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:17:55,790 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:17:55,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:17:55 WrapperNode [2024-11-08 15:17:55,791 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:17:55,792 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:17:55,792 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:17:55,793 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:17:55,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:17:55" (1/1) ... [2024-11-08 15:17:55,817 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:17:55" (1/1) ... [2024-11-08 15:17:55,838 INFO L138 Inliner]: procedures = 16, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 56 [2024-11-08 15:17:55,839 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:17:55,840 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:17:55,840 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:17:55,840 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:17:55,851 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:17:55" (1/1) ... [2024-11-08 15:17:55,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:17:55" (1/1) ... [2024-11-08 15:17:55,857 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:17:55" (1/1) ... [2024-11-08 15:17:55,904 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]. [2024-11-08 15:17:55,904 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:17:55" (1/1) ... [2024-11-08 15:17:55,905 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:17:55" (1/1) ... [2024-11-08 15:17:55,914 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:17:55" (1/1) ... [2024-11-08 15:17:55,918 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:17:55" (1/1) ... [2024-11-08 15:17:55,920 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:17:55" (1/1) ... [2024-11-08 15:17:55,921 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:17:55" (1/1) ... [2024-11-08 15:17:55,923 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:17:55,925 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:17:55,925 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:17:55,925 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:17:55,927 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:17:55" (1/1) ... [2024-11-08 15:17:55,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:17:55,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:17:55,964 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) [2024-11-08 15:17:55,968 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 [2024-11-08 15:17:56,015 INFO L130 BoogieDeclarations]: Found specification of procedure multiple_of [2024-11-08 15:17:56,016 INFO L138 BoogieDeclarations]: Found implementation of procedure multiple_of [2024-11-08 15:17:56,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:17:56,016 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2024-11-08 15:17:56,016 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2024-11-08 15:17:56,016 INFO L130 BoogieDeclarations]: Found specification of procedure is_prime_ [2024-11-08 15:17:56,016 INFO L138 BoogieDeclarations]: Found implementation of procedure is_prime_ [2024-11-08 15:17:56,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:17:56,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:17:56,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:17:56,086 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:17:56,087 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:17:56,279 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-08 15:17:56,279 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:17:56,295 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:17:56,298 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 15:17:56,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:17:56 BoogieIcfgContainer [2024-11-08 15:17:56,298 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:17:56,301 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:17:56,301 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:17:56,304 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:17:56,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:17:55" (1/3) ... [2024-11-08 15:17:56,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5633c393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:17:56, skipping insertion in model container [2024-11-08 15:17:56,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:17:55" (2/3) ... [2024-11-08 15:17:56,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5633c393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:17:56, skipping insertion in model container [2024-11-08 15:17:56,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:17:56" (3/3) ... [2024-11-08 15:17:56,307 INFO L112 eAbstractionObserver]: Analyzing ICFG Primes.c [2024-11-08 15:17:56,322 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:17:56,322 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:17:56,381 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:17:56,390 INFO L333 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, 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;@18c0fe41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:17:56,391 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:17:56,395 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 39 states have internal predecessors, (56), 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) [2024-11-08 15:17:56,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 15:17:56,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:17:56,401 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:17:56,402 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:17:56,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:17:56,406 INFO L85 PathProgramCache]: Analyzing trace with hash 691245353, now seen corresponding path program 1 times [2024-11-08 15:17:56,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:17:56,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185968313] [2024-11-08 15:17:56,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:17:56,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:17:56,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:56,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:17:56,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:56,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:17:56,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:17:56,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185968313] [2024-11-08 15:17:56,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185968313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:17:56,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:17:56,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:17:56,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859185502] [2024-11-08 15:17:56,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:17:56,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:17:56,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:17:56,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:17:56,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:17:56,713 INFO L87 Difference]: Start difference. First operand has 52 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 39 states have internal predecessors, (56), 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 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) [2024-11-08 15:17:56,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:17:56,767 INFO L93 Difference]: Finished difference Result 58 states and 80 transitions. [2024-11-08 15:17:56,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:17:56,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 15 [2024-11-08 15:17:56,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:17:56,779 INFO L225 Difference]: With dead ends: 58 [2024-11-08 15:17:56,779 INFO L226 Difference]: Without dead ends: 49 [2024-11-08 15:17:56,783 INFO L431 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 [2024-11-08 15:17:56,787 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:17:56,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:17:56,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-08 15:17:56,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-08 15:17:56,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 36 states have internal predecessors, (48), 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) [2024-11-08 15:17:56,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 66 transitions. [2024-11-08 15:17:56,824 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 66 transitions. Word has length 15 [2024-11-08 15:17:56,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:17:56,825 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 66 transitions. [2024-11-08 15:17:56,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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) [2024-11-08 15:17:56,826 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 66 transitions. [2024-11-08 15:17:56,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 15:17:56,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:17:56,828 INFO L215 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] [2024-11-08 15:17:56,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:17:56,828 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:17:56,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:17:56,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1873142352, now seen corresponding path program 1 times [2024-11-08 15:17:56,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:17:56,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578964932] [2024-11-08 15:17:56,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:17:56,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:17:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:57,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:17:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:57,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-08 15:17:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:57,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:17:57,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:17:57,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578964932] [2024-11-08 15:17:57,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578964932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:17:57,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:17:57,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:17:57,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922930044] [2024-11-08 15:17:57,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:17:57,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:17:57,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:17:57,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:17:57,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:17:57,126 INFO L87 Difference]: Start difference. First operand 49 states and 66 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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) [2024-11-08 15:17:57,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:17:57,217 INFO L93 Difference]: Finished difference Result 71 states and 93 transitions. [2024-11-08 15:17:57,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:17:57,219 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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 22 [2024-11-08 15:17:57,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:17:57,222 INFO L225 Difference]: With dead ends: 71 [2024-11-08 15:17:57,222 INFO L226 Difference]: Without dead ends: 51 [2024-11-08 15:17:57,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:17:57,226 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:17:57,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 366 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:17:57,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-08 15:17:57,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-08 15:17:57,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 38 states have internal predecessors, (49), 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) [2024-11-08 15:17:57,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 68 transitions. [2024-11-08 15:17:57,238 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 68 transitions. Word has length 22 [2024-11-08 15:17:57,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:17:57,239 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 68 transitions. [2024-11-08 15:17:57,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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) [2024-11-08 15:17:57,239 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2024-11-08 15:17:57,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 15:17:57,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:17:57,241 INFO L215 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, 1] [2024-11-08 15:17:57,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 15:17:57,242 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:17:57,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:17:57,244 INFO L85 PathProgramCache]: Analyzing trace with hash 2039437329, now seen corresponding path program 1 times [2024-11-08 15:17:57,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:17:57,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471910482] [2024-11-08 15:17:57,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:17:57,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:17:57,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:57,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:17:57,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:57,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:17:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:57,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:17:57,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:17:57,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471910482] [2024-11-08 15:17:57,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471910482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:17:57,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:17:57,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:17:57,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904618548] [2024-11-08 15:17:57,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:17:57,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:17:57,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:17:57,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:17:57,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:17:57,448 INFO L87 Difference]: Start difference. First operand 51 states and 68 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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) [2024-11-08 15:17:57,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:17:57,489 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2024-11-08 15:17:57,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 15:17:57,490 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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 23 [2024-11-08 15:17:57,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:17:57,492 INFO L225 Difference]: With dead ends: 57 [2024-11-08 15:17:57,492 INFO L226 Difference]: Without dead ends: 53 [2024-11-08 15:17:57,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:17:57,493 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:17:57,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 248 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:17:57,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-08 15:17:57,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-08 15:17:57,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 40 states have internal predecessors, (50), 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) [2024-11-08 15:17:57,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2024-11-08 15:17:57,503 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 71 transitions. Word has length 23 [2024-11-08 15:17:57,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:17:57,503 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 71 transitions. [2024-11-08 15:17:57,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 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) [2024-11-08 15:17:57,504 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 71 transitions. [2024-11-08 15:17:57,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 15:17:57,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:17:57,506 INFO L215 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, 1, 1] [2024-11-08 15:17:57,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 15:17:57,506 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:17:57,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:17:57,507 INFO L85 PathProgramCache]: Analyzing trace with hash -502167403, now seen corresponding path program 1 times [2024-11-08 15:17:57,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:17:57,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807559620] [2024-11-08 15:17:57,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:17:57,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:17:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:57,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:17:57,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:57,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:17:57,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:57,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:17:57,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:17:57,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807559620] [2024-11-08 15:17:57,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807559620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:17:57,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:17:57,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:17:57,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404258011] [2024-11-08 15:17:57,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:17:57,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:17:57,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:17:57,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:17:57,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:17:57,623 INFO L87 Difference]: Start difference. First operand 53 states and 71 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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) [2024-11-08 15:17:57,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:17:57,737 INFO L93 Difference]: Finished difference Result 61 states and 82 transitions. [2024-11-08 15:17:57,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 15:17:57,739 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 24 [2024-11-08 15:17:57,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:17:57,741 INFO L225 Difference]: With dead ends: 61 [2024-11-08 15:17:57,742 INFO L226 Difference]: Without dead ends: 57 [2024-11-08 15:17:57,743 INFO L431 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 [2024-11-08 15:17:57,743 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 6 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:17:57,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 215 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:17:57,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-08 15:17:57,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2024-11-08 15:17:57,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 40 states have internal predecessors, (50), 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) [2024-11-08 15:17:57,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2024-11-08 15:17:57,758 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 71 transitions. Word has length 24 [2024-11-08 15:17:57,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:17:57,758 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 71 transitions. [2024-11-08 15:17:57,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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) [2024-11-08 15:17:57,759 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 71 transitions. [2024-11-08 15:17:57,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 15:17:57,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:17:57,761 INFO L215 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, 1, 1] [2024-11-08 15:17:57,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 15:17:57,761 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:17:57,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:17:57,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1717699423, now seen corresponding path program 1 times [2024-11-08 15:17:57,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:17:57,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193820574] [2024-11-08 15:17:57,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:17:57,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:17:57,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:57,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:17:57,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:57,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:17:57,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:57,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 15:17:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:57,908 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 15:17:57,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:17:57,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193820574] [2024-11-08 15:17:57,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193820574] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:17:57,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808637924] [2024-11-08 15:17:57,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:17:57,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:17:57,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:17:57,913 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) [2024-11-08 15:17:57,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 15:17:57,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:57,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 15:17:57,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:17:58,096 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 15:17:58,096 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:17:58,328 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 15:17:58,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808637924] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:17:58,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:17:58,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 12 [2024-11-08 15:17:58,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587116894] [2024-11-08 15:17:58,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:17:58,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 15:17:58,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:17:58,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 15:17:58,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-08 15:17:58,332 INFO L87 Difference]: Start difference. First operand 53 states and 71 transitions. Second operand has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 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) [2024-11-08 15:17:58,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:17:58,461 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2024-11-08 15:17:58,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 15:17:58,462 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 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 31 [2024-11-08 15:17:58,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:17:58,463 INFO L225 Difference]: With dead ends: 70 [2024-11-08 15:17:58,463 INFO L226 Difference]: Without dead ends: 51 [2024-11-08 15:17:58,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2024-11-08 15:17:58,465 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 22 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:17:58,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 276 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:17:58,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-08 15:17:58,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-08 15:17:58,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 39 states have internal predecessors, (47), 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) [2024-11-08 15:17:58,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2024-11-08 15:17:58,473 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 65 transitions. Word has length 31 [2024-11-08 15:17:58,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:17:58,473 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 65 transitions. [2024-11-08 15:17:58,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 12 states have internal predecessors, (41), 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) [2024-11-08 15:17:58,473 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2024-11-08 15:17:58,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 15:17:58,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:17:58,475 INFO L215 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] [2024-11-08 15:17:58,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 15:17:58,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:17:58,676 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:17:58,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:17:58,677 INFO L85 PathProgramCache]: Analyzing trace with hash 380831863, now seen corresponding path program 1 times [2024-11-08 15:17:58,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:17:58,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120817365] [2024-11-08 15:17:58,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:17:58,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:17:58,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:58,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:17:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:58,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:17:58,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:58,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 15:17:58,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:58,961 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 15:17:58,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:17:58,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120817365] [2024-11-08 15:17:58,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120817365] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:17:58,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684036283] [2024-11-08 15:17:58,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:17:58,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:17:58,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:17:58,965 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) [2024-11-08 15:17:58,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 15:17:59,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:17:59,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-08 15:17:59,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:17:59,204 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 15:17:59,205 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:17:59,542 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 15:17:59,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684036283] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:17:59,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:17:59,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2024-11-08 15:17:59,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699697034] [2024-11-08 15:17:59,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:17:59,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-08 15:17:59,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:17:59,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-08 15:17:59,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2024-11-08 15:17:59,548 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. Second operand has 23 states, 20 states have (on average 2.35) internal successors, (47), 17 states have internal predecessors, (47), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-08 15:17:59,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:17:59,866 INFO L93 Difference]: Finished difference Result 72 states and 90 transitions. [2024-11-08 15:17:59,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 15:17:59,867 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 2.35) internal successors, (47), 17 states have internal predecessors, (47), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 32 [2024-11-08 15:17:59,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:17:59,868 INFO L225 Difference]: With dead ends: 72 [2024-11-08 15:17:59,868 INFO L226 Difference]: Without dead ends: 54 [2024-11-08 15:17:59,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2024-11-08 15:17:59,870 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 19 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:17:59,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 645 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:17:59,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-08 15:17:59,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2024-11-08 15:17:59,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 39 states have internal predecessors, (44), 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) [2024-11-08 15:17:59,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2024-11-08 15:17:59,881 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 32 [2024-11-08 15:17:59,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:17:59,883 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2024-11-08 15:17:59,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 2.35) internal successors, (47), 17 states have internal predecessors, (47), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-08 15:17:59,883 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2024-11-08 15:17:59,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 15:17:59,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:17:59,888 INFO L215 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, 1, 1] [2024-11-08 15:17:59,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 15:18:00,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-08 15:18:00,093 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:18:00,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:18:00,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1826216781, now seen corresponding path program 1 times [2024-11-08 15:18:00,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:18:00,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653506445] [2024-11-08 15:18:00,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:18:00,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:18:00,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:00,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:18:00,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:00,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 15:18:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:00,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 15:18:00,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:00,300 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-08 15:18:00,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:18:00,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653506445] [2024-11-08 15:18:00,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653506445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:18:00,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:18:00,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 15:18:00,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350991746] [2024-11-08 15:18:00,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:18:00,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 15:18:00,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:18:00,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 15:18:00,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:18:00,303 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 15:18:00,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:18:00,360 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2024-11-08 15:18:00,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:18:00,361 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 34 [2024-11-08 15:18:00,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:18:00,362 INFO L225 Difference]: With dead ends: 73 [2024-11-08 15:18:00,364 INFO L226 Difference]: Without dead ends: 53 [2024-11-08 15:18:00,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:18:00,365 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 15 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:18:00,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 231 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:18:00,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-08 15:18:00,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2024-11-08 15:18:00,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 39 states have internal predecessors, (44), 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) [2024-11-08 15:18:00,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2024-11-08 15:18:00,377 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 34 [2024-11-08 15:18:00,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:18:00,380 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2024-11-08 15:18:00,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 15:18:00,380 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2024-11-08 15:18:00,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-08 15:18:00,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:18:00,382 INFO L215 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, 1] [2024-11-08 15:18:00,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 15:18:00,382 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:18:00,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:18:00,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1825803044, now seen corresponding path program 1 times [2024-11-08 15:18:00,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:18:00,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258267152] [2024-11-08 15:18:00,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:18:00,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:18:00,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:00,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:18:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:00,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 15:18:00,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:00,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:18:00,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:00,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 15:18:00,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:00,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 15:18:00,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:00,494 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 15:18:00,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:18:00,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258267152] [2024-11-08 15:18:00,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258267152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:18:00,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:18:00,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:18:00,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40859552] [2024-11-08 15:18:00,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:18:00,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:18:00,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:18:00,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:18:00,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:18:00,497 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 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) [2024-11-08 15:18:00,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:18:00,562 INFO L93 Difference]: Finished difference Result 106 states and 136 transitions. [2024-11-08 15:18:00,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 15:18:00,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 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 52 [2024-11-08 15:18:00,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:18:00,566 INFO L225 Difference]: With dead ends: 106 [2024-11-08 15:18:00,566 INFO L226 Difference]: Without dead ends: 51 [2024-11-08 15:18:00,567 INFO L431 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 [2024-11-08 15:18:00,567 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 19 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:18:00,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 181 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:18:00,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-08 15:18:00,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2024-11-08 15:18:00,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 38 states have internal predecessors, (41), 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) [2024-11-08 15:18:00,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2024-11-08 15:18:00,579 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 52 [2024-11-08 15:18:00,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:18:00,579 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2024-11-08 15:18:00,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 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) [2024-11-08 15:18:00,579 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2024-11-08 15:18:00,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-08 15:18:00,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:18:00,580 INFO L215 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, 1, 1] [2024-11-08 15:18:00,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 15:18:00,581 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:18:00,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:18:00,581 INFO L85 PathProgramCache]: Analyzing trace with hash 654757234, now seen corresponding path program 1 times [2024-11-08 15:18:00,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:18:00,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545256024] [2024-11-08 15:18:00,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:18:00,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:18:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:00,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:18:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:00,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 15:18:00,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:00,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 15:18:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:00,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 15:18:00,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:00,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 15:18:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:00,728 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 15:18:00,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:18:00,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545256024] [2024-11-08 15:18:00,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545256024] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:18:00,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144277157] [2024-11-08 15:18:00,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:18:00,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:18:00,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:18:00,733 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) [2024-11-08 15:18:00,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 15:18:00,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:00,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 15:18:00,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:18:00,822 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 15:18:00,823 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 15:18:00,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144277157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:18:00,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 15:18:00,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2024-11-08 15:18:00,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160017809] [2024-11-08 15:18:00,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:18:00,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:18:00,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:18:00,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:18:00,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:18:00,826 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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) [2024-11-08 15:18:00,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:18:00,874 INFO L93 Difference]: Finished difference Result 98 states and 120 transitions. [2024-11-08 15:18:00,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 15:18:00,875 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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 53 [2024-11-08 15:18:00,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:18:00,875 INFO L225 Difference]: With dead ends: 98 [2024-11-08 15:18:00,876 INFO L226 Difference]: Without dead ends: 53 [2024-11-08 15:18:00,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:18:00,877 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 12 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:18:00,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 161 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:18:00,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-08 15:18:00,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2024-11-08 15:18:00,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 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), 6 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-08 15:18:00,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2024-11-08 15:18:00,887 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 53 [2024-11-08 15:18:00,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:18:00,887 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2024-11-08 15:18:00,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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) [2024-11-08 15:18:00,887 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2024-11-08 15:18:00,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-08 15:18:00,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:18:00,888 INFO L215 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, 1, 1] [2024-11-08 15:18:00,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 15:18:01,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:18:01,093 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:18:01,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:18:01,093 INFO L85 PathProgramCache]: Analyzing trace with hash 689204116, now seen corresponding path program 1 times [2024-11-08 15:18:01,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:18:01,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353145276] [2024-11-08 15:18:01,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:18:01,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:18:01,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:01,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:18:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:01,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 15:18:01,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:01,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 15:18:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:01,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 15:18:01,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:01,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 15:18:01,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:01,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 15:18:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:01,376 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 15:18:01,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:18:01,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353145276] [2024-11-08 15:18:01,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353145276] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:18:01,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995237360] [2024-11-08 15:18:01,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:18:01,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:18:01,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:18:01,379 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) [2024-11-08 15:18:01,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 15:18:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:01,443 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 15:18:01,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:18:01,567 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 15:18:01,568 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:18:01,937 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-08 15:18:01,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995237360] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:18:01,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:18:01,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 18 [2024-11-08 15:18:01,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092963198] [2024-11-08 15:18:01,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:18:01,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 15:18:01,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:18:01,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 15:18:01,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-11-08 15:18:01,940 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 states have internal predecessors, (92), 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) [2024-11-08 15:18:02,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:18:02,195 INFO L93 Difference]: Finished difference Result 92 states and 115 transitions. [2024-11-08 15:18:02,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 15:18:02,196 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 states have internal predecessors, (92), 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 62 [2024-11-08 15:18:02,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:18:02,197 INFO L225 Difference]: With dead ends: 92 [2024-11-08 15:18:02,197 INFO L226 Difference]: Without dead ends: 61 [2024-11-08 15:18:02,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 126 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2024-11-08 15:18:02,198 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 48 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:18:02,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 381 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:18:02,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-08 15:18:02,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2024-11-08 15:18:02,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 42 states have internal predecessors, (44), 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) [2024-11-08 15:18:02,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2024-11-08 15:18:02,213 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 62 [2024-11-08 15:18:02,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:18:02,213 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2024-11-08 15:18:02,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 states have internal predecessors, (92), 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) [2024-11-08 15:18:02,214 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2024-11-08 15:18:02,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-08 15:18:02,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:18:02,214 INFO L215 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, 1, 1] [2024-11-08 15:18:02,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-08 15:18:02,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:18:02,421 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:18:02,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:18:02,421 INFO L85 PathProgramCache]: Analyzing trace with hash -729550012, now seen corresponding path program 2 times [2024-11-08 15:18:02,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:18:02,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955022650] [2024-11-08 15:18:02,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:18:02,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:18:02,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:02,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:18:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:02,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 15:18:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:02,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 15:18:02,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:02,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 15:18:02,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:02,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 15:18:02,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:02,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 15:18:02,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:02,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 15:18:02,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:02,869 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 15:18:02,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:18:02,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955022650] [2024-11-08 15:18:02,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955022650] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:18:02,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304282273] [2024-11-08 15:18:02,870 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 15:18:02,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:18:02,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:18:02,872 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) [2024-11-08 15:18:02,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 15:18:02,940 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 15:18:02,940 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:18:02,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-08 15:18:02,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:18:03,112 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 15:18:03,113 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:18:03,853 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-08 15:18:03,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304282273] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:18:03,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:18:03,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 11] total 24 [2024-11-08 15:18:03,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421544336] [2024-11-08 15:18:03,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:18:03,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-08 15:18:03,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:18:03,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-08 15:18:03,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2024-11-08 15:18:03,855 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 24 states, 20 states have (on average 4.85) internal successors, (97), 24 states have internal predecessors, (97), 13 states have call successors, (16), 2 states have call predecessors, (16), 8 states have return successors, (19), 8 states have call predecessors, (19), 13 states have call successors, (19) [2024-11-08 15:18:04,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:18:04,229 INFO L93 Difference]: Finished difference Result 92 states and 114 transitions. [2024-11-08 15:18:04,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 15:18:04,230 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 4.85) internal successors, (97), 24 states have internal predecessors, (97), 13 states have call successors, (16), 2 states have call predecessors, (16), 8 states have return successors, (19), 8 states have call predecessors, (19), 13 states have call successors, (19) Word has length 71 [2024-11-08 15:18:04,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:18:04,231 INFO L225 Difference]: With dead ends: 92 [2024-11-08 15:18:04,231 INFO L226 Difference]: Without dead ends: 72 [2024-11-08 15:18:04,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 141 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=826, Unknown=0, NotChecked=0, Total=992 [2024-11-08 15:18:04,232 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 61 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:18:04,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 440 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:18:04,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-08 15:18:04,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2024-11-08 15:18:04,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 47 states have (on average 1.127659574468085) internal successors, (53), 50 states have internal predecessors, (53), 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) [2024-11-08 15:18:04,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 83 transitions. [2024-11-08 15:18:04,241 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 83 transitions. Word has length 71 [2024-11-08 15:18:04,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:18:04,242 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 83 transitions. [2024-11-08 15:18:04,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 4.85) internal successors, (97), 24 states have internal predecessors, (97), 13 states have call successors, (16), 2 states have call predecessors, (16), 8 states have return successors, (19), 8 states have call predecessors, (19), 13 states have call successors, (19) [2024-11-08 15:18:04,242 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 83 transitions. [2024-11-08 15:18:04,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-08 15:18:04,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:18:04,244 INFO L215 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, 1, 1] [2024-11-08 15:18:04,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-08 15:18:04,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-08 15:18:04,448 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:18:04,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:18:04,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1100264158, now seen corresponding path program 1 times [2024-11-08 15:18:04,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:18:04,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835240787] [2024-11-08 15:18:04,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:18:04,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:18:04,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:04,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:18:04,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:04,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 15:18:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:04,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 15:18:04,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:04,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 15:18:04,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:04,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:18:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:04,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 15:18:04,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:04,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 15:18:04,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:04,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 15:18:04,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:04,557 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-08 15:18:04,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:18:04,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835240787] [2024-11-08 15:18:04,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835240787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:18:04,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:18:04,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:18:04,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021493953] [2024-11-08 15:18:04,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:18:04,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:18:04,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:18:04,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:18:04,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:18:04,560 INFO L87 Difference]: Start difference. First operand 66 states and 83 transitions. Second operand has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 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) [2024-11-08 15:18:04,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:18:04,599 INFO L93 Difference]: Finished difference Result 128 states and 176 transitions. [2024-11-08 15:18:04,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:18:04,599 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 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 78 [2024-11-08 15:18:04,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:18:04,601 INFO L225 Difference]: With dead ends: 128 [2024-11-08 15:18:04,601 INFO L226 Difference]: Without dead ends: 66 [2024-11-08 15:18:04,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:18:04,602 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 8 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:18:04,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 170 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:18:04,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-08 15:18:04,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-08 15:18:04,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 47 states have (on average 1.127659574468085) internal successors, (53), 50 states have internal predecessors, (53), 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) [2024-11-08 15:18:04,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2024-11-08 15:18:04,610 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 81 transitions. Word has length 78 [2024-11-08 15:18:04,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:18:04,611 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 81 transitions. [2024-11-08 15:18:04,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 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) [2024-11-08 15:18:04,611 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2024-11-08 15:18:04,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-08 15:18:04,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:18:04,612 INFO L215 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, 1, 1] [2024-11-08 15:18:04,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 15:18:04,613 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:18:04,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:18:04,613 INFO L85 PathProgramCache]: Analyzing trace with hash -862294776, now seen corresponding path program 2 times [2024-11-08 15:18:04,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:18:04,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424825134] [2024-11-08 15:18:04,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:18:04,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:18:04,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:04,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:18:04,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:04,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 15:18:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:04,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 15:18:04,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:04,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 15:18:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:04,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:18:04,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:04,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 15:18:04,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:04,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 15:18:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:04,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-08 15:18:04,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:04,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 15:18:04,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:18:04,978 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 38 proven. 19 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-08 15:18:04,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:18:04,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424825134] [2024-11-08 15:18:04,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424825134] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:18:04,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927348592] [2024-11-08 15:18:04,978 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 15:18:04,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:18:04,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:18:04,981 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) [2024-11-08 15:18:04,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 15:18:05,055 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 15:18:05,055 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 15:18:05,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-08 15:18:05,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:18:05,293 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 4 proven. 60 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-08 15:18:05,293 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:18:07,015 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 2 proven. 62 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-08 15:18:07,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927348592] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:18:07,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:18:07,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 26 [2024-11-08 15:18:07,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659209929] [2024-11-08 15:18:07,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:18:07,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-08 15:18:07,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:18:07,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-08 15:18:07,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2024-11-08 15:18:07,020 INFO L87 Difference]: Start difference. First operand 66 states and 81 transitions. Second operand has 26 states, 25 states have (on average 5.12) internal successors, (128), 26 states have internal predecessors, (128), 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) [2024-11-08 15:18:07,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:18:07,260 INFO L93 Difference]: Finished difference Result 104 states and 138 transitions. [2024-11-08 15:18:07,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 15:18:07,261 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 5.12) internal successors, (128), 26 states have internal predecessors, (128), 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 87 [2024-11-08 15:18:07,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:18:07,261 INFO L225 Difference]: With dead ends: 104 [2024-11-08 15:18:07,261 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 15:18:07,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 173 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=233, Invalid=957, Unknown=0, NotChecked=0, Total=1190 [2024-11-08 15:18:07,263 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 88 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:18:07,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 192 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:18:07,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 15:18:07,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 15:18:07,264 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) [2024-11-08 15:18:07,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 15:18:07,265 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 87 [2024-11-08 15:18:07,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:18:07,265 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 15:18:07,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 5.12) internal successors, (128), 26 states have internal predecessors, (128), 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) [2024-11-08 15:18:07,265 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 15:18:07,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 15:18:07,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 15:18:07,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-08 15:18:07,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:18:07,472 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:18:07,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 15:18:08,221 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 15:18:08,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 03:18:08 BoogieIcfgContainer [2024-11-08 15:18:08,260 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 15:18:08,261 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 15:18:08,262 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 15:18:08,262 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 15:18:08,262 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:17:56" (3/4) ... [2024-11-08 15:18:08,265 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 15:18:08,269 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure multiple_of [2024-11-08 15:18:08,269 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure mult [2024-11-08 15:18:08,270 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_prime_ [2024-11-08 15:18:08,276 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-08 15:18:08,276 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-08 15:18:08,277 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 15:18:08,277 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 15:18:08,383 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 15:18:08,384 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 15:18:08,385 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 15:18:08,385 INFO L158 Benchmark]: Toolchain (without parser) took 12869.35ms. Allocated memory was 167.8MB in the beginning and 260.0MB in the end (delta: 92.3MB). Free memory was 95.9MB in the beginning and 108.9MB in the end (delta: -13.0MB). Peak memory consumption was 81.3MB. Max. memory is 16.1GB. [2024-11-08 15:18:08,386 INFO L158 Benchmark]: CDTParser took 0.68ms. Allocated memory is still 167.8MB. Free memory is still 120.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 15:18:08,386 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.48ms. Allocated memory is still 167.8MB. Free memory was 95.7MB in the beginning and 82.6MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 15:18:08,387 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.26ms. Allocated memory is still 167.8MB. Free memory was 82.6MB in the beginning and 81.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 15:18:08,387 INFO L158 Benchmark]: Boogie Preprocessor took 84.24ms. Allocated memory is still 167.8MB. Free memory was 81.1MB in the beginning and 138.3MB in the end (delta: -57.1MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. [2024-11-08 15:18:08,387 INFO L158 Benchmark]: RCFGBuilder took 373.64ms. Allocated memory is still 167.8MB. Free memory was 138.2MB in the beginning and 128.6MB in the end (delta: 9.6MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2024-11-08 15:18:08,388 INFO L158 Benchmark]: TraceAbstraction took 11959.97ms. Allocated memory was 167.8MB in the beginning and 260.0MB in the end (delta: 92.3MB). Free memory was 127.7MB in the beginning and 114.1MB in the end (delta: 13.6MB). Peak memory consumption was 143.6MB. Max. memory is 16.1GB. [2024-11-08 15:18:08,388 INFO L158 Benchmark]: Witness Printer took 123.36ms. Allocated memory is still 260.0MB. Free memory was 114.1MB in the beginning and 108.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 15:18:08,389 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.68ms. Allocated memory is still 167.8MB. Free memory is still 120.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 274.48ms. Allocated memory is still 167.8MB. Free memory was 95.7MB in the beginning and 82.6MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.26ms. Allocated memory is still 167.8MB. Free memory was 82.6MB in the beginning and 81.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 84.24ms. Allocated memory is still 167.8MB. Free memory was 81.1MB in the beginning and 138.3MB in the end (delta: -57.1MB). Peak memory consumption was 8.2MB. Max. memory is 16.1GB. * RCFGBuilder took 373.64ms. Allocated memory is still 167.8MB. Free memory was 138.2MB in the beginning and 128.6MB in the end (delta: 9.6MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. * TraceAbstraction took 11959.97ms. Allocated memory was 167.8MB in the beginning and 260.0MB in the end (delta: 92.3MB). Free memory was 127.7MB in the beginning and 114.1MB in the end (delta: 13.6MB). Peak memory consumption was 143.6MB. Max. memory is 16.1GB. * Witness Printer took 123.36ms. Allocated memory is still 260.0MB. Free memory was 114.1MB in the beginning and 108.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * 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, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.1s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 331 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 298 mSDsluCounter, 3643 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2963 mSDsCounter, 190 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1391 IncrementalHoareTripleChecker+Invalid, 1581 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 190 mSolverCounterUnsat, 680 mSDtfsCounter, 1391 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 857 GetRequests, 678 SyntacticMatches, 17 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=11, InterpolantAutomatonStates: 111, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 26 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 920 NumberOfCodeBlocks, 920 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1179 ConstructedInterpolants, 0 QuantifiedInterpolants, 3182 SizeOfPredicates, 24 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 - ProcedureContractResult [Line: 31]: Procedure Contract for multiple_of Derived contract for procedure multiple_of. Ensures: (((((((long long) m * 2) < ((long long) n + 1)) || (n == m)) || (n == 0)) || (((long long) n + m) < 1)) || (m < 1)) - ProcedureContractResult [Line: 17]: Procedure Contract for mult Derived contract for procedure mult. Ensures: ((((2 < \result) || (\result == 0)) || (m < 2)) || (n < 2)) - ProcedureContractResult [Line: 57]: Procedure Contract for is_prime_ Derived contract for procedure is_prime_. Ensures: (((\result == 0) || (((long long) m + 1) != n)) || (n < 3)) RESULT: Ultimate proved your program to be correct! [2024-11-08 15:18:08,425 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE