./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array26_pattern.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/array-patterns/array26_pattern.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 56ad35a361c83538323b9be55683beef9c8271c8f67221c1a0924c8496da71d0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 14:56:09,012 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 14:56:09,069 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 14:56:09,073 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 14:56:09,074 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 14:56:09,095 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 14:56:09,096 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 14:56:09,096 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 14:56:09,097 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 14:56:09,097 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 14:56:09,098 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 14:56:09,098 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 14:56:09,098 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 14:56:09,099 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 14:56:09,099 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 14:56:09,100 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 14:56:09,100 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 14:56:09,100 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 14:56:09,101 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 14:56:09,101 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 14:56:09,101 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 14:56:09,104 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 14:56:09,105 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 14:56:09,105 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 14:56:09,108 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 14:56:09,109 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 14:56:09,109 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 14:56:09,109 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 14:56:09,109 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 14:56:09,110 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 14:56:09,110 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 14:56:09,110 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 14:56:09,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 14:56:09,110 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 14:56:09,111 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 14:56:09,111 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 14:56:09,111 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 14:56:09,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 14:56:09,112 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 14:56:09,112 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 14:56:09,112 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 14:56:09,112 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 14:56:09,112 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 -> 56ad35a361c83538323b9be55683beef9c8271c8f67221c1a0924c8496da71d0 [2024-10-12 14:56:09,384 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 14:56:09,408 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 14:56:09,411 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 14:56:09,412 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 14:56:09,412 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 14:56:09,413 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array26_pattern.c [2024-10-12 14:56:10,774 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 14:56:10,964 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 14:56:10,965 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array26_pattern.c [2024-10-12 14:56:10,971 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/364677be7/630a1c35b99546518978f1368113e941/FLAG87cb98931 [2024-10-12 14:56:11,348 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/364677be7/630a1c35b99546518978f1368113e941 [2024-10-12 14:56:11,350 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 14:56:11,351 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 14:56:11,352 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 14:56:11,352 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 14:56:11,358 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 14:56:11,359 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 02:56:11" (1/1) ... [2024-10-12 14:56:11,359 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@550df333 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 02:56:11, skipping insertion in model container [2024-10-12 14:56:11,360 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 02:56:11" (1/1) ... [2024-10-12 14:56:11,383 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 14:56:11,524 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/array-patterns/array26_pattern.c[1324,1337] [2024-10-12 14:56:11,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 14:56:11,549 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 14:56:11,560 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/array-patterns/array26_pattern.c[1324,1337] [2024-10-12 14:56:11,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 14:56:11,581 INFO L204 MainTranslator]: Completed translation [2024-10-12 14:56:11,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 02:56:11 WrapperNode [2024-10-12 14:56:11,582 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 14:56:11,583 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 14:56:11,584 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 14:56:11,584 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 14:56:11,590 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 02:56:11" (1/1) ... [2024-10-12 14:56:11,595 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 02:56:11" (1/1) ... [2024-10-12 14:56:11,612 INFO L138 Inliner]: procedures = 16, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 77 [2024-10-12 14:56:11,616 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 14:56:11,616 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 14:56:11,616 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 14:56:11,616 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 14:56:11,625 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 02:56:11" (1/1) ... [2024-10-12 14:56:11,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 02:56:11" (1/1) ... [2024-10-12 14:56:11,626 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 02:56:11" (1/1) ... [2024-10-12 14:56:11,637 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2024-10-12 14:56:11,637 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 02:56:11" (1/1) ... [2024-10-12 14:56:11,638 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 02:56:11" (1/1) ... [2024-10-12 14:56:11,642 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 02:56:11" (1/1) ... [2024-10-12 14:56:11,644 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 02:56:11" (1/1) ... [2024-10-12 14:56:11,645 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 02:56:11" (1/1) ... [2024-10-12 14:56:11,646 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 02:56:11" (1/1) ... [2024-10-12 14:56:11,648 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 14:56:11,649 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 14:56:11,649 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 14:56:11,649 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 14:56:11,650 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 02:56:11" (1/1) ... [2024-10-12 14:56:11,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 14:56:11,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 14:56:11,680 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 14:56:11,683 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 14:56:11,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 14:56:11,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 14:56:11,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 14:56:11,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-12 14:56:11,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-12 14:56:11,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-12 14:56:11,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 14:56:11,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 14:56:11,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-12 14:56:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-12 14:56:11,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-12 14:56:11,836 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 14:56:11,838 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 14:56:12,041 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-12 14:56:12,042 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 14:56:12,082 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 14:56:12,082 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-12 14:56:12,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 02:56:12 BoogieIcfgContainer [2024-10-12 14:56:12,083 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 14:56:12,086 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 14:56:12,087 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 14:56:12,090 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 14:56:12,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 02:56:11" (1/3) ... [2024-10-12 14:56:12,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@287943bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 02:56:12, skipping insertion in model container [2024-10-12 14:56:12,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 02:56:11" (2/3) ... [2024-10-12 14:56:12,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@287943bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 02:56:12, skipping insertion in model container [2024-10-12 14:56:12,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 02:56:12" (3/3) ... [2024-10-12 14:56:12,093 INFO L112 eAbstractionObserver]: Analyzing ICFG array26_pattern.c [2024-10-12 14:56:12,110 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 14:56:12,111 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 14:56:12,198 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 14:56:12,220 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;@49459dac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 14:56:12,220 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 14:56:12,225 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 18 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:56:12,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-12 14:56:12,232 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 14:56:12,233 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 14:56:12,234 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 14:56:12,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 14:56:12,238 INFO L85 PathProgramCache]: Analyzing trace with hash -222857167, now seen corresponding path program 1 times [2024-10-12 14:56:12,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 14:56:12,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861945337] [2024-10-12 14:56:12,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 14:56:12,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 14:56:12,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 14:56:12,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 14:56:12,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 14:56:12,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861945337] [2024-10-12 14:56:12,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861945337] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 14:56:12,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 14:56:12,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 14:56:12,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229926332] [2024-10-12 14:56:12,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 14:56:12,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 14:56:12,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 14:56:12,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 14:56:12,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 14:56:12,413 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 18 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:56:12,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 14:56:12,437 INFO L93 Difference]: Finished difference Result 36 states and 57 transitions. [2024-10-12 14:56:12,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 14:56:12,439 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-12 14:56:12,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 14:56:12,444 INFO L225 Difference]: With dead ends: 36 [2024-10-12 14:56:12,445 INFO L226 Difference]: Without dead ends: 17 [2024-10-12 14:56:12,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 14:56:12,450 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 14:56:12,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 14:56:12,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-10-12 14:56:12,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-10-12 14:56:12,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:56:12,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2024-10-12 14:56:12,474 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 9 [2024-10-12 14:56:12,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 14:56:12,474 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2024-10-12 14:56:12,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:56:12,474 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2024-10-12 14:56:12,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-12 14:56:12,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 14:56:12,475 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 14:56:12,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 14:56:12,475 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 14:56:12,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 14:56:12,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1833820021, now seen corresponding path program 1 times [2024-10-12 14:56:12,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 14:56:12,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625818692] [2024-10-12 14:56:12,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 14:56:12,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 14:56:12,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 14:56:12,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 14:56:12,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 14:56:12,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625818692] [2024-10-12 14:56:12,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625818692] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 14:56:12,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 14:56:12,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 14:56:12,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39139129] [2024-10-12 14:56:12,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 14:56:12,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 14:56:12,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 14:56:12,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 14:56:12,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 14:56:12,693 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:56:12,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 14:56:12,716 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2024-10-12 14:56:12,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 14:56:12,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-12 14:56:12,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 14:56:12,718 INFO L225 Difference]: With dead ends: 24 [2024-10-12 14:56:12,719 INFO L226 Difference]: Without dead ends: 20 [2024-10-12 14:56:12,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 14:56:12,721 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 12 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 14:56:12,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 44 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 14:56:12,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-12 14:56:12,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-12 14:56:12,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:56:12,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2024-10-12 14:56:12,729 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 9 [2024-10-12 14:56:12,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 14:56:12,730 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2024-10-12 14:56:12,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:56:12,730 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2024-10-12 14:56:12,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-12 14:56:12,731 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 14:56:12,731 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 14:56:12,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 14:56:12,731 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 14:56:12,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 14:56:12,732 INFO L85 PathProgramCache]: Analyzing trace with hash -313136650, now seen corresponding path program 1 times [2024-10-12 14:56:12,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 14:56:12,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003375787] [2024-10-12 14:56:12,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 14:56:12,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 14:56:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 14:56:12,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 14:56:12,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 14:56:12,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003375787] [2024-10-12 14:56:12,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003375787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 14:56:12,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 14:56:12,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 14:56:12,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142473932] [2024-10-12 14:56:12,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 14:56:12,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 14:56:12,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 14:56:12,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 14:56:12,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 14:56:12,893 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:56:12,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 14:56:12,965 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2024-10-12 14:56:12,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 14:56:12,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-12 14:56:12,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 14:56:12,968 INFO L225 Difference]: With dead ends: 50 [2024-10-12 14:56:12,968 INFO L226 Difference]: Without dead ends: 31 [2024-10-12 14:56:12,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 14:56:12,969 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 14:56:12,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 26 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 14:56:12,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-12 14:56:12,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2024-10-12 14:56:12,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:56:12,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2024-10-12 14:56:12,981 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 13 [2024-10-12 14:56:12,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 14:56:12,982 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2024-10-12 14:56:12,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:56:12,982 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2024-10-12 14:56:12,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-12 14:56:12,982 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 14:56:12,983 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 14:56:12,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 14:56:12,983 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 14:56:12,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 14:56:12,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1464759019, now seen corresponding path program 1 times [2024-10-12 14:56:12,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 14:56:12,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488933397] [2024-10-12 14:56:12,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 14:56:12,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 14:56:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 14:56:13,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 14:56:13,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 14:56:13,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488933397] [2024-10-12 14:56:13,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488933397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 14:56:13,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 14:56:13,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 14:56:13,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017280410] [2024-10-12 14:56:13,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 14:56:13,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 14:56:13,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 14:56:13,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 14:56:13,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 14:56:13,120 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:56:13,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 14:56:13,202 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2024-10-12 14:56:13,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 14:56:13,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-12 14:56:13,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 14:56:13,205 INFO L225 Difference]: With dead ends: 51 [2024-10-12 14:56:13,206 INFO L226 Difference]: Without dead ends: 30 [2024-10-12 14:56:13,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 14:56:13,209 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 14:56:13,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 23 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 14:56:13,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-12 14:56:13,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2024-10-12 14:56:13,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:56:13,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-10-12 14:56:13,221 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 16 [2024-10-12 14:56:13,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 14:56:13,221 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-10-12 14:56:13,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:56:13,221 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-10-12 14:56:13,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-12 14:56:13,222 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 14:56:13,222 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 14:56:13,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 14:56:13,225 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 14:56:13,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 14:56:13,225 INFO L85 PathProgramCache]: Analyzing trace with hash 642278233, now seen corresponding path program 1 times [2024-10-12 14:56:13,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 14:56:13,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105814863] [2024-10-12 14:56:13,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 14:56:13,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 14:56:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 14:56:13,407 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 14:56:13,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 14:56:13,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105814863] [2024-10-12 14:56:13,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105814863] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 14:56:13,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122275960] [2024-10-12 14:56:13,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 14:56:13,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 14:56:13,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 14:56:13,411 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 14:56:13,412 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 14:56:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 14:56:13,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-12 14:56:13,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 14:56:13,626 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 14:56:13,767 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 14:56:13,768 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 14:56:13,975 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 43 treesize of output 39 [2024-10-12 14:56:13,988 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 59 treesize of output 55 [2024-10-12 14:56:14,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 14:56:14,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122275960] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 14:56:14,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 14:56:14,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2024-10-12 14:56:14,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520378011] [2024-10-12 14:56:14,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 14:56:14,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-12 14:56:14,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 14:56:14,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-12 14:56:14,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-10-12 14:56:14,129 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:56:15,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 14:56:15,080 INFO L93 Difference]: Finished difference Result 83 states and 118 transitions. [2024-10-12 14:56:15,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-12 14:56:15,081 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-12 14:56:15,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 14:56:15,084 INFO L225 Difference]: With dead ends: 83 [2024-10-12 14:56:15,084 INFO L226 Difference]: Without dead ends: 67 [2024-10-12 14:56:15,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=289, Invalid=1043, Unknown=0, NotChecked=0, Total=1332 [2024-10-12 14:56:15,086 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 71 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 14:56:15,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 41 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 14:56:15,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-12 14:56:15,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 34. [2024-10-12 14:56:15,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:56:15,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2024-10-12 14:56:15,103 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 19 [2024-10-12 14:56:15,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 14:56:15,103 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2024-10-12 14:56:15,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:56:15,104 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2024-10-12 14:56:15,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-12 14:56:15,104 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 14:56:15,104 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 14:56:15,122 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 14:56:15,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 14:56:15,306 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 14:56:15,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 14:56:15,307 INFO L85 PathProgramCache]: Analyzing trace with hash 2056935433, now seen corresponding path program 2 times [2024-10-12 14:56:15,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 14:56:15,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053897636] [2024-10-12 14:56:15,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 14:56:15,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 14:56:15,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 14:56:15,431 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 14:56:15,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 14:56:15,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053897636] [2024-10-12 14:56:15,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053897636] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 14:56:15,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543239456] [2024-10-12 14:56:15,432 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 14:56:15,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 14:56:15,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 14:56:15,434 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 14:56:15,435 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 14:56:15,494 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 14:56:15,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 14:56:15,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 14:56:15,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 14:56:15,574 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 14:56:15,574 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 14:56:15,637 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 14:56:15,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543239456] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 14:56:15,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 14:56:15,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-10-12 14:56:15,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456290140] [2024-10-12 14:56:15,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 14:56:15,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-12 14:56:15,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 14:56:15,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-12 14:56:15,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-10-12 14:56:15,642 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:56:15,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 14:56:15,933 INFO L93 Difference]: Finished difference Result 96 states and 129 transitions. [2024-10-12 14:56:15,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 14:56:15,933 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-12 14:56:15,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 14:56:15,934 INFO L225 Difference]: With dead ends: 96 [2024-10-12 14:56:15,934 INFO L226 Difference]: Without dead ends: 74 [2024-10-12 14:56:15,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2024-10-12 14:56:15,935 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 47 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 14:56:15,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 45 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 14:56:15,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-12 14:56:15,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 58. [2024-10-12 14:56:15,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 57 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:56:15,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 75 transitions. [2024-10-12 14:56:15,949 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 75 transitions. Word has length 23 [2024-10-12 14:56:15,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 14:56:15,949 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 75 transitions. [2024-10-12 14:56:15,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 15 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:56:15,949 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 75 transitions. [2024-10-12 14:56:15,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-12 14:56:15,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 14:56:15,950 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 14:56:15,967 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 14:56:16,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-12 14:56:16,151 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 14:56:16,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 14:56:16,152 INFO L85 PathProgramCache]: Analyzing trace with hash -418090277, now seen corresponding path program 1 times [2024-10-12 14:56:16,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 14:56:16,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682260796] [2024-10-12 14:56:16,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 14:56:16,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 14:56:16,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 14:56:16,354 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-12 14:56:16,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 14:56:16,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682260796] [2024-10-12 14:56:16,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682260796] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 14:56:16,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50851477] [2024-10-12 14:56:16,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 14:56:16,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 14:56:16,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 14:56:16,358 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 14:56:16,360 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 14:56:16,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 14:56:16,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-12 14:56:16,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 14:56:16,470 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-12 14:56:16,471 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 14:56:16,660 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-12 14:56:16,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50851477] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 14:56:16,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 14:56:16,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 6] total 11 [2024-10-12 14:56:16,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218264391] [2024-10-12 14:56:16,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 14:56:16,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 14:56:16,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 14:56:16,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 14:56:16,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-12 14:56:16,663 INFO L87 Difference]: Start difference. First operand 58 states and 75 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:56:17,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 14:56:17,086 INFO L93 Difference]: Finished difference Result 201 states and 277 transitions. [2024-10-12 14:56:17,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-12 14:56:17,087 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-10-12 14:56:17,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 14:56:17,088 INFO L225 Difference]: With dead ends: 201 [2024-10-12 14:56:17,089 INFO L226 Difference]: Without dead ends: 149 [2024-10-12 14:56:17,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2024-10-12 14:56:17,091 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 113 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 14:56:17,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 34 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 14:56:17,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-10-12 14:56:17,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 118. [2024-10-12 14:56:17,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.3076923076923077) internal successors, (153), 117 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:56:17,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 153 transitions. [2024-10-12 14:56:17,126 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 153 transitions. Word has length 39 [2024-10-12 14:56:17,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 14:56:17,127 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 153 transitions. [2024-10-12 14:56:17,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 14:56:17,127 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 153 transitions. [2024-10-12 14:56:17,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-12 14:56:17,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 14:56:17,128 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 14:56:17,145 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 14:56:17,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 14:56:17,329 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 14:56:17,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 14:56:17,330 INFO L85 PathProgramCache]: Analyzing trace with hash 185659526, now seen corresponding path program 2 times [2024-10-12 14:56:17,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 14:56:17,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839989984] [2024-10-12 14:56:17,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 14:56:17,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 14:56:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-12 14:56:17,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [136446376] [2024-10-12 14:56:17,399 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-12 14:56:17,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 14:56:17,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 14:56:17,401 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 14:56:17,403 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 14:56:17,582 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-12 14:56:17,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-12 14:56:17,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-10-12 14:56:17,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 14:56:17,670 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 14:56:17,795 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 19 treesize of output 18 [2024-10-12 14:56:18,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 14:56:18,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 14:56:18,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 14:56:18,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2024-10-12 14:56:18,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 14:56:18,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 14:56:18,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 14:56:18,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 14:56:18,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 14:56:18,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 46 [2024-10-12 14:56:18,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 14:56:18,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 14:56:18,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 14:56:18,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-12 14:56:18,847 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 14:56:18,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 15 [2024-10-12 14:56:18,945 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 14:56:18,945 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 14:56:21,032 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 471 treesize of output 455 [2024-10-12 14:56:21,324 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-12 14:56:21,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 492851299 treesize of output 472928389 [2024-10-12 14:56:30,946 WARN L286 SmtUtils]: Spent 9.61s on a formula simplification. DAG size of input: 3974 DAG size of output: 1102 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)