./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/sum_15x0-2.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-simple/sum_15x0-2.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 610248c6c4c4e7168ba971ed5fa38cec025658aa482465da336c99be91c3aa5c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 23:23:07,669 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 23:23:07,740 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 23:23:07,747 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 23:23:07,748 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 23:23:07,767 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 23:23:07,768 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 23:23:07,769 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 23:23:07,770 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 23:23:07,771 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 23:23:07,772 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 23:23:07,772 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 23:23:07,773 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 23:23:07,775 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 23:23:07,775 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 23:23:07,775 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 23:23:07,776 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 23:23:07,776 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 23:23:07,776 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 23:23:07,776 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 23:23:07,777 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 23:23:07,779 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 23:23:07,779 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 23:23:07,780 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 23:23:07,781 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 23:23:07,781 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 23:23:07,781 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 23:23:07,782 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 23:23:07,782 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 23:23:07,782 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 23:23:07,782 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 23:23:07,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 23:23:07,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:23:07,784 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 23:23:07,784 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 23:23:07,784 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 23:23:07,785 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 23:23:07,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 23:23:07,785 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 23:23:07,785 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 23:23:07,785 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 23:23:07,786 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 23:23:07,786 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 -> 610248c6c4c4e7168ba971ed5fa38cec025658aa482465da336c99be91c3aa5c [2024-11-09 23:23:08,055 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 23:23:08,076 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 23:23:08,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 23:23:08,081 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 23:23:08,081 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 23:23:08,083 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/sum_15x0-2.c [2024-11-09 23:23:09,525 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 23:23:09,698 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 23:23:09,699 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_15x0-2.c [2024-11-09 23:23:09,705 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24752d12f/050073faee594899b1f618531d3b9738/FLAGc79699536 [2024-11-09 23:23:10,103 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24752d12f/050073faee594899b1f618531d3b9738 [2024-11-09 23:23:10,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 23:23:10,107 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 23:23:10,108 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 23:23:10,108 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 23:23:10,112 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 23:23:10,113 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:23:10" (1/1) ... [2024-11-09 23:23:10,114 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a5b244a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:23:10, skipping insertion in model container [2024-11-09 23:23:10,114 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:23:10" (1/1) ... [2024-11-09 23:23:10,130 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 23:23:10,304 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-simple/sum_15x0-2.c[481,494] [2024-11-09 23:23:10,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:23:10,320 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 23:23:10,332 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-simple/sum_15x0-2.c[481,494] [2024-11-09 23:23:10,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:23:10,346 INFO L204 MainTranslator]: Completed translation [2024-11-09 23:23:10,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:23:10 WrapperNode [2024-11-09 23:23:10,346 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 23:23:10,347 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 23:23:10,347 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 23:23:10,347 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 23:23:10,352 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:23:10" (1/1) ... [2024-11-09 23:23:10,358 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:23:10" (1/1) ... [2024-11-09 23:23:10,370 INFO L138 Inliner]: procedures = 12, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2024-11-09 23:23:10,371 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 23:23:10,371 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 23:23:10,372 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 23:23:10,372 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 23:23:10,379 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:23:10" (1/1) ... [2024-11-09 23:23:10,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:23:10" (1/1) ... [2024-11-09 23:23:10,380 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:23:10" (1/1) ... [2024-11-09 23:23:10,391 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:23:10,392 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:23:10" (1/1) ... [2024-11-09 23:23:10,392 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:23:10" (1/1) ... [2024-11-09 23:23:10,394 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:23:10" (1/1) ... [2024-11-09 23:23:10,394 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:23:10" (1/1) ... [2024-11-09 23:23:10,395 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:23:10" (1/1) ... [2024-11-09 23:23:10,396 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:23:10" (1/1) ... [2024-11-09 23:23:10,397 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 23:23:10,398 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 23:23:10,398 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 23:23:10,398 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 23:23:10,399 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:23:10" (1/1) ... [2024-11-09 23:23:10,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:23:10,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:23:10,456 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:23:10,458 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:23:10,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 23:23:10,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 23:23:10,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 23:23:10,505 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2024-11-09 23:23:10,505 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2024-11-09 23:23:10,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 23:23:10,556 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 23:23:10,558 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 23:23:10,662 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L9: havoc #t~ret4; [2024-11-09 23:23:10,672 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-09 23:23:10,673 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 23:23:10,685 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 23:23:10,685 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 23:23:10,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:23:10 BoogieIcfgContainer [2024-11-09 23:23:10,686 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 23:23:10,689 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 23:23:10,690 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 23:23:10,694 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 23:23:10,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:23:10" (1/3) ... [2024-11-09 23:23:10,695 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@297b060a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:23:10, skipping insertion in model container [2024-11-09 23:23:10,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:23:10" (2/3) ... [2024-11-09 23:23:10,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@297b060a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:23:10, skipping insertion in model container [2024-11-09 23:23:10,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:23:10" (3/3) ... [2024-11-09 23:23:10,697 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_15x0-2.c [2024-11-09 23:23:10,712 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 23:23:10,713 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 23:23:10,760 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 23:23:10,766 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;@7d50d3a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 23:23:10,766 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 23:23:10,771 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 23:23:10,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 23:23:10,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:23:10,779 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:23:10,780 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:23:10,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:23:10,785 INFO L85 PathProgramCache]: Analyzing trace with hash -253956851, now seen corresponding path program 1 times [2024-11-09 23:23:10,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:23:10,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969016304] [2024-11-09 23:23:10,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:23:10,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:23:10,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:11,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:11,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:11,158 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:23:11,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:23:11,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969016304] [2024-11-09 23:23:11,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969016304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:23:11,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:23:11,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:23:11,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872717490] [2024-11-09 23:23:11,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:23:11,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:23:11,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:23:11,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:23:11,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:23:11,186 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 14 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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:23:11,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:23:11,242 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2024-11-09 23:23:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:23:11,244 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 11 [2024-11-09 23:23:11,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:23:11,250 INFO L225 Difference]: With dead ends: 28 [2024-11-09 23:23:11,250 INFO L226 Difference]: Without dead ends: 16 [2024-11-09 23:23:11,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:23:11,255 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:23:11,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 39 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:23:11,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-09 23:23:11,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-09 23:23:11,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 12 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 23:23:11,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2024-11-09 23:23:11,297 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2024-11-09 23:23:11,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:23:11,297 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2024-11-09 23:23:11,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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:23:11,298 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2024-11-09 23:23:11,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 23:23:11,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:23:11,300 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:23:11,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 23:23:11,301 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:23:11,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:23:11,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1018036117, now seen corresponding path program 1 times [2024-11-09 23:23:11,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:23:11,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992111247] [2024-11-09 23:23:11,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:23:11,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:23:11,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:11,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:11,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:11,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:11,513 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 23:23:11,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:23:11,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992111247] [2024-11-09 23:23:11,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992111247] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:23:11,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685015288] [2024-11-09 23:23:11,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:23:11,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:23:11,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:23:11,516 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:23:11,519 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:23:11,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:11,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 23:23:11,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:23:11,682 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 23:23:11,682 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:23:11,889 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 23:23:11,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685015288] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:23:11,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:23:11,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 10 [2024-11-09 23:23:11,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344829660] [2024-11-09 23:23:11,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:23:11,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 23:23:11,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:23:11,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 23:23:11,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:23:11,893 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 10 states have internal predecessors, (20), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 23:23:11,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:23:11,943 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2024-11-09 23:23:11,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 23:23:11,943 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 10 states have internal predecessors, (20), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) Word has length 17 [2024-11-09 23:23:11,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:23:11,944 INFO L225 Difference]: With dead ends: 24 [2024-11-09 23:23:11,944 INFO L226 Difference]: Without dead ends: 19 [2024-11-09 23:23:11,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-09 23:23:11,946 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 8 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:23:11,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 35 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:23:11,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-09 23:23:11,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2024-11-09 23:23:11,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 23:23:11,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2024-11-09 23:23:11,952 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 17 [2024-11-09 23:23:11,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:23:11,952 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2024-11-09 23:23:11,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 10 states have internal predecessors, (20), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 23:23:11,953 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2024-11-09 23:23:11,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 23:23:11,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:23:11,954 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:23:11,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 23:23:12,155 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:23:12,156 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:23:12,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:23:12,157 INFO L85 PathProgramCache]: Analyzing trace with hash -94460851, now seen corresponding path program 2 times [2024-11-09 23:23:12,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:23:12,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102412604] [2024-11-09 23:23:12,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:23:12,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:23:12,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:12,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:12,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:12,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:12,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:12,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:12,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:12,380 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 23:23:12,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:23:12,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102412604] [2024-11-09 23:23:12,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102412604] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:23:12,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644184634] [2024-11-09 23:23:12,382 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 23:23:12,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:23:12,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:23:12,385 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:23:12,388 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:23:12,433 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 23:23:12,433 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 23:23:12,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 23:23:12,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:23:12,486 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 23:23:12,486 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:23:12,845 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 23:23:12,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644184634] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:23:12,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:23:12,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 12 [2024-11-09 23:23:12,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350438613] [2024-11-09 23:23:12,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:23:12,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 23:23:12,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:23:12,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 23:23:12,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-09 23:23:12,849 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 12 states, 10 states have (on average 2.4) internal successors, (24), 12 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-09 23:23:12,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:23:12,905 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2024-11-09 23:23:12,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 23:23:12,906 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.4) internal successors, (24), 12 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) Word has length 23 [2024-11-09 23:23:12,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:23:12,906 INFO L225 Difference]: With dead ends: 27 [2024-11-09 23:23:12,906 INFO L226 Difference]: Without dead ends: 22 [2024-11-09 23:23:12,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-11-09 23:23:12,908 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 19 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:23:12,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 50 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:23:12,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-09 23:23:12,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-09 23:23:12,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 23:23:12,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2024-11-09 23:23:12,915 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 23 [2024-11-09 23:23:12,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:23:12,915 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2024-11-09 23:23:12,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.4) internal successors, (24), 12 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-09 23:23:12,916 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2024-11-09 23:23:12,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 23:23:12,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:23:12,917 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:23:12,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 23:23:13,120 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:23:13,121 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:23:13,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:23:13,121 INFO L85 PathProgramCache]: Analyzing trace with hash -472860373, now seen corresponding path program 3 times [2024-11-09 23:23:13,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:23:13,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986147169] [2024-11-09 23:23:13,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:23:13,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:23:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:13,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:13,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:13,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:13,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:13,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:13,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:13,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:13,374 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 23:23:13,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:23:13,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986147169] [2024-11-09 23:23:13,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986147169] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:23:13,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020103219] [2024-11-09 23:23:13,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 23:23:13,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:23:13,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:23:13,377 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:23:13,379 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:23:13,424 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-09 23:23:13,424 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 23:23:13,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 23:23:13,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:23:13,485 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 23:23:13,487 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:23:13,988 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 23:23:13,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020103219] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:23:13,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:23:13,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 14 [2024-11-09 23:23:13,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907169427] [2024-11-09 23:23:13,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:23:13,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 23:23:13,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:23:13,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 23:23:13,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-09 23:23:13,991 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 14 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 14 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (11), 4 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-09 23:23:14,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:23:14,048 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2024-11-09 23:23:14,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 23:23:14,049 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 14 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (11), 4 states have call predecessors, (11), 7 states have call successors, (11) Word has length 29 [2024-11-09 23:23:14,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:23:14,049 INFO L225 Difference]: With dead ends: 30 [2024-11-09 23:23:14,049 INFO L226 Difference]: Without dead ends: 25 [2024-11-09 23:23:14,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2024-11-09 23:23:14,051 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:23:14,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 62 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:23:14,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-09 23:23:14,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-09 23:23:14,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 18 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-09 23:23:14,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2024-11-09 23:23:14,056 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 29 [2024-11-09 23:23:14,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:23:14,056 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2024-11-09 23:23:14,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 14 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (11), 4 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-09 23:23:14,057 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2024-11-09 23:23:14,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 23:23:14,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:23:14,058 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:23:14,074 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:23:14,262 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:23:14,263 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:23:14,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:23:14,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1015344013, now seen corresponding path program 4 times [2024-11-09 23:23:14,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:23:14,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221882323] [2024-11-09 23:23:14,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:23:14,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:23:14,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:14,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:14,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:14,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:14,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:14,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:14,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:14,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:14,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:14,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:14,575 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-09 23:23:14,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:23:14,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221882323] [2024-11-09 23:23:14,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221882323] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:23:14,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709254478] [2024-11-09 23:23:14,578 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 23:23:14,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:23:14,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:23:14,580 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:23:14,582 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:23:14,634 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 23:23:14,634 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 23:23:14,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 23:23:14,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:23:14,693 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-09 23:23:14,694 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:23:15,431 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 23:23:15,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709254478] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:23:15,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:23:15,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 16 [2024-11-09 23:23:15,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623370457] [2024-11-09 23:23:15,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:23:15,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 23:23:15,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:23:15,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 23:23:15,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-09 23:23:15,434 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 16 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (14), 5 states have call predecessors, (14), 8 states have call successors, (14) [2024-11-09 23:23:15,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:23:15,523 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2024-11-09 23:23:15,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:23:15,523 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 16 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (14), 5 states have call predecessors, (14), 8 states have call successors, (14) Word has length 35 [2024-11-09 23:23:15,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:23:15,525 INFO L225 Difference]: With dead ends: 33 [2024-11-09 23:23:15,525 INFO L226 Difference]: Without dead ends: 28 [2024-11-09 23:23:15,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 67 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2024-11-09 23:23:15,527 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 26 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:23:15,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 60 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:23:15,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-09 23:23:15,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-09 23:23:15,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 20 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (7), 6 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-09 23:23:15,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2024-11-09 23:23:15,538 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 35 [2024-11-09 23:23:15,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:23:15,538 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2024-11-09 23:23:15,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 16 states have internal predecessors, (32), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (14), 5 states have call predecessors, (14), 8 states have call successors, (14) [2024-11-09 23:23:15,539 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2024-11-09 23:23:15,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 23:23:15,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:23:15,540 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:23:15,558 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:23:15,740 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:23:15,740 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:23:15,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:23:15,741 INFO L85 PathProgramCache]: Analyzing trace with hash -598941205, now seen corresponding path program 5 times [2024-11-09 23:23:15,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:23:15,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144485851] [2024-11-09 23:23:15,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:23:15,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:23:15,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:15,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:15,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:15,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:15,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:15,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:16,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:16,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:16,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:16,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:16,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:16,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:16,083 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 23:23:16,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:23:16,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144485851] [2024-11-09 23:23:16,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144485851] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:23:16,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615259418] [2024-11-09 23:23:16,084 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 23:23:16,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:23:16,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:23:16,086 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:23:16,087 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:23:16,151 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-11-09 23:23:16,151 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 23:23:16,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 23:23:16,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:23:16,214 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-09 23:23:16,215 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:23:17,267 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-09 23:23:17,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615259418] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:23:17,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:23:17,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 18 [2024-11-09 23:23:17,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500296267] [2024-11-09 23:23:17,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:23:17,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 23:23:17,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:23:17,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 23:23:17,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2024-11-09 23:23:17,269 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 18 states, 16 states have (on average 2.25) internal successors, (36), 18 states have internal predecessors, (36), 9 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (17), 6 states have call predecessors, (17), 9 states have call successors, (17) [2024-11-09 23:23:17,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:23:17,353 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2024-11-09 23:23:17,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 23:23:17,354 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.25) internal successors, (36), 18 states have internal predecessors, (36), 9 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (17), 6 states have call predecessors, (17), 9 states have call successors, (17) Word has length 41 [2024-11-09 23:23:17,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:23:17,355 INFO L225 Difference]: With dead ends: 36 [2024-11-09 23:23:17,355 INFO L226 Difference]: Without dead ends: 31 [2024-11-09 23:23:17,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 79 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2024-11-09 23:23:17,356 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 37 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:23:17,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 76 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:23:17,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-09 23:23:17,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-09 23:23:17,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 22 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (8), 7 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 23:23:17,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2024-11-09 23:23:17,364 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 41 [2024-11-09 23:23:17,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:23:17,365 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2024-11-09 23:23:17,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.25) internal successors, (36), 18 states have internal predecessors, (36), 9 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (17), 6 states have call predecessors, (17), 9 states have call successors, (17) [2024-11-09 23:23:17,365 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2024-11-09 23:23:17,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 23:23:17,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:23:17,366 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:23:17,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 23:23:17,566 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:23:17,567 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:23:17,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:23:17,568 INFO L85 PathProgramCache]: Analyzing trace with hash -853294387, now seen corresponding path program 6 times [2024-11-09 23:23:17,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:23:17,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773486595] [2024-11-09 23:23:17,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:23:17,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:23:17,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:17,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:17,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:17,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:17,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:17,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:17,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:17,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:17,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:17,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:17,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:17,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:17,893 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-09 23:23:17,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:23:17,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773486595] [2024-11-09 23:23:17,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773486595] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:23:17,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628788677] [2024-11-09 23:23:17,893 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-09 23:23:17,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:23:17,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:23:17,895 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:23:17,897 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:23:17,972 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2024-11-09 23:23:17,972 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 23:23:17,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 23:23:17,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:23:18,031 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-09 23:23:18,032 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:23:19,425 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-09 23:23:19,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628788677] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:23:19,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:23:19,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 20 [2024-11-09 23:23:19,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115941764] [2024-11-09 23:23:19,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:23:19,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 23:23:19,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:23:19,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 23:23:19,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2024-11-09 23:23:19,428 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 20 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 20 states have internal predecessors, (40), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (20), 7 states have call predecessors, (20), 10 states have call successors, (20) [2024-11-09 23:23:19,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:23:19,516 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2024-11-09 23:23:19,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 23:23:19,516 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 20 states have internal predecessors, (40), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (20), 7 states have call predecessors, (20), 10 states have call successors, (20) Word has length 47 [2024-11-09 23:23:19,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:23:19,517 INFO L225 Difference]: With dead ends: 39 [2024-11-09 23:23:19,517 INFO L226 Difference]: Without dead ends: 34 [2024-11-09 23:23:19,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 91 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=204, Invalid=446, Unknown=0, NotChecked=0, Total=650 [2024-11-09 23:23:19,518 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 30 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:23:19,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 89 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:23:19,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-09 23:23:19,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-09 23:23:19,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 24 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 23:23:19,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2024-11-09 23:23:19,524 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 47 [2024-11-09 23:23:19,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:23:19,524 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2024-11-09 23:23:19,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 20 states have internal predecessors, (40), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (20), 7 states have call predecessors, (20), 10 states have call successors, (20) [2024-11-09 23:23:19,524 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2024-11-09 23:23:19,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 23:23:19,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:23:19,526 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:23:19,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 23:23:19,728 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:23:19,729 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:23:19,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:23:19,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1267565909, now seen corresponding path program 7 times [2024-11-09 23:23:19,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:23:19,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075626970] [2024-11-09 23:23:19,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:23:19,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:23:19,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:19,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:19,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:19,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:19,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:19,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:19,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:20,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:20,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:20,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:20,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:20,120 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-09 23:23:20,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:23:20,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075626970] [2024-11-09 23:23:20,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075626970] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:23:20,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515684624] [2024-11-09 23:23:20,121 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-09 23:23:20,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:23:20,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:23:20,123 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:23:20,124 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:23:20,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:20,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 23:23:20,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:23:20,275 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-09 23:23:20,275 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:23:22,010 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 23:23:22,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515684624] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:23:22,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:23:22,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 22 [2024-11-09 23:23:22,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214341288] [2024-11-09 23:23:22,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:23:22,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 23:23:22,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:23:22,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 23:23:22,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2024-11-09 23:23:22,012 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 22 states, 20 states have (on average 2.2) internal successors, (44), 22 states have internal predecessors, (44), 11 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (23), 8 states have call predecessors, (23), 11 states have call successors, (23) [2024-11-09 23:23:22,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:23:22,119 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2024-11-09 23:23:22,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 23:23:22,120 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.2) internal successors, (44), 22 states have internal predecessors, (44), 11 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (23), 8 states have call predecessors, (23), 11 states have call successors, (23) Word has length 53 [2024-11-09 23:23:22,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:23:22,120 INFO L225 Difference]: With dead ends: 42 [2024-11-09 23:23:22,120 INFO L226 Difference]: Without dead ends: 37 [2024-11-09 23:23:22,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 103 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=256, Invalid=556, Unknown=0, NotChecked=0, Total=812 [2024-11-09 23:23:22,122 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 62 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:23:22,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 81 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:23:22,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-09 23:23:22,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-09 23:23:22,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.04) internal successors, (26), 26 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 9 states have return successors, (10), 9 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-09 23:23:22,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2024-11-09 23:23:22,127 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 53 [2024-11-09 23:23:22,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:23:22,128 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2024-11-09 23:23:22,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.2) internal successors, (44), 22 states have internal predecessors, (44), 11 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (23), 8 states have call predecessors, (23), 11 states have call successors, (23) [2024-11-09 23:23:22,128 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2024-11-09 23:23:22,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 23:23:22,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:23:22,129 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:23:22,142 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:23:22,331 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:23:22,332 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:23:22,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:23:22,332 INFO L85 PathProgramCache]: Analyzing trace with hash -753980915, now seen corresponding path program 8 times [2024-11-09 23:23:22,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:23:22,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090369438] [2024-11-09 23:23:22,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:23:22,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:23:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:22,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:22,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:22,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:22,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:22,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:22,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:22,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:22,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:22,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:22,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:22,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:22,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:22,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:22,766 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 23:23:22,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:23:22,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090369438] [2024-11-09 23:23:22,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090369438] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:23:22,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774183238] [2024-11-09 23:23:22,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 23:23:22,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:23:22,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:23:22,768 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:23:22,770 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:23:22,911 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 23:23:22,911 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 23:23:22,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 23:23:22,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:23:22,985 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 23:23:22,985 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:23:25,465 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-09 23:23:25,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774183238] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:23:25,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:23:25,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 21] total 24 [2024-11-09 23:23:25,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559971515] [2024-11-09 23:23:25,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:23:25,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 23:23:25,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:23:25,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 23:23:25,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2024-11-09 23:23:25,467 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 24 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 24 states have internal predecessors, (48), 12 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (26), 9 states have call predecessors, (26), 12 states have call successors, (26) [2024-11-09 23:23:25,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:23:25,590 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2024-11-09 23:23:25,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 23:23:25,590 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 24 states have internal predecessors, (48), 12 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (26), 9 states have call predecessors, (26), 12 states have call successors, (26) Word has length 59 [2024-11-09 23:23:25,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:23:25,591 INFO L225 Difference]: With dead ends: 45 [2024-11-09 23:23:25,591 INFO L226 Difference]: Without dead ends: 40 [2024-11-09 23:23:25,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 115 SyntacticMatches, 9 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=314, Invalid=678, Unknown=0, NotChecked=0, Total=992 [2024-11-09 23:23:25,593 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 68 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:23:25,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 98 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:23:25,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-09 23:23:25,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-09 23:23:25,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.037037037037037) internal successors, (28), 28 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 10 states have return successors, (11), 10 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:23:25,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2024-11-09 23:23:25,602 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 59 [2024-11-09 23:23:25,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:23:25,602 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2024-11-09 23:23:25,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 24 states have internal predecessors, (48), 12 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (26), 9 states have call predecessors, (26), 12 states have call successors, (26) [2024-11-09 23:23:25,602 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2024-11-09 23:23:25,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 23:23:25,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:23:25,603 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:23:25,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-09 23:23:25,803 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:23:25,804 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:23:25,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:23:25,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1024621717, now seen corresponding path program 9 times [2024-11-09 23:23:25,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:23:25,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787134776] [2024-11-09 23:23:25,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:23:25,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:23:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:25,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:26,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:26,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:26,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:26,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:26,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:26,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:26,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:26,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:26,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:26,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:26,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:26,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:26,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:26,370 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-09 23:23:26,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:23:26,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787134776] [2024-11-09 23:23:26,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787134776] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:23:26,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482326018] [2024-11-09 23:23:26,370 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 23:23:26,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:23:26,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:23:26,372 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:23:26,373 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:23:26,533 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-11-09 23:23:26,533 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 23:23:26,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 23:23:26,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:23:26,602 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-09 23:23:26,602 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:23:29,814 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-09 23:23:29,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482326018] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:23:29,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:23:29,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 23] total 26 [2024-11-09 23:23:29,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941656848] [2024-11-09 23:23:29,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:23:29,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 23:23:29,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:23:29,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 23:23:29,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=479, Unknown=0, NotChecked=0, Total=650 [2024-11-09 23:23:29,817 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand has 26 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 26 states have internal predecessors, (52), 13 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (29), 10 states have call predecessors, (29), 13 states have call successors, (29) [2024-11-09 23:23:29,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:23:29,934 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2024-11-09 23:23:29,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 23:23:29,934 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 26 states have internal predecessors, (52), 13 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (29), 10 states have call predecessors, (29), 13 states have call successors, (29) Word has length 65 [2024-11-09 23:23:29,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:23:29,935 INFO L225 Difference]: With dead ends: 48 [2024-11-09 23:23:29,935 INFO L226 Difference]: Without dead ends: 43 [2024-11-09 23:23:29,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 127 SyntacticMatches, 10 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=812, Unknown=0, NotChecked=0, Total=1190 [2024-11-09 23:23:29,936 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 55 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:23:29,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 113 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:23:29,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-09 23:23:29,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-09 23:23:29,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 30 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 11 states have return successors, (12), 11 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 23:23:29,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2024-11-09 23:23:29,950 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 65 [2024-11-09 23:23:29,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:23:29,950 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2024-11-09 23:23:29,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 26 states have internal predecessors, (52), 13 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (29), 10 states have call predecessors, (29), 13 states have call successors, (29) [2024-11-09 23:23:29,951 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2024-11-09 23:23:29,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 23:23:29,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:23:29,952 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:23:29,967 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:23:30,156 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:23:30,157 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:23:30,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:23:30,157 INFO L85 PathProgramCache]: Analyzing trace with hash -971300531, now seen corresponding path program 10 times [2024-11-09 23:23:30,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:23:30,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603967615] [2024-11-09 23:23:30,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:23:30,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:23:30,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:30,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:30,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:30,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:30,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:30,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:30,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:30,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:30,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:30,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:30,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:30,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:30,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:30,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:30,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:30,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:30,779 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-11-09 23:23:30,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:23:30,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603967615] [2024-11-09 23:23:30,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603967615] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:23:30,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372331079] [2024-11-09 23:23:30,780 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 23:23:30,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:23:30,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:23:30,782 INFO L229 MonitoredProcess]: Starting monitored process 11 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:23:30,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 23:23:30,998 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 23:23:30,998 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 23:23:30,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 23:23:31,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:23:31,065 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-11-09 23:23:31,065 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:23:35,381 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-09 23:23:35,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372331079] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:23:35,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:23:35,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 25] total 28 [2024-11-09 23:23:35,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866752874] [2024-11-09 23:23:35,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:23:35,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-09 23:23:35,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:23:35,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 23:23:35,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=558, Unknown=0, NotChecked=0, Total=756 [2024-11-09 23:23:35,384 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand has 28 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 28 states have internal predecessors, (56), 14 states have call successors, (14), 1 states have call predecessors, (14), 11 states have return successors, (32), 11 states have call predecessors, (32), 14 states have call successors, (32) [2024-11-09 23:23:35,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:23:35,498 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2024-11-09 23:23:35,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 23:23:35,499 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 28 states have internal predecessors, (56), 14 states have call successors, (14), 1 states have call predecessors, (14), 11 states have return successors, (32), 11 states have call predecessors, (32), 14 states have call successors, (32) Word has length 71 [2024-11-09 23:23:35,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:23:35,500 INFO L225 Difference]: With dead ends: 51 [2024-11-09 23:23:35,500 INFO L226 Difference]: Without dead ends: 46 [2024-11-09 23:23:35,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 139 SyntacticMatches, 11 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=448, Invalid=958, Unknown=0, NotChecked=0, Total=1406 [2024-11-09 23:23:35,501 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 47 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:23:35,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 111 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:23:35,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-09 23:23:35,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-09 23:23:35,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.032258064516129) internal successors, (32), 32 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 12 states have return successors, (13), 12 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 23:23:35,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2024-11-09 23:23:35,506 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 71 [2024-11-09 23:23:35,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:23:35,507 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2024-11-09 23:23:35,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 28 states have internal predecessors, (56), 14 states have call successors, (14), 1 states have call predecessors, (14), 11 states have return successors, (32), 11 states have call predecessors, (32), 14 states have call successors, (32) [2024-11-09 23:23:35,507 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2024-11-09 23:23:35,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-09 23:23:35,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:23:35,508 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:23:35,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-09 23:23:35,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-09 23:23:35,713 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:23:35,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:23:35,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1835662379, now seen corresponding path program 11 times [2024-11-09 23:23:35,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:23:35,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742137726] [2024-11-09 23:23:35,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:23:35,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:23:35,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:35,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:35,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:35,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:36,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:36,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:36,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:36,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:36,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:36,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:36,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:36,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:36,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:36,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:36,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:36,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:36,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:36,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:36,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:36,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:36,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:36,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:36,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:36,419 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-11-09 23:23:36,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:23:36,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742137726] [2024-11-09 23:23:36,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742137726] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:23:36,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912345265] [2024-11-09 23:23:36,421 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 23:23:36,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:23:36,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:23:36,422 INFO L229 MonitoredProcess]: Starting monitored process 12 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:23:36,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 23:23:36,712 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2024-11-09 23:23:36,713 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 23:23:36,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 23:23:36,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:23:36,792 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-11-09 23:23:36,792 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:23:42,399 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-09 23:23:42,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912345265] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:23:42,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:23:42,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 27] total 30 [2024-11-09 23:23:42,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147568991] [2024-11-09 23:23:42,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:23:42,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-09 23:23:42,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:23:42,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-09 23:23:42,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=643, Unknown=0, NotChecked=0, Total=870 [2024-11-09 23:23:42,402 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand has 30 states, 28 states have (on average 2.142857142857143) internal successors, (60), 30 states have internal predecessors, (60), 15 states have call successors, (15), 1 states have call predecessors, (15), 12 states have return successors, (35), 12 states have call predecessors, (35), 15 states have call successors, (35) [2024-11-09 23:23:42,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:23:42,533 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2024-11-09 23:23:42,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 23:23:42,533 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 2.142857142857143) internal successors, (60), 30 states have internal predecessors, (60), 15 states have call successors, (15), 1 states have call predecessors, (15), 12 states have return successors, (35), 12 states have call predecessors, (35), 15 states have call successors, (35) Word has length 77 [2024-11-09 23:23:42,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:23:42,534 INFO L225 Difference]: With dead ends: 54 [2024-11-09 23:23:42,534 INFO L226 Difference]: Without dead ends: 49 [2024-11-09 23:23:42,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 151 SyntacticMatches, 12 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 23:23:42,536 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 26 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:23:42,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 120 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:23:42,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-09 23:23:42,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-09 23:23:42,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 34 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 13 states have return successors, (14), 13 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 23:23:42,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2024-11-09 23:23:42,549 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 77 [2024-11-09 23:23:42,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:23:42,549 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2024-11-09 23:23:42,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 2.142857142857143) internal successors, (60), 30 states have internal predecessors, (60), 15 states have call successors, (15), 1 states have call predecessors, (15), 12 states have return successors, (35), 12 states have call predecessors, (35), 15 states have call successors, (35) [2024-11-09 23:23:42,549 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2024-11-09 23:23:42,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-09 23:23:42,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:23:42,550 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:23:42,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-09 23:23:42,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-09 23:23:42,754 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:23:42,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:23:42,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1357141875, now seen corresponding path program 12 times [2024-11-09 23:23:42,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:23:42,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547332317] [2024-11-09 23:23:42,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:23:42,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:23:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:42,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:42,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:42,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:43,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:43,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:43,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:43,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:43,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:43,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:43,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:43,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:43,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:43,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:43,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:43,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:43,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:43,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:43,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:43,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:43,702 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2024-11-09 23:23:43,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:23:43,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547332317] [2024-11-09 23:23:43,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547332317] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:23:43,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837199195] [2024-11-09 23:23:43,703 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-09 23:23:43,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:23:43,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:23:43,705 INFO L229 MonitoredProcess]: Starting monitored process 13 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:23:43,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 23:23:44,027 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2024-11-09 23:23:44,027 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 23:23:44,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 23:23:44,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:23:44,108 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2024-11-09 23:23:44,109 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:23:51,429 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-09 23:23:51,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837199195] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:23:51,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:23:51,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 29] total 32 [2024-11-09 23:23:51,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762852857] [2024-11-09 23:23:51,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:23:51,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-09 23:23:51,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:23:51,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-09 23:23:51,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=734, Unknown=0, NotChecked=0, Total=992 [2024-11-09 23:23:51,432 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand has 32 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 32 states have internal predecessors, (64), 16 states have call successors, (16), 1 states have call predecessors, (16), 13 states have return successors, (38), 13 states have call predecessors, (38), 16 states have call successors, (38) [2024-11-09 23:23:51,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:23:51,593 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2024-11-09 23:23:51,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 23:23:51,594 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 32 states have internal predecessors, (64), 16 states have call successors, (16), 1 states have call predecessors, (16), 13 states have return successors, (38), 13 states have call predecessors, (38), 16 states have call successors, (38) Word has length 83 [2024-11-09 23:23:51,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:23:51,594 INFO L225 Difference]: With dead ends: 57 [2024-11-09 23:23:51,597 INFO L226 Difference]: Without dead ends: 52 [2024-11-09 23:23:51,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 163 SyntacticMatches, 13 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=606, Invalid=1286, Unknown=0, NotChecked=0, Total=1892 [2024-11-09 23:23:51,598 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 85 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:23:51,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 125 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:23:51,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-09 23:23:51,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-09 23:23:51,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 36 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 14 states have return successors, (15), 14 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 23:23:51,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2024-11-09 23:23:51,609 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 83 [2024-11-09 23:23:51,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:23:51,609 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2024-11-09 23:23:51,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 32 states have internal predecessors, (64), 16 states have call successors, (16), 1 states have call predecessors, (16), 13 states have return successors, (38), 13 states have call predecessors, (38), 16 states have call successors, (38) [2024-11-09 23:23:51,609 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2024-11-09 23:23:51,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-09 23:23:51,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:23:51,610 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:23:51,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-09 23:23:51,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-09 23:23:51,811 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:23:51,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:23:51,811 INFO L85 PathProgramCache]: Analyzing trace with hash -392960789, now seen corresponding path program 13 times [2024-11-09 23:23:51,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:23:51,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254534568] [2024-11-09 23:23:51,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:23:51,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:23:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:51,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:51,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:52,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:52,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:52,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:52,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:52,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:52,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:52,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:52,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:52,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:52,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:52,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:52,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:52,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:52,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:52,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:52,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:52,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:52,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:52,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:52,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:23:52,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:52,738 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-09 23:23:52,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:23:52,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254534568] [2024-11-09 23:23:52,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254534568] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:23:52,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532605905] [2024-11-09 23:23:52,739 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-09 23:23:52,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:23:52,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:23:52,741 INFO L229 MonitoredProcess]: Starting monitored process 14 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:23:52,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-09 23:23:53,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:23:53,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 23:23:53,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:23:53,261 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-09 23:23:53,261 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:24:02,471 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-09 23:24:02,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532605905] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:24:02,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:24:02,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 31] total 34 [2024-11-09 23:24:02,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301075374] [2024-11-09 23:24:02,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:24:02,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-09 23:24:02,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:24:02,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-09 23:24:02,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=831, Unknown=0, NotChecked=0, Total=1122 [2024-11-09 23:24:02,474 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand has 34 states, 32 states have (on average 2.125) internal successors, (68), 34 states have internal predecessors, (68), 17 states have call successors, (17), 1 states have call predecessors, (17), 14 states have return successors, (41), 14 states have call predecessors, (41), 17 states have call successors, (41) [2024-11-09 23:24:02,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:24:02,632 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2024-11-09 23:24:02,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 23:24:02,633 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 2.125) internal successors, (68), 34 states have internal predecessors, (68), 17 states have call successors, (17), 1 states have call predecessors, (17), 14 states have return successors, (41), 14 states have call predecessors, (41), 17 states have call successors, (41) Word has length 89 [2024-11-09 23:24:02,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:24:02,633 INFO L225 Difference]: With dead ends: 60 [2024-11-09 23:24:02,633 INFO L226 Difference]: Without dead ends: 55 [2024-11-09 23:24:02,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 175 SyntacticMatches, 14 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=694, Invalid=1468, Unknown=0, NotChecked=0, Total=2162 [2024-11-09 23:24:02,635 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 66 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:24:02,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 124 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:24:02,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-09 23:24:02,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-09 23:24:02,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.027027027027027) internal successors, (38), 38 states have internal predecessors, (38), 2 states have call successors, (2), 1 states have call predecessors, (2), 15 states have return successors, (16), 15 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 23:24:02,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2024-11-09 23:24:02,639 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 89 [2024-11-09 23:24:02,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:24:02,640 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2024-11-09 23:24:02,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 2.125) internal successors, (68), 34 states have internal predecessors, (68), 17 states have call successors, (17), 1 states have call predecessors, (17), 14 states have return successors, (41), 14 states have call predecessors, (41), 17 states have call successors, (41) [2024-11-09 23:24:02,640 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2024-11-09 23:24:02,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-09 23:24:02,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:24:02,641 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:24:02,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-09 23:24:02,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-09 23:24:02,841 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:24:02,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:24:02,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1743044557, now seen corresponding path program 14 times [2024-11-09 23:24:02,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:24:02,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097142737] [2024-11-09 23:24:02,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:24:02,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:24:02,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:02,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:24:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:03,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:24:03,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:03,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:24:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:03,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:24:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:03,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:24:03,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:03,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:24:03,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:03,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:24:03,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:03,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:24:03,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:03,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:24:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:03,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:24:03,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:03,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:24:03,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:03,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:24:03,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:03,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:24:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:03,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:24:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:03,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 23:24:03,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:24:03,857 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2024-11-09 23:24:03,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:24:03,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097142737] [2024-11-09 23:24:03,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097142737] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:24:03,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571926090] [2024-11-09 23:24:03,858 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 23:24:03,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:24:03,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:24:03,859 INFO L229 MonitoredProcess]: Starting monitored process 15 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:24:03,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-09 23:24:04,377 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 23:24:04,377 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 23:24:04,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 23:24:04,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:24:04,478 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2024-11-09 23:24:04,479 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:24:15,744 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-09 23:24:15,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571926090] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:24:15,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:24:15,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 33] total 35 [2024-11-09 23:24:15,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084613316] [2024-11-09 23:24:15,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:24:15,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-09 23:24:15,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:24:15,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-09 23:24:15,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2024-11-09 23:24:15,746 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 35 states, 34 states have (on average 2.088235294117647) internal successors, (71), 35 states have internal predecessors, (71), 17 states have call successors, (17), 1 states have call predecessors, (17), 15 states have return successors, (43), 15 states have call predecessors, (43), 17 states have call successors, (43) [2024-11-09 23:24:15,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:24:15,922 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2024-11-09 23:24:15,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 23:24:15,923 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.088235294117647) internal successors, (71), 35 states have internal predecessors, (71), 17 states have call successors, (17), 1 states have call predecessors, (17), 15 states have return successors, (43), 15 states have call predecessors, (43), 17 states have call successors, (43) Word has length 95 [2024-11-09 23:24:15,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:24:15,924 INFO L225 Difference]: With dead ends: 63 [2024-11-09 23:24:15,924 INFO L226 Difference]: Without dead ends: 58 [2024-11-09 23:24:15,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 187 SyntacticMatches, 16 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=785, Invalid=1567, Unknown=0, NotChecked=0, Total=2352 [2024-11-09 23:24:15,925 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 105 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:24:15,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 130 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:24:15,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-09 23:24:15,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-09 23:24:15,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 40 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (17), 16 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-09 23:24:15,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2024-11-09 23:24:15,933 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 95 [2024-11-09 23:24:15,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:24:15,933 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2024-11-09 23:24:15,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.088235294117647) internal successors, (71), 35 states have internal predecessors, (71), 17 states have call successors, (17), 1 states have call predecessors, (17), 15 states have return successors, (43), 15 states have call predecessors, (43), 17 states have call successors, (43) [2024-11-09 23:24:15,937 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2024-11-09 23:24:15,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 23:24:15,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:24:15,937 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:24:15,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-09 23:24:16,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:24:16,139 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:24:16,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:24:16,139 INFO L85 PathProgramCache]: Analyzing trace with hash -132694613, now seen corresponding path program 15 times [2024-11-09 23:24:16,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:24:16,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220379326] [2024-11-09 23:24:16,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:24:16,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:24:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 23:24:16,167 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 23:24:16,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 23:24:16,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 23:24:16,217 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 23:24:16,218 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 23:24:16,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 23:24:16,222 INFO L407 BasicCegarLoop]: Path program histogram: [15, 1] [2024-11-09 23:24:16,275 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 23:24:16,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 11:24:16 BoogieIcfgContainer [2024-11-09 23:24:16,277 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 23:24:16,278 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 23:24:16,278 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 23:24:16,278 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 23:24:16,279 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:23:10" (3/4) ... [2024-11-09 23:24:16,279 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 23:24:16,336 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 23:24:16,337 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 23:24:16,337 INFO L158 Benchmark]: Toolchain (without parser) took 66230.43ms. Allocated memory was 132.1MB in the beginning and 677.4MB in the end (delta: 545.3MB). Free memory was 78.1MB in the beginning and 278.2MB in the end (delta: -200.1MB). Peak memory consumption was 346.7MB. Max. memory is 16.1GB. [2024-11-09 23:24:16,337 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 132.1MB. Free memory is still 104.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 23:24:16,338 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.61ms. Allocated memory is still 132.1MB. Free memory was 78.1MB in the beginning and 66.3MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 23:24:16,338 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.99ms. Allocated memory is still 132.1MB. Free memory was 66.3MB in the beginning and 65.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 23:24:16,338 INFO L158 Benchmark]: Boogie Preprocessor took 25.52ms. Allocated memory is still 132.1MB. Free memory was 64.6MB in the beginning and 63.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 23:24:16,338 INFO L158 Benchmark]: IcfgBuilder took 289.00ms. Allocated memory was 132.1MB in the beginning and 186.6MB in the end (delta: 54.5MB). Free memory was 63.4MB in the beginning and 149.7MB in the end (delta: -86.3MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2024-11-09 23:24:16,338 INFO L158 Benchmark]: TraceAbstraction took 65588.43ms. Allocated memory was 186.6MB in the beginning and 677.4MB in the end (delta: 490.7MB). Free memory was 148.7MB in the beginning and 281.3MB in the end (delta: -132.6MB). Peak memory consumption was 359.1MB. Max. memory is 16.1GB. [2024-11-09 23:24:16,339 INFO L158 Benchmark]: Witness Printer took 58.70ms. Allocated memory is still 677.4MB. Free memory was 281.3MB in the beginning and 278.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 23:24:16,340 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.18ms. Allocated memory is still 132.1MB. Free memory is still 104.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 238.61ms. Allocated memory is still 132.1MB. Free memory was 78.1MB in the beginning and 66.3MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.99ms. Allocated memory is still 132.1MB. Free memory was 66.3MB in the beginning and 65.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.52ms. Allocated memory is still 132.1MB. Free memory was 64.6MB in the beginning and 63.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 289.00ms. Allocated memory was 132.1MB in the beginning and 186.6MB in the end (delta: 54.5MB). Free memory was 63.4MB in the beginning and 149.7MB in the end (delta: -86.3MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. * TraceAbstraction took 65588.43ms. Allocated memory was 186.6MB in the beginning and 677.4MB in the end (delta: 490.7MB). Free memory was 148.7MB in the beginning and 281.3MB in the end (delta: -132.6MB). Peak memory consumption was 359.1MB. Max. memory is 16.1GB. * Witness Printer took 58.70ms. Allocated memory is still 677.4MB. Free memory was 281.3MB in the beginning and 278.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. 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 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L14] int a = 15; [L15] int b = 0; VAL [a=15, b=0] [L16] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=15] [L6] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=15, m=0, n=15] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=14] [L6] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=14, m=1, n=14] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=13] [L6] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=13, m=2, n=13] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=12] [L6] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=12, m=3, n=12] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=11] [L6] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=11, m=4, n=11] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=10] [L6] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=10, m=5, n=10] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=9] [L6] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=9, m=6, n=9] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=8] [L6] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=8, m=7, n=8] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=7] [L6] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=7, m=8, n=7] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=6] [L6] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=6, m=9, n=6] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=5] [L6] COND FALSE !(n <= 0) VAL [\old(m)=10, \old(n)=5, m=10, n=5] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=4] [L6] COND FALSE !(n <= 0) VAL [\old(m)=11, \old(n)=4, m=11, n=4] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=3] [L6] COND FALSE !(n <= 0) VAL [\old(m)=12, \old(n)=3, m=12, n=3] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=2] [L6] COND FALSE !(n <= 0) VAL [\old(m)=13, \old(n)=2, m=13, n=2] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=1] [L6] COND FALSE !(n <= 0) VAL [\old(m)=14, \old(n)=1, m=14, n=1] [L9] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=0] [L6] COND TRUE n <= 0 [L7] return m + n; VAL [\old(m)=15, \old(n)=0, \result=15] [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=1, m=14, n=1] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=2, m=13, n=2] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=3, m=12, n=3] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=4, m=11, n=4] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=5, m=10, n=5] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=6, m=9, n=6] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=7, m=8, n=7] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=8, m=7, n=8] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=9, m=6, n=9] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=10, m=5, n=10] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=11, m=4, n=11] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=12, m=3, n=12] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=13, m=2, n=13] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=14, m=1, n=14] [L9] return sum(n - 1, m + 1); [L9] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=15, m=0, n=15] [L9] return sum(n - 1, m + 1); [L16] RET, EXPR sum(a, b) VAL [a=15, b=0] [L16] int result = sum(a, b); [L17] COND TRUE result == a + b [L18] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 65.5s, OverallIterations: 16, TraceHistogramMax: 16, PathProgramHistogramMax: 15, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 797 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 647 mSDsluCounter, 1313 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1146 mSDsCounter, 234 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1014 IncrementalHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 234 mSolverCounterUnsat, 167 mSDtfsCounter, 1014 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2050 GetRequests, 1529 SyntacticMatches, 120 SemanticMatches, 401 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5366 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=15, InterpolantAutomatonStates: 180, 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, 15 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 57.7s InterpolantComputationTime, 1680 NumberOfCodeBlocks, 1680 NumberOfCodeBlocksAsserted, 81 NumberOfCheckSat, 2320 ConstructedInterpolants, 0 QuantifiedInterpolants, 6710 SizeOfPredicates, 105 NumberOfNonLiveVariables, 2576 ConjunctsInSsa, 266 ConjunctsInUnsatCore, 43 InterpolantComputations, 1 PerfectInterpolantSequences, 3710/9450 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-09 23:24:16,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE