./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_iter.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_iter.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 4cd641fa41c29ed0240eed782d3555502472fe8bb63d504547076d8eeefa2c0d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:11:38,473 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:11:38,556 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:11:38,561 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:11:38,561 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:11:38,584 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:11:38,585 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:11:38,585 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:11:38,585 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:11:38,587 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:11:38,587 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:11:38,587 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:11:38,588 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:11:38,589 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:11:38,590 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:11:38,590 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:11:38,590 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:11:38,590 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:11:38,590 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:11:38,591 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:11:38,591 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:11:38,593 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:11:38,593 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:11:38,594 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:11:38,594 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:11:38,594 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:11:38,594 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:11:38,594 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:11:38,595 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:11:38,595 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:11:38,595 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:11:38,595 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:11:38,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:11:38,595 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:11:38,596 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:11:38,596 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:11:38,596 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:11:38,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:11:38,596 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:11:38,597 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:11:38,597 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:11:38,598 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:11:38,598 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 -> 4cd641fa41c29ed0240eed782d3555502472fe8bb63d504547076d8eeefa2c0d [2024-10-12 19:11:38,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:11:38,845 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:11:38,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:11:38,848 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:11:38,849 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:11:38,850 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_iter.c [2024-10-12 19:11:40,113 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:11:40,287 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:11:40,288 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_iter.c [2024-10-12 19:11:40,294 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e643fcc64/aece4635b85b4708b75792af59c6037a/FLAG37ff900ca [2024-10-12 19:11:40,309 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e643fcc64/aece4635b85b4708b75792af59c6037a [2024-10-12 19:11:40,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:11:40,312 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:11:40,314 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:11:40,315 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:11:40,319 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:11:40,320 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:11:40" (1/1) ... [2024-10-12 19:11:40,321 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52361c52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:11:40, skipping insertion in model container [2024-10-12 19:11:40,321 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:11:40" (1/1) ... [2024-10-12 19:11:40,339 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:11:40,465 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_iter.c[526,539] [2024-10-12 19:11:40,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:11:40,511 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:11:40,520 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/verifythis/prefixsum_iter.c[526,539] [2024-10-12 19:11:40,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:11:40,556 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:11:40,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:11:40 WrapperNode [2024-10-12 19:11:40,557 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:11:40,558 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:11:40,558 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:11:40,558 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:11:40,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:11:40" (1/1) ... [2024-10-12 19:11:40,571 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:11:40" (1/1) ... [2024-10-12 19:11:40,594 INFO L138 Inliner]: procedures = 22, calls = 33, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 130 [2024-10-12 19:11:40,594 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:11:40,595 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:11:40,595 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:11:40,595 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:11:40,605 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:11:40" (1/1) ... [2024-10-12 19:11:40,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:11:40" (1/1) ... [2024-10-12 19:11:40,608 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:11:40" (1/1) ... [2024-10-12 19:11:40,625 INFO L175 MemorySlicer]: Split 16 memory accesses to 2 slices as follows [2, 14]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6]. [2024-10-12 19:11:40,626 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:11:40" (1/1) ... [2024-10-12 19:11:40,626 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:11:40" (1/1) ... [2024-10-12 19:11:40,632 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:11:40" (1/1) ... [2024-10-12 19:11:40,636 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:11:40" (1/1) ... [2024-10-12 19:11:40,637 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:11:40" (1/1) ... [2024-10-12 19:11:40,638 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:11:40" (1/1) ... [2024-10-12 19:11:40,639 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:11:40,641 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:11:40,641 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:11:40,641 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:11:40,642 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:11:40" (1/1) ... [2024-10-12 19:11:40,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:11:40,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:11:40,677 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-10-12 19:11:40,681 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-10-12 19:11:40,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:11:40,719 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-12 19:11:40,719 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-12 19:11:40,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:11:40,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 19:11:40,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 19:11:40,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 19:11:40,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-12 19:11:40,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:11:40,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:11:40,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 19:11:40,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 19:11:40,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2024-10-12 19:11:40,723 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2024-10-12 19:11:40,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 19:11:40,791 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:11:40,793 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:11:41,001 INFO L? ?]: Removed 46 outVars from TransFormulas that were not future-live. [2024-10-12 19:11:41,001 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:11:41,045 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:11:41,046 INFO L314 CfgBuilder]: Removed 7 assume(true) statements. [2024-10-12 19:11:41,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:11:41 BoogieIcfgContainer [2024-10-12 19:11:41,046 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:11:41,048 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:11:41,049 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:11:41,051 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:11:41,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:11:40" (1/3) ... [2024-10-12 19:11:41,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5edc80a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:11:41, skipping insertion in model container [2024-10-12 19:11:41,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:11:40" (2/3) ... [2024-10-12 19:11:41,053 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5edc80a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:11:41, skipping insertion in model container [2024-10-12 19:11:41,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:11:41" (3/3) ... [2024-10-12 19:11:41,054 INFO L112 eAbstractionObserver]: Analyzing ICFG prefixsum_iter.c [2024-10-12 19:11:41,068 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:11:41,069 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:11:41,121 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:11:41,128 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;@22ecd049, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:11:41,128 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:11:41,132 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 27 states have internal predecessors, (43), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-12 19:11:41,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-12 19:11:41,138 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:11:41,138 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:11:41,139 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:11:41,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:11:41,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1767624777, now seen corresponding path program 1 times [2024-10-12 19:11:41,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:11:41,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584824627] [2024-10-12 19:11:41,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:11:41,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:11:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:41,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:11:41,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:41,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:11:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:41,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:11:41,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:41,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 19:11:41,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:41,379 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 19:11:41,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:11:41,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584824627] [2024-10-12 19:11:41,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584824627] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:11:41,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:11:41,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 19:11:41,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950643677] [2024-10-12 19:11:41,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:11:41,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:11:41,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:11:41,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:11:41,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:11:41,422 INFO L87 Difference]: Start difference. First operand has 34 states, 26 states have (on average 1.6538461538461537) internal successors, (43), 27 states have internal predecessors, (43), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 19:11:41,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:11:41,491 INFO L93 Difference]: Finished difference Result 66 states and 101 transitions. [2024-10-12 19:11:41,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:11:41,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2024-10-12 19:11:41,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:11:41,499 INFO L225 Difference]: With dead ends: 66 [2024-10-12 19:11:41,500 INFO L226 Difference]: Without dead ends: 32 [2024-10-12 19:11:41,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 19:11:41,505 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 3 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:11:41,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 51 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:11:41,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-12 19:11:41,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-12 19:11:41,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-12 19:11:41,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2024-10-12 19:11:41,537 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 32 [2024-10-12 19:11:41,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:11:41,538 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-10-12 19:11:41,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-12 19:11:41,538 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2024-10-12 19:11:41,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-12 19:11:41,539 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:11:41,539 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:11:41,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 19:11:41,540 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:11:41,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:11:41,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1681595422, now seen corresponding path program 1 times [2024-10-12 19:11:41,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:11:41,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502180930] [2024-10-12 19:11:41,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:11:41,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:11:41,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:41,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:11:41,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:41,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:11:41,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:41,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:11:41,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:41,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 19:11:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:41,892 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 19:11:41,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:11:41,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502180930] [2024-10-12 19:11:41,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502180930] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:11:41,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:11:41,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:11:41,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760754900] [2024-10-12 19:11:41,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:11:41,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:11:41,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:11:41,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:11:41,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:11:41,896 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-12 19:11:41,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:11:41,992 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2024-10-12 19:11:41,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:11:41,993 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 32 [2024-10-12 19:11:41,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:11:41,994 INFO L225 Difference]: With dead ends: 50 [2024-10-12 19:11:41,994 INFO L226 Difference]: Without dead ends: 35 [2024-10-12 19:11:41,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:11:41,995 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 11 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:11:41,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 119 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:11:41,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-12 19:11:42,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2024-10-12 19:11:42,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-12 19:11:42,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2024-10-12 19:11:42,005 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 32 [2024-10-12 19:11:42,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:11:42,007 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2024-10-12 19:11:42,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-12 19:11:42,007 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2024-10-12 19:11:42,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-12 19:11:42,008 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:11:42,008 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:11:42,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 19:11:42,009 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:11:42,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:11:42,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1002806207, now seen corresponding path program 1 times [2024-10-12 19:11:42,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:11:42,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423087291] [2024-10-12 19:11:42,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:11:42,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:11:42,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:42,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:11:42,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:42,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:11:42,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:42,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:11:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:42,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 19:11:42,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:42,537 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 19:11:42,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:11:42,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423087291] [2024-10-12 19:11:42,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423087291] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:11:42,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513020669] [2024-10-12 19:11:42,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:11:42,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:11:42,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:11:42,541 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-10-12 19:11:42,542 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-10-12 19:11:42,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:42,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-12 19:11:42,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:11:42,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-12 19:11:42,813 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 19:11:42,814 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:11:42,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-10-12 19:11:42,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-10-12 19:11:42,913 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 19:11:42,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513020669] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:11:42,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:11:42,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 18 [2024-10-12 19:11:42,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379813626] [2024-10-12 19:11:42,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:11:42,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-12 19:11:42,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:11:42,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-12 19:11:42,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2024-10-12 19:11:42,917 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 18 states, 15 states have (on average 2.6) internal successors, (39), 16 states have internal predecessors, (39), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-12 19:11:43,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:11:43,208 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2024-10-12 19:11:43,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 19:11:43,208 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 2.6) internal successors, (39), 16 states have internal predecessors, (39), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 33 [2024-10-12 19:11:43,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:11:43,209 INFO L225 Difference]: With dead ends: 48 [2024-10-12 19:11:43,209 INFO L226 Difference]: Without dead ends: 46 [2024-10-12 19:11:43,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2024-10-12 19:11:43,210 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 61 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:11:43,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 206 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:11:43,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-12 19:11:43,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2024-10-12 19:11:43,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-12 19:11:43,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2024-10-12 19:11:43,216 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 33 [2024-10-12 19:11:43,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:11:43,216 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2024-10-12 19:11:43,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 2.6) internal successors, (39), 16 states have internal predecessors, (39), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-12 19:11:43,216 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2024-10-12 19:11:43,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-12 19:11:43,217 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:11:43,217 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:11:43,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 19:11:43,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:11:43,421 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:11:43,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:11:43,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1197667175, now seen corresponding path program 1 times [2024-10-12 19:11:43,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:11:43,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647593631] [2024-10-12 19:11:43,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:11:43,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:11:43,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:43,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:11:43,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:43,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:11:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:43,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:11:43,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:43,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 19:11:43,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:43,623 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 19:11:43,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:11:43,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647593631] [2024-10-12 19:11:43,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647593631] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:11:43,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992775036] [2024-10-12 19:11:43,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:11:43,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:11:43,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:11:43,625 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-10-12 19:11:43,626 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-10-12 19:11:43,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:43,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 19:11:43,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:11:43,781 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 19:11:43,781 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:11:43,849 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 19:11:43,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992775036] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:11:43,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:11:43,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 13 [2024-10-12 19:11:43,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855551194] [2024-10-12 19:11:43,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:11:43,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-12 19:11:43,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:11:43,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 19:11:43,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-12 19:11:43,851 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-12 19:11:43,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:11:43,949 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2024-10-12 19:11:43,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:11:43,950 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 36 [2024-10-12 19:11:43,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:11:43,951 INFO L225 Difference]: With dead ends: 56 [2024-10-12 19:11:43,951 INFO L226 Difference]: Without dead ends: 38 [2024-10-12 19:11:43,951 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-12 19:11:43,952 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 11 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:11:43,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 157 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:11:43,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-12 19:11:43,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2024-10-12 19:11:43,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-12 19:11:43,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2024-10-12 19:11:43,963 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 36 [2024-10-12 19:11:43,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:11:43,964 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2024-10-12 19:11:43,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 12 states have internal predecessors, (39), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-12 19:11:43,965 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2024-10-12 19:11:43,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-12 19:11:43,966 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:11:43,966 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:11:43,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 19:11:44,166 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,SelfDestructingSolverStorable3 [2024-10-12 19:11:44,167 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:11:44,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:11:44,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1045638214, now seen corresponding path program 2 times [2024-10-12 19:11:44,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:11:44,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102539759] [2024-10-12 19:11:44,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:11:44,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:11:44,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:44,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:11:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:44,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:11:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:44,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:11:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:44,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 19:11:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:44,321 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 19:11:44,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:11:44,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102539759] [2024-10-12 19:11:44,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102539759] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:11:44,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469806254] [2024-10-12 19:11:44,322 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 19:11:44,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:11:44,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:11:44,324 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-10-12 19:11:44,326 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-10-12 19:11:44,400 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 19:11:44,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 19:11:44,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 19:11:44,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:11:44,469 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-12 19:11:44,469 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:11:44,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469806254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:11:44,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:11:44,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2024-10-12 19:11:44,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815174626] [2024-10-12 19:11:44,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:11:44,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:11:44,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:11:44,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:11:44,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-10-12 19:11:44,471 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-12 19:11:44,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:11:44,523 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2024-10-12 19:11:44,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:11:44,524 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2024-10-12 19:11:44,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:11:44,525 INFO L225 Difference]: With dead ends: 53 [2024-10-12 19:11:44,525 INFO L226 Difference]: Without dead ends: 39 [2024-10-12 19:11:44,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-10-12 19:11:44,526 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 7 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:11:44,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 121 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:11:44,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-12 19:11:44,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2024-10-12 19:11:44,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-12 19:11:44,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2024-10-12 19:11:44,534 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 37 [2024-10-12 19:11:44,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:11:44,535 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2024-10-12 19:11:44,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-12 19:11:44,535 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2024-10-12 19:11:44,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-12 19:11:44,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:11:44,537 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:11:44,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 19:11:44,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:11:44,738 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:11:44,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:11:44,738 INFO L85 PathProgramCache]: Analyzing trace with hash -2052240841, now seen corresponding path program 1 times [2024-10-12 19:11:44,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:11:44,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430085178] [2024-10-12 19:11:44,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:11:44,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:11:44,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:44,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:11:44,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:44,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:11:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:44,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:11:44,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:44,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 19:11:44,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:44,893 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 19:11:44,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:11:44,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430085178] [2024-10-12 19:11:44,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430085178] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:11:44,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516944575] [2024-10-12 19:11:44,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:11:44,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:11:44,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:11:44,896 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-10-12 19:11:44,897 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-10-12 19:11:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:44,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 19:11:44,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:11:45,017 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 19:11:45,020 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:11:45,088 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 19:11:45,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516944575] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:11:45,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:11:45,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2024-10-12 19:11:45,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79964780] [2024-10-12 19:11:45,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:11:45,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-12 19:11:45,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:11:45,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-12 19:11:45,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-10-12 19:11:45,091 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-12 19:11:45,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:11:45,223 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2024-10-12 19:11:45,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 19:11:45,224 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2024-10-12 19:11:45,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:11:45,224 INFO L225 Difference]: With dead ends: 57 [2024-10-12 19:11:45,224 INFO L226 Difference]: Without dead ends: 42 [2024-10-12 19:11:45,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2024-10-12 19:11:45,225 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 57 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:11:45,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 127 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:11:45,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-12 19:11:45,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2024-10-12 19:11:45,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-12 19:11:45,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2024-10-12 19:11:45,234 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 40 [2024-10-12 19:11:45,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:11:45,235 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2024-10-12 19:11:45,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-12 19:11:45,236 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2024-10-12 19:11:45,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-10-12 19:11:45,236 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:11:45,237 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:11:45,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 19:11:45,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:11:45,437 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:11:45,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:11:45,440 INFO L85 PathProgramCache]: Analyzing trace with hash -104890547, now seen corresponding path program 1 times [2024-10-12 19:11:45,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:11:45,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105027510] [2024-10-12 19:11:45,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:11:45,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:11:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:45,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:11:45,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:45,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:11:45,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:45,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:11:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:45,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 19:11:45,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:45,513 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 19:11:45,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:11:45,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105027510] [2024-10-12 19:11:45,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105027510] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:11:45,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628212536] [2024-10-12 19:11:45,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:11:45,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:11:45,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:11:45,517 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-10-12 19:11:45,518 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-10-12 19:11:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:45,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 19:11:45,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:11:45,628 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 19:11:45,628 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:11:45,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628212536] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:11:45,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:11:45,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-10-12 19:11:45,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433395620] [2024-10-12 19:11:45,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:11:45,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:11:45,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:11:45,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:11:45,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:11:45,629 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-12 19:11:45,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:11:45,662 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2024-10-12 19:11:45,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:11:45,662 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2024-10-12 19:11:45,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:11:45,663 INFO L225 Difference]: With dead ends: 50 [2024-10-12 19:11:45,663 INFO L226 Difference]: Without dead ends: 42 [2024-10-12 19:11:45,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:11:45,664 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 6 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:11:45,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 79 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:11:45,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-12 19:11:45,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2024-10-12 19:11:45,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-12 19:11:45,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2024-10-12 19:11:45,668 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 41 [2024-10-12 19:11:45,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:11:45,669 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2024-10-12 19:11:45,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-12 19:11:45,669 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2024-10-12 19:11:45,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-12 19:11:45,669 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:11:45,669 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:11:45,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-12 19:11:45,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:11:45,870 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:11:45,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:11:45,870 INFO L85 PathProgramCache]: Analyzing trace with hash 525282697, now seen corresponding path program 1 times [2024-10-12 19:11:45,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:11:45,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010234249] [2024-10-12 19:11:45,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:11:45,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:11:45,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:45,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:11:45,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:45,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:11:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:45,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:11:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:45,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 19:11:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:45,988 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 19:11:45,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:11:45,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010234249] [2024-10-12 19:11:45,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010234249] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:11:45,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80718847] [2024-10-12 19:11:45,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:11:45,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:11:45,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:11:45,990 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-10-12 19:11:45,990 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-10-12 19:11:46,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:46,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 19:11:46,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:11:46,143 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 19:11:46,143 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:11:46,257 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 19:11:46,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80718847] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:11:46,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:11:46,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 13 [2024-10-12 19:11:46,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123273312] [2024-10-12 19:11:46,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:11:46,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-12 19:11:46,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:11:46,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 19:11:46,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-10-12 19:11:46,259 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-12 19:11:46,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:11:46,408 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2024-10-12 19:11:46,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 19:11:46,409 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2024-10-12 19:11:46,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:11:46,409 INFO L225 Difference]: With dead ends: 50 [2024-10-12 19:11:46,409 INFO L226 Difference]: Without dead ends: 42 [2024-10-12 19:11:46,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 86 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2024-10-12 19:11:46,410 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 22 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:11:46,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 174 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:11:46,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-12 19:11:46,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2024-10-12 19:11:46,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-12 19:11:46,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2024-10-12 19:11:46,422 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 44 [2024-10-12 19:11:46,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:11:46,422 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2024-10-12 19:11:46,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.923076923076923) internal successors, (38), 12 states have internal predecessors, (38), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-12 19:11:46,423 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2024-10-12 19:11:46,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-12 19:11:46,423 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:11:46,423 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:11:46,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-12 19:11:46,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:11:46,624 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:11:46,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:11:46,624 INFO L85 PathProgramCache]: Analyzing trace with hash -282333130, now seen corresponding path program 1 times [2024-10-12 19:11:46,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:11:46,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467797243] [2024-10-12 19:11:46,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:11:46,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:11:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:46,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:11:46,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:46,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:11:46,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:46,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:11:46,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:46,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 19:11:46,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:46,894 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 19:11:46,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:11:46,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467797243] [2024-10-12 19:11:46,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467797243] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:11:46,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513882195] [2024-10-12 19:11:46,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:11:46,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:11:46,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:11:46,898 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-10-12 19:11:46,899 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-10-12 19:11:46,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:11:46,985 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 92 conjuncts are in the unsatisfiable core [2024-10-12 19:11:46,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:11:46,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-12 19:11:47,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-10-12 19:11:47,088 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-10-12 19:11:47,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-10-12 19:11:47,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-10-12 19:11:47,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-10-12 19:11:47,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2024-10-12 19:11:47,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2024-10-12 19:11:47,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2024-10-12 19:11:47,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2024-10-12 19:11:47,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2024-10-12 19:11:47,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 73 [2024-10-12 19:11:47,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 77 [2024-10-12 19:11:47,951 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 19:11:47,952 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:12:11,682 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_upsweep_~a#1.offset_16| Int) (|v_ULTIMATE.start_upsweep_~left~0#1_29| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_221 Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int)) (or (let ((.cse8 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~a0~0#1.base| (store (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~a0~0#1.base|) (+ |ULTIMATE.start_main_~a0~0#1.offset| .cse8) (select (select |c_#memory_int#1| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| .cse8))) (+ |ULTIMATE.start_main_~a0~0#1.offset| 4 .cse8) v_ArrVal_221)))) (let ((.cse2 (store (let ((.cse7 (* |v_ULTIMATE.start_upsweep_~left~0#1_29| 4))) (let ((.cse5 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ |v_ULTIMATE.start_upsweep_~a#1.offset_16| 4 .cse7))) (store .cse5 .cse6 (+ (select .cse5 (+ |v_ULTIMATE.start_upsweep_~a#1.offset_16| .cse7)) (select .cse5 .cse6))))) (+ |ULTIMATE.start_main_~a~0#1.offset| 4 .cse8) 0)) (.cse3 (+ |ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse4 (select .cse2 .cse3))) (let ((.cse0 (+ .cse4 (select .cse2 |ULTIMATE.start_main_~a~0#1.offset|)))) (= .cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (store .cse2 .cse3 .cse0) |ULTIMATE.start_main_~a~0#1.offset| .cse4)) |c_ULTIMATE.start_main_~a0~0#1.base|) |ULTIMATE.start_main_~a0~0#1.offset|))))))) (< |v_ULTIMATE.start_upsweep_~a#1.offset_16| |ULTIMATE.start_main_~a~0#1.offset|) (< |v_ULTIMATE.start_upsweep_~left~0#1_29| 0))) is different from false [2024-10-12 19:12:47,054 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_upsweep_~a#1.offset_16| Int) (|v_ULTIMATE.start_upsweep_~left~0#1_29| Int) (|ULTIMATE.start_main_~a~0#1.offset| Int) (v_ArrVal_228 (Array Int Int)) (v_ArrVal_221 Int) (|ULTIMATE.start_main_~a0~0#1.offset| Int)) (or (let ((.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~malloc16#1.base| (store (store v_ArrVal_228 |ULTIMATE.start_main_~a0~0#1.offset| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~malloc16#1.base| v_ArrVal_228) |c_ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)) (+ |ULTIMATE.start_main_~a0~0#1.offset| 4) v_ArrVal_221)))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse0 (select .cse2 |ULTIMATE.start_main_~a~0#1.offset|))) (= .cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~a~0#1.base| (store (store (let ((.cse4 (* |v_ULTIMATE.start_upsweep_~left~0#1_29| 4))) (let ((.cse3 (+ |v_ULTIMATE.start_upsweep_~a#1.offset_16| 4 .cse4))) (store .cse2 .cse3 (+ (select .cse2 .cse3) (select .cse2 (+ |v_ULTIMATE.start_upsweep_~a#1.offset_16| .cse4)))))) (+ |ULTIMATE.start_main_~a~0#1.offset| 4) .cse0) |ULTIMATE.start_main_~a~0#1.offset| 0)) |c_ULTIMATE.start_main_#t~malloc16#1.base|) |ULTIMATE.start_main_~a0~0#1.offset|))))) (< |v_ULTIMATE.start_upsweep_~a#1.offset_16| |ULTIMATE.start_main_~a~0#1.offset|) (< |v_ULTIMATE.start_upsweep_~left~0#1_29| 0))) is different from false [2024-10-12 19:12:47,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513882195] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:12:47,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-12 19:12:47,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 23] total 29 [2024-10-12 19:12:47,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64188446] [2024-10-12 19:12:47,058 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-12 19:12:47,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-12 19:12:47,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:12:47,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-12 19:12:47,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1547, Unknown=9, NotChecked=162, Total=1892 [2024-10-12 19:12:47,059 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 29 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 26 states have internal predecessors, (61), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-12 19:12:50,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:12:50,444 INFO L93 Difference]: Finished difference Result 115 states and 148 transitions. [2024-10-12 19:12:50,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-12 19:12:50,444 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 26 states have internal predecessors, (61), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 45 [2024-10-12 19:12:50,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:12:50,446 INFO L225 Difference]: With dead ends: 115 [2024-10-12 19:12:50,446 INFO L226 Difference]: Without dead ends: 94 [2024-10-12 19:12:50,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 892 ImplicationChecksByTransitivity, 61.4s TimeCoverageRelationStatistics Valid=432, Invalid=4259, Unknown=9, NotChecked=270, Total=4970 [2024-10-12 19:12:50,447 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 99 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 19:12:50,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 273 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 19:12:50,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-12 19:12:50,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 69. [2024-10-12 19:12:50,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 59 states have internal predecessors, (74), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-12 19:12:50,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 88 transitions. [2024-10-12 19:12:50,466 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 88 transitions. Word has length 45 [2024-10-12 19:12:50,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:12:50,466 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 88 transitions. [2024-10-12 19:12:50,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 2.3461538461538463) internal successors, (61), 26 states have internal predecessors, (61), 4 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-10-12 19:12:50,466 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 88 transitions. [2024-10-12 19:12:50,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-12 19:12:50,467 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:12:50,467 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:12:50,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-12 19:12:50,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:12:50,672 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:12:50,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:12:50,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1561050569, now seen corresponding path program 2 times [2024-10-12 19:12:50,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:12:50,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386548625] [2024-10-12 19:12:50,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:12:50,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:12:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:12:50,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:12:50,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:12:50,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:12:50,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:12:50,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:12:50,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:12:50,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 19:12:50,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:12:50,931 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 19:12:50,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:12:50,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386548625] [2024-10-12 19:12:50,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386548625] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:12:50,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794334042] [2024-10-12 19:12:50,932 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 19:12:50,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:12:50,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:12:50,933 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-10-12 19:12:50,934 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-10-12 19:12:51,022 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 19:12:51,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 19:12:51,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-12 19:12:51,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:12:51,166 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 19:12:51,166 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:12:51,286 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 19:12:51,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794334042] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:12:51,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:12:51,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 18 [2024-10-12 19:12:51,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304338291] [2024-10-12 19:12:51,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:12:51,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-12 19:12:51,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:12:51,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-12 19:12:51,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-10-12 19:12:51,288 INFO L87 Difference]: Start difference. First operand 69 states and 88 transitions. Second operand has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 17 states have internal predecessors, (47), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-12 19:12:51,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:12:51,700 INFO L93 Difference]: Finished difference Result 104 states and 135 transitions. [2024-10-12 19:12:51,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 19:12:51,700 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 17 states have internal predecessors, (47), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 46 [2024-10-12 19:12:51,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:12:51,701 INFO L225 Difference]: With dead ends: 104 [2024-10-12 19:12:51,701 INFO L226 Difference]: Without dead ends: 85 [2024-10-12 19:12:51,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 90 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2024-10-12 19:12:51,701 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 31 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:12:51,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 284 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 19:12:51,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-12 19:12:51,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 70. [2024-10-12 19:12:51,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 60 states have (on average 1.25) internal successors, (75), 60 states have internal predecessors, (75), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-12 19:12:51,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2024-10-12 19:12:51,713 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 46 [2024-10-12 19:12:51,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:12:51,713 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2024-10-12 19:12:51,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 17 states have internal predecessors, (47), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-12 19:12:51,713 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2024-10-12 19:12:51,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-12 19:12:51,717 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:12:51,717 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:12:51,729 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-10-12 19:12:51,917 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,SelfDestructingSolverStorable9 [2024-10-12 19:12:51,917 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:12:51,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:12:51,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1845532929, now seen corresponding path program 3 times [2024-10-12 19:12:51,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:12:51,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783641161] [2024-10-12 19:12:51,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:12:51,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:12:51,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:12:52,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:12:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:12:52,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:12:52,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:12:52,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-12 19:12:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:12:52,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 19:12:52,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:12:52,084 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 19:12:52,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:12:52,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783641161] [2024-10-12 19:12:52,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783641161] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:12:52,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744826873] [2024-10-12 19:12:52,086 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 19:12:52,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:12:52,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:12:52,087 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-10-12 19:12:52,088 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-10-12 19:12:52,173 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-12 19:12:52,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 19:12:52,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-12 19:12:52,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:12:52,675 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-12 19:12:52,676 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:12:53,072 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-12 19:12:53,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744826873] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:12:53,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:12:53,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 28 [2024-10-12 19:12:53,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070462132] [2024-10-12 19:12:53,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:12:53,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-12 19:12:53,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:12:53,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-12 19:12:53,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=657, Unknown=0, NotChecked=0, Total=756 [2024-10-12 19:12:53,078 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand has 28 states, 26 states have (on average 3.423076923076923) internal successors, (89), 27 states have internal predecessors, (89), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 5 states have call successors, (10) [2024-10-12 19:12:54,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:12:54,199 INFO L93 Difference]: Finished difference Result 129 states and 170 transitions. [2024-10-12 19:12:54,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-12 19:12:54,200 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 3.423076923076923) internal successors, (89), 27 states have internal predecessors, (89), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 5 states have call successors, (10) Word has length 47 [2024-10-12 19:12:54,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:12:54,201 INFO L225 Difference]: With dead ends: 129 [2024-10-12 19:12:54,201 INFO L226 Difference]: Without dead ends: 114 [2024-10-12 19:12:54,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=245, Invalid=1647, Unknown=0, NotChecked=0, Total=1892 [2024-10-12 19:12:54,203 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 73 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 19:12:54,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 422 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 19:12:54,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-12 19:12:54,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 86. [2024-10-12 19:12:54,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 76 states have (on average 1.25) internal successors, (95), 76 states have internal predecessors, (95), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-12 19:12:54,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 109 transitions. [2024-10-12 19:12:54,227 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 109 transitions. Word has length 47 [2024-10-12 19:12:54,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:12:54,229 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 109 transitions. [2024-10-12 19:12:54,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 3.423076923076923) internal successors, (89), 27 states have internal predecessors, (89), 5 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 5 states have call successors, (10) [2024-10-12 19:12:54,229 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 109 transitions. [2024-10-12 19:12:54,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-12 19:12:54,230 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:12:54,230 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:12:54,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-12 19:12:54,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:12:54,431 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:12:54,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:12:54,432 INFO L85 PathProgramCache]: Analyzing trace with hash 308391347, now seen corresponding path program 1 times [2024-10-12 19:12:54,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:12:54,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28891877] [2024-10-12 19:12:54,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:12:54,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:12:54,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:12:54,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:12:54,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:12:54,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 19:12:54,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:12:54,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 19:12:54,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:12:54,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 19:12:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:12:54,628 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-12 19:12:54,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:12:54,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28891877] [2024-10-12 19:12:54,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28891877] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:12:54,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417589181] [2024-10-12 19:12:54,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:12:54,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:12:54,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:12:54,635 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-10-12 19:12:54,636 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-10-12 19:12:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:12:54,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 19:12:54,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:12:54,784 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-12 19:12:54,784 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:12:54,898 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-12 19:12:54,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417589181] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:12:54,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:12:54,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 10 [2024-10-12 19:12:54,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589142790] [2024-10-12 19:12:54,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:12:54,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 19:12:54,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:12:54,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 19:12:54,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:12:54,900 INFO L87 Difference]: Start difference. First operand 86 states and 109 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-12 19:12:55,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:12:55,054 INFO L93 Difference]: Finished difference Result 109 states and 137 transitions. [2024-10-12 19:12:55,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:12:55,054 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 49 [2024-10-12 19:12:55,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:12:55,056 INFO L225 Difference]: With dead ends: 109 [2024-10-12 19:12:55,056 INFO L226 Difference]: Without dead ends: 93 [2024-10-12 19:12:55,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:12:55,056 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 11 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:12:55,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 124 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:12:55,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-12 19:12:55,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 86. [2024-10-12 19:12:55,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 76 states have internal predecessors, (93), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-12 19:12:55,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 107 transitions. [2024-10-12 19:12:55,073 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 107 transitions. Word has length 49 [2024-10-12 19:12:55,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:12:55,073 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 107 transitions. [2024-10-12 19:12:55,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-12 19:12:55,073 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 107 transitions. [2024-10-12 19:12:55,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-12 19:12:55,073 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:12:55,074 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:12:55,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-12 19:12:55,274 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,SelfDestructingSolverStorable11 [2024-10-12 19:12:55,274 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:12:55,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:12:55,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1884320915, now seen corresponding path program 2 times [2024-10-12 19:12:55,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:12:55,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117244685] [2024-10-12 19:12:55,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:12:55,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:12:55,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:12:55,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:12:55,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:12:55,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 19:12:55,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:12:55,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 19:12:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:12:55,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 19:12:55,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:12:55,548 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-12 19:12:55,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:12:55,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117244685] [2024-10-12 19:12:55,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117244685] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:12:55,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248625533] [2024-10-12 19:12:55,549 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 19:12:55,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:12:55,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:12:55,551 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-10-12 19:12:55,551 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-10-12 19:12:55,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 19:12:55,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 19:12:55,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-12 19:12:55,694 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:12:55,968 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 19:12:55,968 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:12:56,246 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 19:12:56,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248625533] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:12:56,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:12:56,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 19 [2024-10-12 19:12:56,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709831111] [2024-10-12 19:12:56,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:12:56,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-12 19:12:56,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:12:56,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-12 19:12:56,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2024-10-12 19:12:56,247 INFO L87 Difference]: Start difference. First operand 86 states and 107 transitions. Second operand has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 18 states have internal predecessors, (67), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-12 19:12:56,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:12:56,599 INFO L93 Difference]: Finished difference Result 124 states and 153 transitions. [2024-10-12 19:12:56,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 19:12:56,599 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 18 states have internal predecessors, (67), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 49 [2024-10-12 19:12:56,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:12:56,600 INFO L225 Difference]: With dead ends: 124 [2024-10-12 19:12:56,600 INFO L226 Difference]: Without dead ends: 105 [2024-10-12 19:12:56,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2024-10-12 19:12:56,601 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 21 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:12:56,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 179 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 19:12:56,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-12 19:12:56,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2024-10-12 19:12:56,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 83 states have internal predecessors, (103), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-10-12 19:12:56,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 117 transitions. [2024-10-12 19:12:56,618 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 117 transitions. Word has length 49 [2024-10-12 19:12:56,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:12:56,619 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 117 transitions. [2024-10-12 19:12:56,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.526315789473684) internal successors, (67), 18 states have internal predecessors, (67), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-12 19:12:56,619 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 117 transitions. [2024-10-12 19:12:56,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-12 19:12:56,619 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:12:56,619 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:12:56,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-12 19:12:56,820 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,SelfDestructingSolverStorable12 [2024-10-12 19:12:56,820 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:12:56,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:12:56,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1299814628, now seen corresponding path program 3 times [2024-10-12 19:12:56,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:12:56,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076751673] [2024-10-12 19:12:56,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:12:56,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:12:56,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:12:56,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:12:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:12:56,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-12 19:12:56,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:12:56,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-12 19:12:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:12:56,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 19:12:56,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:12:56,960 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-12 19:12:56,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:12:56,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076751673] [2024-10-12 19:12:56,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076751673] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:12:56,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890802220] [2024-10-12 19:12:56,961 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-12 19:12:56,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:12:56,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:12:56,962 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-10-12 19:12:56,963 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-10-12 19:12:57,069 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-12 19:12:57,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 19:12:57,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 108 conjuncts are in the unsatisfiable core [2024-10-12 19:12:57,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:12:57,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-12 19:12:57,182 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-12 19:12:57,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-12 19:12:57,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2024-10-12 19:12:57,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2024-10-12 19:12:57,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2024-10-12 19:12:57,752 INFO L349 Elim1Store]: treesize reduction 40, result has 52.9 percent of original size [2024-10-12 19:12:57,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 47 treesize of output 70 [2024-10-12 19:12:58,786 INFO L349 Elim1Store]: treesize reduction 68, result has 49.3 percent of original size [2024-10-12 19:12:58,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 139 treesize of output 136 [2024-10-12 19:13:00,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 19:13:01,377 INFO L349 Elim1Store]: treesize reduction 337, result has 41.6 percent of original size [2024-10-12 19:13:01,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 3 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 32 case distinctions, treesize of input 213 treesize of output 341