./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Ackermann04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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/Ackermann04.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 85f83c4bcdce9397140788b204098e14e4fa25f5b66f064340f4aaa544fbb462 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 23:19:28,579 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 23:19:28,650 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 23:19:28,654 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 23:19:28,657 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 23:19:28,691 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 23:19:28,692 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 23:19:28,692 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 23:19:28,693 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 23:19:28,693 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 23:19:28,694 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 23:19:28,694 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 23:19:28,695 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 23:19:28,699 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 23:19:28,699 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 23:19:28,700 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 23:19:28,700 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 23:19:28,700 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 23:19:28,701 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 23:19:28,701 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 23:19:28,703 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 23:19:28,703 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 23:19:28,704 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 23:19:28,704 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 23:19:28,704 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 23:19:28,704 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 23:19:28,705 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 23:19:28,705 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 23:19:28,705 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 23:19:28,705 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 23:19:28,706 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 23:19:28,706 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 23:19:28,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:19:28,706 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 23:19:28,707 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 23:19:28,707 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 23:19:28,708 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 23:19:28,708 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 23:19:28,709 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 23:19:28,709 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 23:19:28,709 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 23:19:28,710 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 23:19:28,710 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 -> 85f83c4bcdce9397140788b204098e14e4fa25f5b66f064340f4aaa544fbb462 [2024-11-09 23:19:28,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 23:19:28,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 23:19:28,996 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 23:19:28,997 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 23:19:28,998 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 23:19:28,999 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Ackermann04.c [2024-11-09 23:19:30,571 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 23:19:30,756 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 23:19:30,757 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann04.c [2024-11-09 23:19:30,765 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc9c1546f/8086e836d40b4c32ad09bae214ca678f/FLAG13fe7e5fb [2024-11-09 23:19:31,143 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc9c1546f/8086e836d40b4c32ad09bae214ca678f [2024-11-09 23:19:31,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 23:19:31,147 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 23:19:31,151 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 23:19:31,151 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 23:19:31,157 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 23:19:31,157 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:19:31" (1/1) ... [2024-11-09 23:19:31,158 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56a7b7f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:19:31, skipping insertion in model container [2024-11-09 23:19:31,158 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:19:31" (1/1) ... [2024-11-09 23:19:31,178 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 23:19:31,367 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/Ackermann04.c[1166,1179] [2024-11-09 23:19:31,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:19:31,387 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 23:19:31,407 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/Ackermann04.c[1166,1179] [2024-11-09 23:19:31,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:19:31,433 INFO L204 MainTranslator]: Completed translation [2024-11-09 23:19:31,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:19:31 WrapperNode [2024-11-09 23:19:31,437 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 23:19:31,438 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 23:19:31,438 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 23:19:31,438 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 23:19:31,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:19:31" (1/1) ... [2024-11-09 23:19:31,453 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:19:31" (1/1) ... [2024-11-09 23:19:31,472 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 33 [2024-11-09 23:19:31,473 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 23:19:31,474 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 23:19:31,474 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 23:19:31,474 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 23:19:31,485 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:19:31" (1/1) ... [2024-11-09 23:19:31,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:19:31" (1/1) ... [2024-11-09 23:19:31,487 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:19:31" (1/1) ... [2024-11-09 23:19:31,503 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-09 23:19:31,505 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:19:31" (1/1) ... [2024-11-09 23:19:31,505 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:19:31" (1/1) ... [2024-11-09 23:19:31,508 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:19:31" (1/1) ... [2024-11-09 23:19:31,513 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:19:31" (1/1) ... [2024-11-09 23:19:31,514 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:19:31" (1/1) ... [2024-11-09 23:19:31,515 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:19:31" (1/1) ... [2024-11-09 23:19:31,516 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 23:19:31,517 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 23:19:31,517 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 23:19:31,518 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 23:19:31,521 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:19:31" (1/1) ... [2024-11-09 23:19:31,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:19:31,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:19:31,558 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-09 23:19:31,566 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-09 23:19:31,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 23:19:31,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 23:19:31,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 23:19:31,610 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2024-11-09 23:19:31,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2024-11-09 23:19:31,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 23:19:31,663 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 23:19:31,665 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 23:19:31,777 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L23: havoc #t~ret5;havoc #t~ret6; [2024-11-09 23:19:31,778 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L21: havoc #t~ret4; [2024-11-09 23:19:31,793 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-09 23:19:31,793 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 23:19:31,812 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 23:19:31,812 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 23:19:31,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:19:31 BoogieIcfgContainer [2024-11-09 23:19:31,813 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 23:19:31,815 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 23:19:31,816 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 23:19:31,819 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 23:19:31,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:19:31" (1/3) ... [2024-11-09 23:19:31,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d255a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:19:31, skipping insertion in model container [2024-11-09 23:19:31,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:19:31" (2/3) ... [2024-11-09 23:19:31,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d255a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:19:31, skipping insertion in model container [2024-11-09 23:19:31,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:19:31" (3/3) ... [2024-11-09 23:19:31,822 INFO L112 eAbstractionObserver]: Analyzing ICFG Ackermann04.c [2024-11-09 23:19:31,839 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 23:19:31,840 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 23:19:31,914 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 23:19:31,922 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;@af088f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 23:19:31,922 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 23:19:31,927 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 23:19:31,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 23:19:31,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:19:31,937 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:19:31,937 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:19:31,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:19:31,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1006827994, now seen corresponding path program 1 times [2024-11-09 23:19:31,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:19:31,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59670400] [2024-11-09 23:19:31,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:19:31,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:19:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:32,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 23:19:32,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:32,323 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-09 23:19:32,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:19:32,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59670400] [2024-11-09 23:19:32,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59670400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:19:32,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:19:32,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:19:32,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371377970] [2024-11-09 23:19:32,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:19:32,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:19:32,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:19:32,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:19:32,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:19:32,353 INFO L87 Difference]: Start difference. First operand has 25 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 23:19:32,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:19:32,522 INFO L93 Difference]: Finished difference Result 53 states and 79 transitions. [2024-11-09 23:19:32,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 23:19:32,527 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-09 23:19:32,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:19:32,535 INFO L225 Difference]: With dead ends: 53 [2024-11-09 23:19:32,535 INFO L226 Difference]: Without dead ends: 28 [2024-11-09 23:19:32,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-09 23:19:32,541 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 10 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:19:32,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 75 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:19:32,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-09 23:19:32,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2024-11-09 23:19:32,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-09 23:19:32,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-11-09 23:19:32,585 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 13 [2024-11-09 23:19:32,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:19:32,585 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-11-09 23:19:32,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 23:19:32,586 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-11-09 23:19:32,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 23:19:32,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:19:32,588 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:19:32,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 23:19:32,588 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:19:32,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:19:32,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1003517886, now seen corresponding path program 1 times [2024-11-09 23:19:32,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:19:32,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018064500] [2024-11-09 23:19:32,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:19:32,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:19:32,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:32,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 23:19:32,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:32,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:32,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:32,746 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 23:19:32,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:19:32,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018064500] [2024-11-09 23:19:32,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018064500] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:19:32,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842534148] [2024-11-09 23:19:32,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:19:32,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:19:32,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:19:32,750 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-09 23:19:32,754 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-09 23:19:32,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:32,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 23:19:32,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:19:32,919 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 23:19:32,923 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:19:33,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 23:19:33,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842534148] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:19:33,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:19:33,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-09 23:19:33,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002785630] [2024-11-09 23:19:33,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:19:33,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 23:19:33,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:19:33,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 23:19:33,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:19:33,056 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 23:19:33,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:19:33,285 INFO L93 Difference]: Finished difference Result 82 states and 137 transitions. [2024-11-09 23:19:33,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 23:19:33,288 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 20 [2024-11-09 23:19:33,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:19:33,292 INFO L225 Difference]: With dead ends: 82 [2024-11-09 23:19:33,293 INFO L226 Difference]: Without dead ends: 57 [2024-11-09 23:19:33,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-09 23:19:33,295 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 25 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:19:33,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 83 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:19:33,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-09 23:19:33,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2024-11-09 23:19:33,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 35 states have internal predecessors, (40), 10 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (27), 12 states have call predecessors, (27), 10 states have call successors, (27) [2024-11-09 23:19:33,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 77 transitions. [2024-11-09 23:19:33,311 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 77 transitions. Word has length 20 [2024-11-09 23:19:33,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:19:33,311 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 77 transitions. [2024-11-09 23:19:33,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 23:19:33,312 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 77 transitions. [2024-11-09 23:19:33,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 23:19:33,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:19:33,319 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:19:33,338 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-09 23:19:33,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:19:33,520 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:19:33,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:19:33,521 INFO L85 PathProgramCache]: Analyzing trace with hash -943308142, now seen corresponding path program 1 times [2024-11-09 23:19:33,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:19:33,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488177677] [2024-11-09 23:19:33,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:19:33,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:19:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:33,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 23:19:33,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:33,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:33,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:33,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:33,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:33,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 23:19:33,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:33,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 23:19:34,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:34,004 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-09 23:19:34,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:19:34,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488177677] [2024-11-09 23:19:34,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488177677] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:19:34,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465497041] [2024-11-09 23:19:34,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:19:34,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:19:34,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:19:34,014 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-09 23:19:34,016 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-09 23:19:34,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:34,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 23:19:34,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:19:34,292 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-09 23:19:34,292 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:19:34,908 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-09 23:19:34,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465497041] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:19:34,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:19:34,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 11 [2024-11-09 23:19:34,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9066492] [2024-11-09 23:19:34,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:19:34,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 23:19:34,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:19:34,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 23:19:34,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-09 23:19:34,915 INFO L87 Difference]: Start difference. First operand 51 states and 77 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 5 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-09 23:19:35,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:19:35,054 INFO L93 Difference]: Finished difference Result 122 states and 229 transitions. [2024-11-09 23:19:35,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:19:35,055 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 5 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 5 states have call successors, (8) Word has length 46 [2024-11-09 23:19:35,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:19:35,058 INFO L225 Difference]: With dead ends: 122 [2024-11-09 23:19:35,058 INFO L226 Difference]: Without dead ends: 54 [2024-11-09 23:19:35,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 97 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-11-09 23:19:35,061 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 36 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:19:35,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 85 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:19:35,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-09 23:19:35,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-09 23:19:35,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (28), 11 states have call predecessors, (28), 8 states have call successors, (28) [2024-11-09 23:19:35,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 77 transitions. [2024-11-09 23:19:35,075 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 77 transitions. Word has length 46 [2024-11-09 23:19:35,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:19:35,075 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 77 transitions. [2024-11-09 23:19:35,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 5 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-09 23:19:35,076 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 77 transitions. [2024-11-09 23:19:35,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-09 23:19:35,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:19:35,079 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:19:35,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 23:19:35,279 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,SelfDestructingSolverStorable2 [2024-11-09 23:19:35,280 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:19:35,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:19:35,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1572766023, now seen corresponding path program 2 times [2024-11-09 23:19:35,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:19:35,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586195590] [2024-11-09 23:19:35,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:19:35,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:19:35,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:35,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 23:19:35,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:35,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:35,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:35,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:35,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:35,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:35,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:35,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:35,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:35,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:35,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 23:19:35,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:35,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 23:19:35,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:35,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:35,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:35,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 23:19:35,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:35,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:35,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:35,915 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 101 proven. 59 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-09 23:19:35,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:19:35,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586195590] [2024-11-09 23:19:35,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586195590] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:19:35,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332722676] [2024-11-09 23:19:35,916 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 23:19:35,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:19:35,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:19:35,918 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-09 23:19:35,920 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-09 23:19:35,991 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 23:19:35,991 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 23:19:35,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 23:19:35,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:19:36,070 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 141 proven. 37 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-11-09 23:19:36,070 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:19:37,726 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 85 proven. 65 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-11-09 23:19:37,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332722676] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:19:37,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:19:37,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 15] total 29 [2024-11-09 23:19:37,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030048486] [2024-11-09 23:19:37,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:19:37,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-09 23:19:37,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:19:37,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-09 23:19:37,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=699, Unknown=0, NotChecked=0, Total=812 [2024-11-09 23:19:37,732 INFO L87 Difference]: Start difference. First operand 54 states and 77 transitions. Second operand has 29 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 23 states have internal predecessors, (63), 9 states have call successors, (13), 2 states have call predecessors, (13), 12 states have return successors, (24), 15 states have call predecessors, (24), 9 states have call successors, (24) [2024-11-09 23:19:38,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:19:38,189 INFO L93 Difference]: Finished difference Result 121 states and 224 transitions. [2024-11-09 23:19:38,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 23:19:38,190 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 23 states have internal predecessors, (63), 9 states have call successors, (13), 2 states have call predecessors, (13), 12 states have return successors, (24), 15 states have call predecessors, (24), 9 states have call successors, (24) Word has length 80 [2024-11-09 23:19:38,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:19:38,196 INFO L225 Difference]: With dead ends: 121 [2024-11-09 23:19:38,196 INFO L226 Difference]: Without dead ends: 72 [2024-11-09 23:19:38,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 170 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=381, Invalid=1599, Unknown=0, NotChecked=0, Total=1980 [2024-11-09 23:19:38,203 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 17 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:19:38,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 149 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:19:38,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-09 23:19:38,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 54. [2024-11-09 23:19:38,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 38 states have internal predecessors, (41), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (24), 11 states have call predecessors, (24), 8 states have call successors, (24) [2024-11-09 23:19:38,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2024-11-09 23:19:38,223 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 80 [2024-11-09 23:19:38,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:19:38,224 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2024-11-09 23:19:38,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 23 states have internal predecessors, (63), 9 states have call successors, (13), 2 states have call predecessors, (13), 12 states have return successors, (24), 15 states have call predecessors, (24), 9 states have call successors, (24) [2024-11-09 23:19:38,224 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2024-11-09 23:19:38,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-09 23:19:38,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:19:38,229 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 13, 9, 8, 8, 8, 8, 8, 8, 8, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:19:38,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 23:19:38,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:19:38,434 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:19:38,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:19:38,434 INFO L85 PathProgramCache]: Analyzing trace with hash -915263200, now seen corresponding path program 3 times [2024-11-09 23:19:38,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:19:38,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219184026] [2024-11-09 23:19:38,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:19:38,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:19:38,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:38,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 23:19:38,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:38,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:38,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:38,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:38,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:38,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:38,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:38,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:38,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:38,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:38,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 23:19:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:38,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 23:19:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:38,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:38,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:38,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:38,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:38,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:38,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:38,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 23:19:38,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:38,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 23:19:38,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:38,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-09 23:19:38,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:38,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 23:19:38,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:38,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:38,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:39,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:39,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:39,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:39,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:39,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:39,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:39,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 23:19:39,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:39,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 23:19:39,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:39,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 425 proven. 29 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2024-11-09 23:19:39,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:19:39,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219184026] [2024-11-09 23:19:39,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219184026] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:19:39,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200194167] [2024-11-09 23:19:39,106 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 23:19:39,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:19:39,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:19:39,108 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-09 23:19:39,109 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-09 23:19:39,191 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-11-09 23:19:39,191 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 23:19:39,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 23:19:39,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:19:39,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 408 proven. 22 refuted. 0 times theorem prover too weak. 704 trivial. 0 not checked. [2024-11-09 23:19:39,271 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:19:40,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 408 proven. 30 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2024-11-09 23:19:40,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200194167] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:19:40,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:19:40,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 11] total 17 [2024-11-09 23:19:40,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627449469] [2024-11-09 23:19:40,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:19:40,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 23:19:40,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:19:40,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 23:19:40,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-09 23:19:40,366 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. Second operand has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 8 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (19), 6 states have call predecessors, (19), 8 states have call successors, (19) [2024-11-09 23:19:40,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:19:40,507 INFO L93 Difference]: Finished difference Result 115 states and 192 transitions. [2024-11-09 23:19:40,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:19:40,508 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 8 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (19), 6 states have call predecessors, (19), 8 states have call successors, (19) Word has length 152 [2024-11-09 23:19:40,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:19:40,510 INFO L225 Difference]: With dead ends: 115 [2024-11-09 23:19:40,510 INFO L226 Difference]: Without dead ends: 66 [2024-11-09 23:19:40,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 335 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2024-11-09 23:19:40,512 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 24 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:19:40,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 148 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:19:40,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-09 23:19:40,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2024-11-09 23:19:40,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 40 states have (on average 1.125) internal successors, (45), 41 states have internal predecessors, (45), 9 states have call successors, (9), 5 states have call predecessors, (9), 8 states have return successors, (25), 11 states have call predecessors, (25), 9 states have call successors, (25) [2024-11-09 23:19:40,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 79 transitions. [2024-11-09 23:19:40,526 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 79 transitions. Word has length 152 [2024-11-09 23:19:40,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:19:40,526 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 79 transitions. [2024-11-09 23:19:40,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.176470588235294) internal successors, (54), 17 states have internal predecessors, (54), 8 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (19), 6 states have call predecessors, (19), 8 states have call successors, (19) [2024-11-09 23:19:40,529 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 79 transitions. [2024-11-09 23:19:40,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 23:19:40,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:19:40,536 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 9, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:19:40,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 23:19:40,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:19:40,737 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:19:40,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:19:40,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1177602897, now seen corresponding path program 4 times [2024-11-09 23:19:40,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:19:40,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997621017] [2024-11-09 23:19:40,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:19:40,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:19:40,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:40,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 23:19:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:41,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:41,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:41,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:41,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:41,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:41,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:41,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:41,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 23:19:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:41,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 23:19:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:41,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:41,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:41,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:41,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:41,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 23:19:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:41,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 23:19:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:41,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:41,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:41,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:41,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 23:19:41,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:41,486 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 163 proven. 157 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2024-11-09 23:19:41,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:19:41,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997621017] [2024-11-09 23:19:41,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997621017] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:19:41,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175502256] [2024-11-09 23:19:41,487 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 23:19:41,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:19:41,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:19:41,489 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-09 23:19:41,490 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-09 23:19:41,603 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 23:19:41,603 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 23:19:41,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 23:19:41,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:19:41,693 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 190 proven. 71 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2024-11-09 23:19:41,694 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:19:42,875 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 208 proven. 61 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2024-11-09 23:19:42,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175502256] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:19:42,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:19:42,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 15] total 28 [2024-11-09 23:19:42,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945445242] [2024-11-09 23:19:42,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:19:42,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-09 23:19:42,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:19:42,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 23:19:42,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=646, Unknown=0, NotChecked=0, Total=756 [2024-11-09 23:19:42,877 INFO L87 Difference]: Start difference. First operand 58 states and 79 transitions. Second operand has 28 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 23 states have internal predecessors, (65), 11 states have call successors, (14), 1 states have call predecessors, (14), 12 states have return successors, (25), 14 states have call predecessors, (25), 11 states have call successors, (25) [2024-11-09 23:19:43,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:19:43,407 INFO L93 Difference]: Finished difference Result 123 states and 196 transitions. [2024-11-09 23:19:43,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-09 23:19:43,408 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 23 states have internal predecessors, (65), 11 states have call successors, (14), 1 states have call predecessors, (14), 12 states have return successors, (25), 14 states have call predecessors, (25), 11 states have call successors, (25) Word has length 106 [2024-11-09 23:19:43,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:19:43,409 INFO L225 Difference]: With dead ends: 123 [2024-11-09 23:19:43,409 INFO L226 Difference]: Without dead ends: 68 [2024-11-09 23:19:43,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 228 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=492, Invalid=1958, Unknown=0, NotChecked=0, Total=2450 [2024-11-09 23:19:43,412 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 38 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:19:43,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 211 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 23:19:43,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-09 23:19:43,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 62. [2024-11-09 23:19:43,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 44 states have internal predecessors, (49), 10 states have call successors, (10), 6 states have call predecessors, (10), 8 states have return successors, (25), 11 states have call predecessors, (25), 10 states have call successors, (25) [2024-11-09 23:19:43,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 84 transitions. [2024-11-09 23:19:43,423 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 84 transitions. Word has length 106 [2024-11-09 23:19:43,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:19:43,423 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 84 transitions. [2024-11-09 23:19:43,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.3214285714285716) internal successors, (65), 23 states have internal predecessors, (65), 11 states have call successors, (14), 1 states have call predecessors, (14), 12 states have return successors, (25), 14 states have call predecessors, (25), 11 states have call successors, (25) [2024-11-09 23:19:43,424 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 84 transitions. [2024-11-09 23:19:43,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-09 23:19:43,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:19:43,426 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 11, 8, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:19:43,440 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-09 23:19:43,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:19:43,631 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:19:43,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:19:43,631 INFO L85 PathProgramCache]: Analyzing trace with hash 814287591, now seen corresponding path program 5 times [2024-11-09 23:19:43,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:19:43,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822926047] [2024-11-09 23:19:43,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:19:43,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:19:43,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:43,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 23:19:43,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:43,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:43,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:43,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:43,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:44,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:44,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:44,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:44,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:44,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:44,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:44,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 23:19:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:44,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 23:19:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:44,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:44,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:44,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:44,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:44,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:44,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 23:19:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:44,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 23:19:44,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:44,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 23:19:44,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:44,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:44,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:44,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:44,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 23:19:44,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:44,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 23:19:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:44,348 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 152 proven. 295 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2024-11-09 23:19:44,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:19:44,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822926047] [2024-11-09 23:19:44,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822926047] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:19:44,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106103825] [2024-11-09 23:19:44,349 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 23:19:44,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:19:44,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:19:44,351 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-09 23:19:44,352 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-09 23:19:44,470 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2024-11-09 23:19:44,470 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 23:19:44,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 23:19:44,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:19:44,562 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 475 proven. 114 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2024-11-09 23:19:44,563 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:19:46,110 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 155 proven. 295 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2024-11-09 23:19:46,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106103825] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:19:46,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:19:46,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 17] total 24 [2024-11-09 23:19:46,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880741735] [2024-11-09 23:19:46,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:19:46,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 23:19:46,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:19:46,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 23:19:46,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2024-11-09 23:19:46,113 INFO L87 Difference]: Start difference. First operand 62 states and 84 transitions. Second operand has 24 states, 24 states have (on average 3.0) internal successors, (72), 21 states have internal predecessors, (72), 12 states have call successors, (18), 2 states have call predecessors, (18), 12 states have return successors, (28), 11 states have call predecessors, (28), 12 states have call successors, (28) [2024-11-09 23:19:46,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:19:46,560 INFO L93 Difference]: Finished difference Result 137 states and 214 transitions. [2024-11-09 23:19:46,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-09 23:19:46,561 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.0) internal successors, (72), 21 states have internal predecessors, (72), 12 states have call successors, (18), 2 states have call predecessors, (18), 12 states have return successors, (28), 11 states have call predecessors, (28), 12 states have call successors, (28) Word has length 132 [2024-11-09 23:19:46,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:19:46,563 INFO L225 Difference]: With dead ends: 137 [2024-11-09 23:19:46,563 INFO L226 Difference]: Without dead ends: 78 [2024-11-09 23:19:46,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 284 SyntacticMatches, 11 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=455, Invalid=1707, Unknown=0, NotChecked=0, Total=2162 [2024-11-09 23:19:46,567 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 53 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:19:46,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 176 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:19:46,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-09 23:19:46,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2024-11-09 23:19:46,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 50 states have internal predecessors, (55), 12 states have call successors, (12), 6 states have call predecessors, (12), 10 states have return successors, (32), 15 states have call predecessors, (32), 12 states have call successors, (32) [2024-11-09 23:19:46,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 99 transitions. [2024-11-09 23:19:46,588 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 99 transitions. Word has length 132 [2024-11-09 23:19:46,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:19:46,588 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 99 transitions. [2024-11-09 23:19:46,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.0) internal successors, (72), 21 states have internal predecessors, (72), 12 states have call successors, (18), 2 states have call predecessors, (18), 12 states have return successors, (28), 11 states have call predecessors, (28), 12 states have call successors, (28) [2024-11-09 23:19:46,588 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 99 transitions. [2024-11-09 23:19:46,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-09 23:19:46,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:19:46,592 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 13, 10, 9, 9, 9, 9, 9, 9, 9, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:19:46,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 23:19:46,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:19:46,797 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:19:46,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:19:46,797 INFO L85 PathProgramCache]: Analyzing trace with hash -109036847, now seen corresponding path program 6 times [2024-11-09 23:19:46,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:19:46,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880750666] [2024-11-09 23:19:46,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:19:46,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:19:46,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:47,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 23:19:47,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:47,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:47,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:47,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:47,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:47,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:47,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:47,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:47,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:47,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 23:19:47,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:47,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 23:19:47,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:47,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:47,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:47,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:47,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:47,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:47,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 23:19:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:47,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 23:19:47,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:47,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-09 23:19:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:47,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 23:19:47,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:47,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:47,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:47,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:47,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:47,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:47,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:47,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:47,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 23:19:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:47,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 23:19:47,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:47,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-09 23:19:47,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:47,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 445 proven. 284 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2024-11-09 23:19:47,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:19:47,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880750666] [2024-11-09 23:19:47,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880750666] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:19:47,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570600801] [2024-11-09 23:19:47,866 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-09 23:19:47,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:19:47,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:19:47,868 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:19:47,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 23:19:48,044 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2024-11-09 23:19:48,045 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 23:19:48,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-09 23:19:48,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:19:48,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 421 proven. 286 refuted. 0 times theorem prover too weak. 539 trivial. 0 not checked. [2024-11-09 23:19:48,191 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:19:51,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 467 proven. 286 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2024-11-09 23:19:51,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570600801] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:19:51,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:19:51,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 27] total 38 [2024-11-09 23:19:51,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348428661] [2024-11-09 23:19:51,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:19:51,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-09 23:19:51,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:19:51,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-09 23:19:51,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1220, Unknown=0, NotChecked=0, Total=1406 [2024-11-09 23:19:51,973 INFO L87 Difference]: Start difference. First operand 72 states and 99 transitions. Second operand has 38 states, 38 states have (on average 2.236842105263158) internal successors, (85), 32 states have internal predecessors, (85), 16 states have call successors, (19), 1 states have call predecessors, (19), 18 states have return successors, (36), 18 states have call predecessors, (36), 16 states have call successors, (36) [2024-11-09 23:19:52,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:19:52,661 INFO L93 Difference]: Finished difference Result 157 states and 248 transitions. [2024-11-09 23:19:52,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-09 23:19:52,662 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.236842105263158) internal successors, (85), 32 states have internal predecessors, (85), 16 states have call successors, (19), 1 states have call predecessors, (19), 18 states have return successors, (36), 18 states have call predecessors, (36), 16 states have call successors, (36) Word has length 158 [2024-11-09 23:19:52,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:19:52,664 INFO L225 Difference]: With dead ends: 157 [2024-11-09 23:19:52,664 INFO L226 Difference]: Without dead ends: 94 [2024-11-09 23:19:52,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 335 SyntacticMatches, 14 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1086 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=874, Invalid=3818, Unknown=0, NotChecked=0, Total=4692 [2024-11-09 23:19:52,667 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 79 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:19:52,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 272 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 23:19:52,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-09 23:19:52,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 82. [2024-11-09 23:19:52,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 56 states have internal predecessors, (61), 14 states have call successors, (14), 6 states have call predecessors, (14), 12 states have return successors, (43), 19 states have call predecessors, (43), 14 states have call successors, (43) [2024-11-09 23:19:52,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 118 transitions. [2024-11-09 23:19:52,681 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 118 transitions. Word has length 158 [2024-11-09 23:19:52,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:19:52,682 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 118 transitions. [2024-11-09 23:19:52,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.236842105263158) internal successors, (85), 32 states have internal predecessors, (85), 16 states have call successors, (19), 1 states have call predecessors, (19), 18 states have return successors, (36), 18 states have call predecessors, (36), 16 states have call successors, (36) [2024-11-09 23:19:52,682 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 118 transitions. [2024-11-09 23:19:52,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-09 23:19:52,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:19:52,686 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 14, 11, 10, 10, 10, 10, 10, 10, 10, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:19:52,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 23:19:52,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:19:52,887 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:19:52,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:19:52,887 INFO L85 PathProgramCache]: Analyzing trace with hash -886151942, now seen corresponding path program 7 times [2024-11-09 23:19:52,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:19:52,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846941115] [2024-11-09 23:19:52,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:19:52,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:19:52,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:53,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 23:19:53,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:53,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:53,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:53,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:53,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:53,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:53,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:53,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:53,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:53,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 23:19:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:53,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 23:19:53,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:53,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:53,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:53,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:53,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:53,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:53,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:53,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:53,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 23:19:53,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:53,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 23:19:53,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:53,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-09 23:19:53,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:53,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 23:19:53,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:53,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:53,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:53,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:53,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:53,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:53,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:53,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:53,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:53,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:53,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 23:19:53,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:53,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 23:19:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:53,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-09 23:19:53,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:53,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 23:19:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:53,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 502 proven. 372 refuted. 0 times theorem prover too weak. 609 trivial. 0 not checked. [2024-11-09 23:19:53,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:19:53,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846941115] [2024-11-09 23:19:53,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846941115] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:19:53,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979322986] [2024-11-09 23:19:53,919 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-09 23:19:53,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:19:53,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:19:53,921 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:19:53,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 23:19:54,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:54,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-09 23:19:54,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:19:54,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 477 proven. 372 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2024-11-09 23:19:54,255 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:19:58,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 525 proven. 384 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2024-11-09 23:19:58,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979322986] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:19:58,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:19:58,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21, 28] total 35 [2024-11-09 23:19:58,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345671304] [2024-11-09 23:19:58,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:19:58,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-09 23:19:58,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:19:58,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-09 23:19:58,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1017, Unknown=0, NotChecked=0, Total=1190 [2024-11-09 23:19:58,137 INFO L87 Difference]: Start difference. First operand 82 states and 118 transitions. Second operand has 35 states, 35 states have (on average 2.4571428571428573) internal successors, (86), 31 states have internal predecessors, (86), 17 states have call successors, (20), 1 states have call predecessors, (20), 18 states have return successors, (37), 16 states have call predecessors, (37), 17 states have call successors, (37) [2024-11-09 23:19:58,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:19:58,877 INFO L93 Difference]: Finished difference Result 183 states and 304 transitions. [2024-11-09 23:19:58,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-09 23:19:58,881 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.4571428571428573) internal successors, (86), 31 states have internal predecessors, (86), 17 states have call successors, (20), 1 states have call predecessors, (20), 18 states have return successors, (37), 16 states have call predecessors, (37), 17 states have call successors, (37) Word has length 171 [2024-11-09 23:19:58,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:19:58,883 INFO L225 Difference]: With dead ends: 183 [2024-11-09 23:19:58,883 INFO L226 Difference]: Without dead ends: 110 [2024-11-09 23:19:58,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 364 SyntacticMatches, 19 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=993, Invalid=3977, Unknown=0, NotChecked=0, Total=4970 [2024-11-09 23:19:58,886 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 77 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:19:58,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 294 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 23:19:58,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-09 23:19:58,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 92. [2024-11-09 23:19:58,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 61 states have (on average 1.098360655737705) internal successors, (67), 62 states have internal predecessors, (67), 16 states have call successors, (16), 6 states have call predecessors, (16), 14 states have return successors, (54), 23 states have call predecessors, (54), 16 states have call successors, (54) [2024-11-09 23:19:58,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 137 transitions. [2024-11-09 23:19:58,901 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 137 transitions. Word has length 171 [2024-11-09 23:19:58,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:19:58,901 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 137 transitions. [2024-11-09 23:19:58,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.4571428571428573) internal successors, (86), 31 states have internal predecessors, (86), 17 states have call successors, (20), 1 states have call predecessors, (20), 18 states have return successors, (37), 16 states have call predecessors, (37), 17 states have call successors, (37) [2024-11-09 23:19:58,902 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 137 transitions. [2024-11-09 23:19:58,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-09 23:19:58,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:19:58,904 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 15, 12, 11, 11, 11, 11, 11, 11, 11, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:19:58,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 23:19:59,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-09 23:19:59,105 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:19:59,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:19:59,105 INFO L85 PathProgramCache]: Analyzing trace with hash -158742623, now seen corresponding path program 8 times [2024-11-09 23:19:59,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:19:59,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244614790] [2024-11-09 23:19:59,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:19:59,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:19:59,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:59,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-09 23:19:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:59,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:59,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:59,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:59,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:59,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:59,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:59,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:59,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:59,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 23:19:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:59,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 23:19:59,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:59,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:59,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:59,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:59,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:59,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:59,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:59,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:59,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 23:19:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:59,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 23:19:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:59,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-09 23:19:59,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:59,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 23:19:59,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:59,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:59,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:59,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:59,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:59,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:19:59,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:19:59,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:20:00,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:20:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:20:00,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-09 23:20:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:20:00,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 23:20:00,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:20:00,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 23:20:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:20:00,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-09 23:20:00,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:20:00,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 23:20:00,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:20:00,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 23:20:00,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:20:00,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 686 proven. 70 refuted. 0 times theorem prover too weak. 985 trivial. 0 not checked. [2024-11-09 23:20:00,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:20:00,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244614790] [2024-11-09 23:20:00,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244614790] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:20:00,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948497812] [2024-11-09 23:20:00,216 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 23:20:00,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:20:00,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:20:00,219 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:20:00,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 23:20:00,508 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 23:20:00,508 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 23:20:00,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-09 23:20:00,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:20:00,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 657 proven. 84 refuted. 0 times theorem prover too weak. 1000 trivial. 0 not checked. [2024-11-09 23:20:00,611 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:20:07,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 711 proven. 75 refuted. 0 times theorem prover too weak. 955 trivial. 0 not checked. [2024-11-09 23:20:07,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948497812] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:20:07,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:20:07,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 33] total 38 [2024-11-09 23:20:07,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035917502] [2024-11-09 23:20:07,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:20:07,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-09 23:20:07,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:20:07,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-09 23:20:07,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1248, Unknown=0, NotChecked=0, Total=1406 [2024-11-09 23:20:07,004 INFO L87 Difference]: Start difference. First operand 92 states and 137 transitions. Second operand has 38 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 31 states have internal predecessors, (60), 6 states have call successors, (9), 1 states have call predecessors, (9), 15 states have return successors, (23), 13 states have call predecessors, (23), 6 states have call successors, (23) [2024-11-09 23:20:08,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:20:08,211 INFO L93 Difference]: Finished difference Result 127 states and 194 transitions. [2024-11-09 23:20:08,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-09 23:20:08,211 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 31 states have internal predecessors, (60), 6 states have call successors, (9), 1 states have call predecessors, (9), 15 states have return successors, (23), 13 states have call predecessors, (23), 6 states have call successors, (23) Word has length 184 [2024-11-09 23:20:08,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:20:08,212 INFO L225 Difference]: With dead ends: 127 [2024-11-09 23:20:08,212 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 23:20:08,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 393 SyntacticMatches, 20 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1121 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=954, Invalid=4448, Unknown=0, NotChecked=0, Total=5402 [2024-11-09 23:20:08,216 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 56 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 23:20:08,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 252 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 23:20:08,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 23:20:08,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 23:20:08,218 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-09 23:20:08,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 23:20:08,218 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 184 [2024-11-09 23:20:08,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:20:08,218 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 23:20:08,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 31 states have internal predecessors, (60), 6 states have call successors, (9), 1 states have call predecessors, (9), 15 states have return successors, (23), 13 states have call predecessors, (23), 6 states have call successors, (23) [2024-11-09 23:20:08,219 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 23:20:08,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 23:20:08,221 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 23:20:08,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-09 23:20:08,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 23:20:08,430 INFO L407 BasicCegarLoop]: Path program histogram: [8, 1, 1] [2024-11-09 23:20:08,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 23:20:11,652 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 23:20:11,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:20:11 BoogieIcfgContainer [2024-11-09 23:20:11,688 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 23:20:11,692 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 23:20:11,692 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 23:20:11,692 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 23:20:11,693 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:19:31" (3/4) ... [2024-11-09 23:20:11,695 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 23:20:11,700 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure ackermann [2024-11-09 23:20:11,705 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-09 23:20:11,705 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-09 23:20:11,705 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 23:20:11,705 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 23:20:11,786 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 23:20:11,787 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 23:20:11,787 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 23:20:11,787 INFO L158 Benchmark]: Toolchain (without parser) took 40640.45ms. Allocated memory was 148.9MB in the beginning and 736.1MB in the end (delta: 587.2MB). Free memory was 94.7MB in the beginning and 619.5MB in the end (delta: -524.8MB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB. [2024-11-09 23:20:11,788 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 148.9MB. Free memory is still 108.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 23:20:11,788 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.69ms. Allocated memory is still 148.9MB. Free memory was 94.7MB in the beginning and 82.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 23:20:11,788 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.18ms. Allocated memory is still 148.9MB. Free memory was 81.7MB in the beginning and 80.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 23:20:11,788 INFO L158 Benchmark]: Boogie Preprocessor took 42.77ms. Allocated memory is still 148.9MB. Free memory was 80.4MB in the beginning and 79.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 23:20:11,788 INFO L158 Benchmark]: IcfgBuilder took 295.89ms. Allocated memory is still 148.9MB. Free memory was 79.1MB in the beginning and 67.5MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 23:20:11,789 INFO L158 Benchmark]: TraceAbstraction took 39872.63ms. Allocated memory was 148.9MB in the beginning and 736.1MB in the end (delta: 587.2MB). Free memory was 66.8MB in the beginning and 624.7MB in the end (delta: -558.0MB). Peak memory consumption was 394.4MB. Max. memory is 16.1GB. [2024-11-09 23:20:11,789 INFO L158 Benchmark]: Witness Printer took 94.76ms. Allocated memory is still 736.1MB. Free memory was 624.7MB in the beginning and 619.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 23:20:11,790 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.26ms. Allocated memory is still 148.9MB. Free memory is still 108.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 286.69ms. Allocated memory is still 148.9MB. Free memory was 94.7MB in the beginning and 82.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.18ms. Allocated memory is still 148.9MB. Free memory was 81.7MB in the beginning and 80.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.77ms. Allocated memory is still 148.9MB. Free memory was 80.4MB in the beginning and 79.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 295.89ms. Allocated memory is still 148.9MB. Free memory was 79.1MB in the beginning and 67.5MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 39872.63ms. Allocated memory was 148.9MB in the beginning and 736.1MB in the end (delta: 587.2MB). Free memory was 66.8MB in the beginning and 624.7MB in the end (delta: -558.0MB). Peak memory consumption was 394.4MB. Max. memory is 16.1GB. * Witness Printer took 94.76ms. Allocated memory is still 736.1MB. Free memory was 624.7MB in the beginning and 619.5MB 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: 45]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 36.6s, OverallIterations: 10, TraceHistogramMax: 27, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 460 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 415 mSDsluCounter, 1745 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1477 mSDsCounter, 576 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3758 IncrementalHoareTripleChecker+Invalid, 4334 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 576 mSolverCounterUnsat, 268 mSDtfsCounter, 3758 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2717 GetRequests, 2249 SyntacticMatches, 81 SemanticMatches, 387 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4886 ImplicationChecksByTransitivity, 4.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=9, InterpolantAutomatonStates: 243, 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, 10 MinimizatonAttempts, 76 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 27.9s InterpolantComputationTime, 2111 NumberOfCodeBlocks, 1966 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 3132 ConstructedInterpolants, 0 QuantifiedInterpolants, 6098 SizeOfPredicates, 30 NumberOfNonLiveVariables, 2768 ConjunctsInSsa, 195 ConjunctsInUnsatCore, 28 InterpolantComputations, 1 PerfectInterpolantSequences, 18320/21849 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: 16]: Procedure Contract for ackermann Derived contract for procedure ackermann. Ensures: ((((((((((((6 < \result) || (n == 0)) || ((m == 1) && (n <= 1))) || (((4 <= \result) && (n <= 2)) && (m == 1))) || (m < 1)) || (((n <= 3) && (5 <= \result)) && (m == 1))) || ((5 <= \result) && (n <= 1))) || (((n <= 4) && (\result == 6)) && (m == 1))) && ((0 < m) || (n < \result))) && (((m == 0) || (n == 0)) || (0 < n))) && ((0 < m) || (m == 0))) && (((((n == 0) && (\result == 2)) && (m == 1)) || (m < 1)) || (2 < \result))) RESULT: Ultimate proved your program to be correct! [2024-11-09 23:20:11,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE