./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-data/cart.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/heap-data/cart.i -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 85f7d1ed54d862786907cd1b4275170af31fb3969b21d7a2f2e5e352106544af --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 19:28:54,799 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 19:28:54,854 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 19:28:54,857 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 19:28:54,857 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 19:28:54,877 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 19:28:54,878 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 19:28:54,879 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 19:28:54,879 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 19:28:54,880 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 19:28:54,880 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 19:28:54,881 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 19:28:54,881 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 19:28:54,881 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 19:28:54,883 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 19:28:54,883 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 19:28:54,883 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 19:28:54,883 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 19:28:54,884 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 19:28:54,884 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 19:28:54,884 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 19:28:54,887 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 19:28:54,887 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 19:28:54,887 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 19:28:54,887 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 19:28:54,888 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 19:28:54,888 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 19:28:54,888 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 19:28:54,888 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 19:28:54,888 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 19:28:54,888 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 19:28:54,889 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 19:28:54,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 19:28:54,889 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 19:28:54,889 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 19:28:54,889 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 19:28:54,889 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 19:28:54,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 19:28:54,890 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 19:28:54,890 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 19:28:54,890 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 19:28:54,890 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 19:28:54,891 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 -> 85f7d1ed54d862786907cd1b4275170af31fb3969b21d7a2f2e5e352106544af [2024-11-11 19:28:55,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 19:28:55,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 19:28:55,107 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 19:28:55,108 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 19:28:55,108 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 19:28:55,109 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-data/cart.i [2024-11-11 19:28:56,308 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 19:28:56,493 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 19:28:56,494 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/cart.i [2024-11-11 19:28:56,502 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c07ec106b/a91db1a20f774236abcfdbeabddaed16/FLAGc038f4857 [2024-11-11 19:28:56,874 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c07ec106b/a91db1a20f774236abcfdbeabddaed16 [2024-11-11 19:28:56,876 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 19:28:56,877 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 19:28:56,877 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 19:28:56,878 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 19:28:56,882 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 19:28:56,882 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 07:28:56" (1/1) ... [2024-11-11 19:28:56,883 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@294a42d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:56, skipping insertion in model container [2024-11-11 19:28:56,883 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 07:28:56" (1/1) ... [2024-11-11 19:28:56,912 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 19:28:57,142 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/cart.i[23713,23726] [2024-11-11 19:28:57,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 19:28:57,152 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 19:28:57,191 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-data/cart.i[23713,23726] [2024-11-11 19:28:57,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 19:28:57,219 INFO L204 MainTranslator]: Completed translation [2024-11-11 19:28:57,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:57 WrapperNode [2024-11-11 19:28:57,219 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 19:28:57,220 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 19:28:57,220 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 19:28:57,220 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 19:28:57,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:57" (1/1) ... [2024-11-11 19:28:57,235 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:57" (1/1) ... [2024-11-11 19:28:57,249 INFO L138 Inliner]: procedures = 121, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 81 [2024-11-11 19:28:57,250 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 19:28:57,250 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 19:28:57,250 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 19:28:57,250 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 19:28:57,259 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:57" (1/1) ... [2024-11-11 19:28:57,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:57" (1/1) ... [2024-11-11 19:28:57,261 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:57" (1/1) ... [2024-11-11 19:28:57,273 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 7, 11]. 55 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0]. The 5 writes are split as follows [0, 0, 5]. [2024-11-11 19:28:57,273 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:57" (1/1) ... [2024-11-11 19:28:57,273 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:57" (1/1) ... [2024-11-11 19:28:57,279 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:57" (1/1) ... [2024-11-11 19:28:57,281 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:57" (1/1) ... [2024-11-11 19:28:57,282 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:57" (1/1) ... [2024-11-11 19:28:57,283 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:57" (1/1) ... [2024-11-11 19:28:57,285 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 19:28:57,285 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 19:28:57,285 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 19:28:57,286 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 19:28:57,286 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:57" (1/1) ... [2024-11-11 19:28:57,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 19:28:57,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:28:57,314 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 19:28:57,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 19:28:57,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-11 19:28:57,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-11 19:28:57,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-11 19:28:57,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-11 19:28:57,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-11 19:28:57,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-11 19:28:57,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-11 19:28:57,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 19:28:57,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-11 19:28:57,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-11 19:28:57,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-11 19:28:57,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-11 19:28:57,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-11 19:28:57,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-11 19:28:57,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 19:28:57,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 19:28:57,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-11 19:28:57,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 19:28:57,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 19:28:57,461 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 19:28:57,463 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 19:28:57,601 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-11 19:28:57,601 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 19:28:57,613 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 19:28:57,613 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-11 19:28:57,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:28:57 BoogieIcfgContainer [2024-11-11 19:28:57,614 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 19:28:57,616 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 19:28:57,616 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 19:28:57,620 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 19:28:57,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 07:28:56" (1/3) ... [2024-11-11 19:28:57,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@608ef993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 07:28:57, skipping insertion in model container [2024-11-11 19:28:57,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:28:57" (2/3) ... [2024-11-11 19:28:57,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@608ef993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 07:28:57, skipping insertion in model container [2024-11-11 19:28:57,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:28:57" (3/3) ... [2024-11-11 19:28:57,623 INFO L112 eAbstractionObserver]: Analyzing ICFG cart.i [2024-11-11 19:28:57,637 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 19:28:57,638 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 19:28:57,692 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 19:28:57,699 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;@3b0fddf2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 19:28:57,699 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 19:28:57,704 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:57,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-11 19:28:57,710 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:28:57,711 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:28:57,711 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:28:57,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:28:57,717 INFO L85 PathProgramCache]: Analyzing trace with hash -680841488, now seen corresponding path program 1 times [2024-11-11 19:28:57,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:28:57,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61702422] [2024-11-11 19:28:57,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:28:57,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:28:57,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:57,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:28:57,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:28:57,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61702422] [2024-11-11 19:28:57,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61702422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:28:57,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:28:57,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 19:28:57,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972379437] [2024-11-11 19:28:57,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:28:57,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 19:28:57,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:28:57,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 19:28:57,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 19:28:57,883 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 19 states have internal predecessors, (29), 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-11-11 19:28:57,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:28:57,893 INFO L93 Difference]: Finished difference Result 34 states and 49 transitions. [2024-11-11 19:28:57,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 19:28:57,895 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-11-11 19:28:57,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:28:57,899 INFO L225 Difference]: With dead ends: 34 [2024-11-11 19:28:57,900 INFO L226 Difference]: Without dead ends: 17 [2024-11-11 19:28:57,902 INFO L434 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-11-11 19:28:57,904 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:28:57,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:28:57,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-11 19:28:57,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-11 19:28:57,927 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-11-11 19:28:57,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2024-11-11 19:28:57,928 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 9 [2024-11-11 19:28:57,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:28:57,928 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2024-11-11 19:28:57,929 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-11-11 19:28:57,929 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2024-11-11 19:28:57,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-11 19:28:57,929 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:28:57,929 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:28:57,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 19:28:57,930 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:28:57,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:28:57,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1910225148, now seen corresponding path program 1 times [2024-11-11 19:28:57,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:28:57,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147167492] [2024-11-11 19:28:57,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:28:57,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:28:57,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:58,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:28:58,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:28:58,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147167492] [2024-11-11 19:28:58,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147167492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:28:58,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:28:58,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 19:28:58,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658452717] [2024-11-11 19:28:58,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:28:58,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 19:28:58,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:28:58,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 19:28:58,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 19:28:58,093 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:58,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:28:58,156 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2024-11-11 19:28:58,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 19:28:58,156 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2024-11-11 19:28:58,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:28:58,157 INFO L225 Difference]: With dead ends: 36 [2024-11-11 19:28:58,157 INFO L226 Difference]: Without dead ends: 21 [2024-11-11 19:28:58,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-11 19:28:58,160 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 3 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:28:58,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 48 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:28:58,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-11 19:28:58,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-11 19:28:58,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:58,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2024-11-11 19:28:58,167 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 12 [2024-11-11 19:28:58,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:28:58,167 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2024-11-11 19:28:58,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:58,168 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2024-11-11 19:28:58,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-11 19:28:58,169 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:28:58,169 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:28:58,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 19:28:58,169 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:28:58,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:28:58,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1849394690, now seen corresponding path program 1 times [2024-11-11 19:28:58,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:28:58,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631349064] [2024-11-11 19:28:58,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:28:58,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:28:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:58,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:28:58,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:28:58,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631349064] [2024-11-11 19:28:58,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631349064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:28:58,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:28:58,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 19:28:58,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481920167] [2024-11-11 19:28:58,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:28:58,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 19:28:58,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:28:58,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 19:28:58,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 19:28:58,287 INFO L87 Difference]: Start difference. First operand 21 states and 27 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-11-11 19:28:58,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:28:58,322 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2024-11-11 19:28:58,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 19:28:58,323 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-11-11 19:28:58,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:28:58,323 INFO L225 Difference]: With dead ends: 31 [2024-11-11 19:28:58,323 INFO L226 Difference]: Without dead ends: 25 [2024-11-11 19:28:58,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-11-11 19:28:58,324 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 14 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:28:58,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 47 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:28:58,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-11 19:28:58,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-11 19:28:58,327 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-11-11 19:28:58,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2024-11-11 19:28:58,328 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 16 [2024-11-11 19:28:58,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:28:58,328 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2024-11-11 19:28:58,328 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-11-11 19:28:58,328 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2024-11-11 19:28:58,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-11 19:28:58,329 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:28:58,329 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:28:58,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 19:28:58,329 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:28:58,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:28:58,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1690179633, now seen corresponding path program 1 times [2024-11-11 19:28:58,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:28:58,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548702629] [2024-11-11 19:28:58,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:28:58,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:28:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:58,400 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 19:28:58,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:28:58,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548702629] [2024-11-11 19:28:58,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548702629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:28:58,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:28:58,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 19:28:58,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310149236] [2024-11-11 19:28:58,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:28:58,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 19:28:58,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:28:58,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 19:28:58,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 19:28:58,403 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:58,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:28:58,416 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2024-11-11 19:28:58,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 19:28:58,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 20 [2024-11-11 19:28:58,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:28:58,418 INFO L225 Difference]: With dead ends: 37 [2024-11-11 19:28:58,418 INFO L226 Difference]: Without dead ends: 27 [2024-11-11 19:28:58,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 19:28:58,419 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:28:58,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:28:58,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-11 19:28:58,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-11 19:28:58,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:58,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2024-11-11 19:28:58,424 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 20 [2024-11-11 19:28:58,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:28:58,424 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2024-11-11 19:28:58,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:58,425 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2024-11-11 19:28:58,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-11 19:28:58,426 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:28:58,426 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:28:58,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 19:28:58,427 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:28:58,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:28:58,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1795441037, now seen corresponding path program 1 times [2024-11-11 19:28:58,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:28:58,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978874664] [2024-11-11 19:28:58,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:28:58,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:28:58,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:58,915 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:28:58,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:28:58,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978874664] [2024-11-11 19:28:58,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978874664] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:28:58,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024272558] [2024-11-11 19:28:58,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:28:58,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:28:58,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:28:58,919 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:28:58,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 19:28:59,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:28:59,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-11 19:28:59,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:28:59,159 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 45 treesize of output 15 [2024-11-11 19:28:59,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:28:59,188 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 1 case distinctions, treesize of input 26 treesize of output 10 [2024-11-11 19:28:59,192 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:28:59,192 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:28:59,306 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-11 19:28:59,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1596 treesize of output 1405 [2024-11-11 19:28:59,455 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 19:28:59,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024272558] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:28:59,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:28:59,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 12 [2024-11-11 19:28:59,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157514109] [2024-11-11 19:28:59,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:28:59,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 19:28:59,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:28:59,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 19:28:59,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-11 19:28:59,458 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:59,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:28:59,670 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2024-11-11 19:28:59,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 19:28:59,670 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 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 20 [2024-11-11 19:28:59,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:28:59,671 INFO L225 Difference]: With dead ends: 38 [2024-11-11 19:28:59,671 INFO L226 Difference]: Without dead ends: 36 [2024-11-11 19:28:59,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-11 19:28:59,673 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 35 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:28:59,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 126 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:28:59,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-11 19:28:59,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2024-11-11 19:28:59,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:59,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2024-11-11 19:28:59,680 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 20 [2024-11-11 19:28:59,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:28:59,681 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2024-11-11 19:28:59,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:28:59,681 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2024-11-11 19:28:59,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-11 19:28:59,681 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:28:59,681 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:28:59,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 19:28:59,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:28:59,882 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:28:59,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:28:59,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1534874359, now seen corresponding path program 1 times [2024-11-11 19:28:59,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:28:59,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702837483] [2024-11-11 19:28:59,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:28:59,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:28:59,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:29:00,023 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 19:29:00,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:29:00,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702837483] [2024-11-11 19:29:00,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702837483] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:29:00,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213082867] [2024-11-11 19:29:00,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:29:00,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:29:00,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:29:00,026 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:29:00,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 19:29:00,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:29:00,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-11 19:29:00,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:29:00,154 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 8 treesize of output 1 [2024-11-11 19:29:00,162 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 8 treesize of output 1 [2024-11-11 19:29:00,231 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:29:00,231 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:29:00,294 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 33 treesize of output 29 [2024-11-11 19:29:00,302 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:00,302 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 36 treesize of output 40 [2024-11-11 19:29:00,307 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 39 treesize of output 35 [2024-11-11 19:29:00,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:00,316 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 42 treesize of output 46 [2024-11-11 19:29:00,343 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 19:29:00,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213082867] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:29:00,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:29:00,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 13 [2024-11-11 19:29:00,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292053474] [2024-11-11 19:29:00,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:29:00,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-11 19:29:00,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:29:00,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-11 19:29:00,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-11 19:29:00,346 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:29:00,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:29:00,468 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2024-11-11 19:29:00,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 19:29:00,469 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 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-11-11 19:29:00,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:29:00,469 INFO L225 Difference]: With dead ends: 49 [2024-11-11 19:29:00,469 INFO L226 Difference]: Without dead ends: 39 [2024-11-11 19:29:00,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2024-11-11 19:29:00,471 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 36 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:29:00,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 127 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:29:00,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-11 19:29:00,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2024-11-11 19:29:00,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 35 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:29:00,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2024-11-11 19:29:00,477 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 23 [2024-11-11 19:29:00,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:29:00,478 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2024-11-11 19:29:00,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:29:00,478 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2024-11-11 19:29:00,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-11 19:29:00,479 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:29:00,480 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:29:00,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 19:29:00,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-11 19:29:00,681 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:29:00,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:29:00,681 INFO L85 PathProgramCache]: Analyzing trace with hash 379469720, now seen corresponding path program 2 times [2024-11-11 19:29:00,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:29:00,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685784436] [2024-11-11 19:29:00,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:29:00,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:29:00,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:29:00,917 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:29:00,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:29:00,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685784436] [2024-11-11 19:29:00,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685784436] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:29:00,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090940810] [2024-11-11 19:29:00,918 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 19:29:00,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:29:00,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:29:00,921 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:29:00,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 19:29:00,998 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 19:29:00,998 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 19:29:01,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-11 19:29:01,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:29:01,020 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-11-11 19:29:01,024 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-11-11 19:29:01,079 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 18 treesize of output 14 [2024-11-11 19:29:01,092 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:29:01,092 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:29:01,155 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:29:01,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090940810] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:29:01,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:29:01,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-11-11 19:29:01,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62205524] [2024-11-11 19:29:01,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:29:01,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 19:29:01,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:29:01,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 19:29:01,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-11 19:29:01,158 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:29:01,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:29:01,260 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2024-11-11 19:29:01,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 19:29:01,260 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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 24 [2024-11-11 19:29:01,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:29:01,261 INFO L225 Difference]: With dead ends: 67 [2024-11-11 19:29:01,261 INFO L226 Difference]: Without dead ends: 40 [2024-11-11 19:29:01,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-11 19:29:01,262 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:29:01,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 134 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:29:01,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-11 19:29:01,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-11 19:29:01,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 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-11-11 19:29:01,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2024-11-11 19:29:01,269 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 24 [2024-11-11 19:29:01,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:29:01,269 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2024-11-11 19:29:01,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:29:01,272 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2024-11-11 19:29:01,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-11 19:29:01,272 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:29:01,272 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:29:01,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 19:29:01,473 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-11-11 19:29:01,473 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:29:01,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:29:01,474 INFO L85 PathProgramCache]: Analyzing trace with hash -3886178, now seen corresponding path program 3 times [2024-11-11 19:29:01,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:29:01,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702373744] [2024-11-11 19:29:01,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:29:01,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:29:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:29:02,009 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:29:02,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:29:02,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702373744] [2024-11-11 19:29:02,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702373744] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:29:02,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654437763] [2024-11-11 19:29:02,010 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-11 19:29:02,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:29:02,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:29:02,015 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:29:02,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 19:29:02,110 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-11 19:29:02,110 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 19:29:02,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-11 19:29:02,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:29:02,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-11-11 19:29:02,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 15 [2024-11-11 19:29:02,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-11 19:29:02,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-11-11 19:29:02,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 48 [2024-11-11 19:29:02,311 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:02,311 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2024-11-11 19:29:02,322 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-11 19:29:02,322 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 1 case distinctions, treesize of input 20 treesize of output 17 [2024-11-11 19:29:02,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 26 treesize of output 10 [2024-11-11 19:29:02,412 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:29:02,413 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:29:02,514 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 38 treesize of output 28 [2024-11-11 19:29:02,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:02,524 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 86 treesize of output 84 [2024-11-11 19:29:02,580 WARN L851 $PredicateComparison]: unable to prove that (or (let ((.cse4 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4)) (.cse8 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 8)) (.cse2 (+ |c_ULTIMATE.start_main_~l~0#1.offset| 4)) (.cse3 (store .cse8 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|) |c_ULTIMATE.start_main_~order~0#1|)) (.cse5 (select .cse8 .cse4))) (and (forall ((v_ArrVal_380 Int)) (or (forall ((v_ArrVal_386 (Array Int Int)) (v_arrayElimCell_23 Int)) (or (let ((.cse0 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_main_~i~0#1.base| (store .cse3 .cse4 v_ArrVal_380)) v_arrayElimCell_23 v_ArrVal_386) |c_ULTIMATE.start_main_~l~0#1.base|))) (< (select .cse0 .cse1) (+ (select .cse0 .cse2) 1))) (= |c_ULTIMATE.start_main_~i~0#1.base| v_arrayElimCell_23))) (< v_ArrVal_380 .cse5))) (forall ((v_ArrVal_380 Int)) (or (forall ((v_ArrVal_386 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_main_~i~0#1.base| (store .cse3 .cse4 v_ArrVal_380)) 0 v_ArrVal_386) |c_ULTIMATE.start_main_~l~0#1.base|))) (< (select .cse6 .cse1) (+ (select .cse6 .cse2) 1)))) (< v_ArrVal_380 .cse5))) (or (forall ((v_ArrVal_380 Int) (v_ArrVal_386 (Array Int Int)) (v_arrayElimCell_23 Int)) (or (let ((.cse7 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_main_~i~0#1.base| (store .cse3 .cse4 v_ArrVal_380)) v_arrayElimCell_23 v_ArrVal_386) |c_ULTIMATE.start_main_~l~0#1.base|))) (< (select .cse7 .cse1) (+ (select .cse7 .cse2) 1))) (< v_ArrVal_380 .cse5))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base|) |c_ULTIMATE.start_main_~i~0#1.offset|) |c_ULTIMATE.start_main_~i~0#1.offset|))))) |c_ULTIMATE.start_main_#t~short8#1|) is different from false [2024-11-11 19:29:02,612 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:02,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 210 treesize of output 183 [2024-11-11 19:29:02,646 INFO L349 Elim1Store]: treesize reduction 35, result has 36.4 percent of original size [2024-11-11 19:29:02,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 186 treesize of output 184 [2024-11-11 19:29:02,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:02,658 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 116 treesize of output 108 [2024-11-11 19:29:02,679 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:02,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 319 treesize of output 309 [2024-11-11 19:29:02,707 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:02,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 175 treesize of output 195 [2024-11-11 19:29:02,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 150 treesize of output 134 [2024-11-11 19:29:02,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 134 treesize of output 126 [2024-11-11 19:29:02,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 3 [2024-11-11 19:29:02,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 47 treesize of output 39 [2024-11-11 19:29:02,977 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:02,978 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 34 treesize of output 26 [2024-11-11 19:29:03,053 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-11 19:29:03,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654437763] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:29:03,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:29:03,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 25 [2024-11-11 19:29:03,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522963219] [2024-11-11 19:29:03,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:29:03,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-11 19:29:03,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:29:03,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-11 19:29:03,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=457, Unknown=1, NotChecked=44, Total=600 [2024-11-11 19:29:03,055 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. Second operand has 25 states, 25 states have (on average 2.64) internal successors, (66), 25 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:29:03,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:29:03,363 INFO L93 Difference]: Finished difference Result 55 states and 71 transitions. [2024-11-11 19:29:03,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 19:29:03,364 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.64) internal successors, (66), 25 states have internal predecessors, (66), 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 28 [2024-11-11 19:29:03,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:29:03,364 INFO L225 Difference]: With dead ends: 55 [2024-11-11 19:29:03,364 INFO L226 Difference]: Without dead ends: 50 [2024-11-11 19:29:03,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=189, Invalid=684, Unknown=1, NotChecked=56, Total=930 [2024-11-11 19:29:03,365 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 102 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 19:29:03,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 237 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 181 Invalid, 0 Unknown, 50 Unchecked, 0.2s Time] [2024-11-11 19:29:03,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-11 19:29:03,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2024-11-11 19:29:03,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 48 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:29:03,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2024-11-11 19:29:03,372 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 64 transitions. Word has length 28 [2024-11-11 19:29:03,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:29:03,372 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 64 transitions. [2024-11-11 19:29:03,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.64) internal successors, (66), 25 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:29:03,372 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2024-11-11 19:29:03,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-11 19:29:03,374 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:29:03,374 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:29:03,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-11 19:29:03,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:29:03,575 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:29:03,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:29:03,575 INFO L85 PathProgramCache]: Analyzing trace with hash 194884952, now seen corresponding path program 2 times [2024-11-11 19:29:03,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:29:03,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694679128] [2024-11-11 19:29:03,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:29:03,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:29:03,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:29:04,097 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:29:04,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:29:04,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694679128] [2024-11-11 19:29:04,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694679128] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:29:04,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467652328] [2024-11-11 19:29:04,098 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 19:29:04,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:29:04,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:29:04,099 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:29:04,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 19:29:04,184 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 19:29:04,184 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 19:29:04,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-11 19:29:04,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:29:04,200 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-11-11 19:29:04,209 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 15 treesize of output 1 [2024-11-11 19:29:04,212 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-11-11 19:29:04,220 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-11 19:29:04,221 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 15 treesize of output 15 [2024-11-11 19:29:04,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2024-11-11 19:29:04,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 12 [2024-11-11 19:29:04,443 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-11 19:29:04,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 128 [2024-11-11 19:29:04,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 23 [2024-11-11 19:29:04,459 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 35 treesize of output 11 [2024-11-11 19:29:04,462 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 35 treesize of output 11 [2024-11-11 19:29:04,537 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 35 treesize of output 19 [2024-11-11 19:29:04,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-11-11 19:29:04,546 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:04,546 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 1 case distinctions, treesize of input 26 treesize of output 10 [2024-11-11 19:29:04,548 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:29:04,548 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:29:04,671 INFO L349 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2024-11-11 19:29:04,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1950 treesize of output 1645 [2024-11-11 19:29:04,749 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_516 (Array Int Int))) (or (not (= v_ArrVal_516 (let ((.cse1 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4))) (store (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|))) (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base|) .cse0 (select v_ArrVal_516 .cse0))) .cse1 (select v_ArrVal_516 .cse1))))) (= |c_ULTIMATE.start_main_~i~0#1.offset| (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_516) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|)))) (forall ((v_ArrVal_514 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_514) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) |c_ULTIMATE.start_main_~i~0#1.base|))) is different from false [2024-11-11 19:29:08,806 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base|))) (let ((.cse5 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse6 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4)) (.cse1 (select .cse7 |c_ULTIMATE.start_main_~i~0#1.offset|))) (and (forall ((v_ArrVal_511 (Array Int Int))) (or (forall ((v_ArrVal_516 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_511)) (.cse3 (select v_ArrVal_511 |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (not (= v_ArrVal_516 (let ((.cse4 (+ .cse3 4))) (store (let ((.cse2 (+ .cse3 8))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_516 .cse2))) .cse4 (select v_ArrVal_516 .cse4))))) (= (select (select (store .cse0 .cse1 v_ArrVal_516) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) .cse3)))) (not (= v_ArrVal_511 (store (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base|) .cse5 (select v_ArrVal_511 .cse5)) .cse6 (select v_ArrVal_511 .cse6)))))) (forall ((v_ArrVal_514 (Array Int Int)) (v_ArrVal_509 Int) (v_ArrVal_508 Int)) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse7 .cse5 v_ArrVal_509) .cse6 v_ArrVal_508)) .cse1 v_ArrVal_514) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|) .cse1))))) is different from false [2024-11-11 19:29:13,660 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 90 treesize of output 88 [2024-11-11 19:29:13,673 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:13,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 95 [2024-11-11 19:29:13,693 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:13,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 80 [2024-11-11 19:29:13,699 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 78 treesize of output 70 [2024-11-11 19:29:13,705 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 57 treesize of output 55 [2024-11-11 19:29:13,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2024-11-11 19:29:13,747 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2024-11-11 19:29:13,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467652328] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:29:13,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:29:13,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2024-11-11 19:29:13,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263420204] [2024-11-11 19:29:13,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:29:13,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-11 19:29:13,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:29:13,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-11 19:29:13,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=426, Unknown=4, NotChecked=86, Total=600 [2024-11-11 19:29:13,749 INFO L87 Difference]: Start difference. First operand 49 states and 64 transitions. Second operand has 25 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:29:14,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:29:14,469 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2024-11-11 19:29:14,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 19:29:14,469 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 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 31 [2024-11-11 19:29:14,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:29:14,470 INFO L225 Difference]: With dead ends: 55 [2024-11-11 19:29:14,470 INFO L226 Difference]: Without dead ends: 53 [2024-11-11 19:29:14,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=174, Invalid=822, Unknown=4, NotChecked=122, Total=1122 [2024-11-11 19:29:14,471 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 67 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 19:29:14,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 298 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 286 Invalid, 0 Unknown, 99 Unchecked, 0.4s Time] [2024-11-11 19:29:14,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-11 19:29:14,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2024-11-11 19:29:14,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:29:14,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2024-11-11 19:29:14,476 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 31 [2024-11-11 19:29:14,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:29:14,477 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2024-11-11 19:29:14,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:29:14,477 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2024-11-11 19:29:14,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-11 19:29:14,477 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:29:14,477 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:29:14,490 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-11 19:29:14,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:29:14,680 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:29:14,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:29:14,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1832566487, now seen corresponding path program 4 times [2024-11-11 19:29:14,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:29:14,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264265457] [2024-11-11 19:29:14,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:29:14,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:29:14,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:29:15,137 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:29:15,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:29:15,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264265457] [2024-11-11 19:29:15,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264265457] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:29:15,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138433346] [2024-11-11 19:29:15,137 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-11 19:29:15,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:29:15,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:29:15,139 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:29:15,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-11 19:29:15,388 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-11 19:29:15,388 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 19:29:15,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-11 19:29:15,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:29:15,424 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-11-11 19:29:15,429 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-11-11 19:29:15,477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-11 19:29:15,486 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-11 19:29:15,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-11 19:29:15,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-11 19:29:15,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-11-11 19:29:15,702 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-11 19:29:15,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2024-11-11 19:29:15,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 15 [2024-11-11 19:29:15,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2024-11-11 19:29:15,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-11-11 19:29:15,820 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-11 19:29:15,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 58 [2024-11-11 19:29:15,833 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-11 19:29:15,834 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 19 [2024-11-11 19:29:15,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 13 [2024-11-11 19:29:15,898 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 20 treesize of output 13 [2024-11-11 19:29:15,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 26 treesize of output 10 [2024-11-11 19:29:16,013 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:29:16,013 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:29:16,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:16,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 140 treesize of output 118 [2024-11-11 19:29:16,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:16,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 217 treesize of output 241 [2024-11-11 19:29:16,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 182 treesize of output 166 [2024-11-11 19:29:16,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 86 treesize of output 78 [2024-11-11 19:29:16,604 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:16,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2024-11-11 19:29:16,609 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 6 treesize of output 4 [2024-11-11 19:29:16,746 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:16,746 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2024-11-11 19:29:16,749 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:29:16,752 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 21 treesize of output 9 [2024-11-11 19:29:16,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 12 treesize of output 10 [2024-11-11 19:29:16,758 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 5 treesize of output 3 [2024-11-11 19:29:16,762 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:29:16,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138433346] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:29:16,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:29:16,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 26 [2024-11-11 19:29:16,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327596425] [2024-11-11 19:29:16,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:29:16,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-11 19:29:16,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:29:16,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-11 19:29:16,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=566, Unknown=13, NotChecked=0, Total=650 [2024-11-11 19:29:16,764 INFO L87 Difference]: Start difference. First operand 52 states and 67 transitions. Second operand has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:29:18,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:29:18,560 INFO L93 Difference]: Finished difference Result 102 states and 135 transitions. [2024-11-11 19:29:18,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-11 19:29:18,560 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 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 32 [2024-11-11 19:29:18,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:29:18,561 INFO L225 Difference]: With dead ends: 102 [2024-11-11 19:29:18,561 INFO L226 Difference]: Without dead ends: 80 [2024-11-11 19:29:18,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=251, Invalid=1451, Unknown=20, NotChecked=0, Total=1722 [2024-11-11 19:29:18,562 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 198 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 36 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 19:29:18,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 385 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 340 Invalid, 7 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 19:29:18,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-11 19:29:18,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2024-11-11 19:29:18,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.3333333333333333) internal successors, (100), 75 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:29:18,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 100 transitions. [2024-11-11 19:29:18,571 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 100 transitions. Word has length 32 [2024-11-11 19:29:18,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:29:18,571 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 100 transitions. [2024-11-11 19:29:18,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:29:18,572 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 100 transitions. [2024-11-11 19:29:18,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-11 19:29:18,572 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:29:18,572 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:29:18,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-11 19:29:18,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:29:18,773 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:29:18,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:29:18,774 INFO L85 PathProgramCache]: Analyzing trace with hash -974282402, now seen corresponding path program 3 times [2024-11-11 19:29:18,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:29:18,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772566133] [2024-11-11 19:29:18,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:29:18,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:29:18,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:29:19,126 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:29:19,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:29:19,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772566133] [2024-11-11 19:29:19,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772566133] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:29:19,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770294705] [2024-11-11 19:29:19,126 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-11 19:29:19,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:29:19,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:29:19,128 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:29:19,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-11 19:29:19,244 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-11 19:29:19,244 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 19:29:19,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-11 19:29:19,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:29:19,277 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-11-11 19:29:19,282 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 15 treesize of output 1 [2024-11-11 19:29:19,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2024-11-11 19:29:19,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2024-11-11 19:29:19,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 59 [2024-11-11 19:29:19,498 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-11 19:29:19,498 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 1 case distinctions, treesize of input 24 treesize of output 19 [2024-11-11 19:29:19,700 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:29:19,700 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:29:21,878 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:21,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 61 [2024-11-11 19:29:21,923 INFO L349 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2024-11-11 19:29:21,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 231 [2024-11-11 19:29:21,938 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 202 treesize of output 182 [2024-11-11 19:29:21,973 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:29:21,973 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:29:21,974 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:29:21,975 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:29:21,975 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:29:21,976 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:29:21,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 1 [2024-11-11 19:29:22,014 INFO L349 Elim1Store]: treesize reduction 5, result has 76.2 percent of original size [2024-11-11 19:29:22,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 26 [2024-11-11 19:29:22,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2024-11-11 19:29:22,055 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:29:22,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770294705] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:29:22,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:29:22,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 25 [2024-11-11 19:29:22,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690547671] [2024-11-11 19:29:22,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:29:22,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-11 19:29:22,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:29:22,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-11 19:29:22,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2024-11-11 19:29:22,057 INFO L87 Difference]: Start difference. First operand 76 states and 100 transitions. Second operand has 25 states, 25 states have (on average 3.0) internal successors, (75), 25 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-11-11 19:29:23,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:29:23,580 INFO L93 Difference]: Finished difference Result 91 states and 114 transitions. [2024-11-11 19:29:23,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-11 19:29:23,580 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.0) internal successors, (75), 25 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) Word has length 34 [2024-11-11 19:29:23,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:29:23,581 INFO L225 Difference]: With dead ends: 91 [2024-11-11 19:29:23,581 INFO L226 Difference]: Without dead ends: 63 [2024-11-11 19:29:23,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=228, Invalid=1178, Unknown=0, NotChecked=0, Total=1406 [2024-11-11 19:29:23,582 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 86 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:29:23,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 408 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 19:29:23,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-11 19:29:23,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 58. [2024-11-11 19:29:23,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 57 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:29:23,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2024-11-11 19:29:23,589 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 76 transitions. Word has length 34 [2024-11-11 19:29:23,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:29:23,589 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 76 transitions. [2024-11-11 19:29:23,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.0) internal successors, (75), 25 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-11-11 19:29:23,589 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2024-11-11 19:29:23,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-11 19:29:23,590 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:29:23,590 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:29:23,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-11 19:29:23,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:29:23,798 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:29:23,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:29:23,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1993858009, now seen corresponding path program 4 times [2024-11-11 19:29:23,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:29:23,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117803834] [2024-11-11 19:29:23,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:29:23,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:29:23,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:29:24,831 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:29:24,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:29:24,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117803834] [2024-11-11 19:29:24,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117803834] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:29:24,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227821016] [2024-11-11 19:29:24,832 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-11 19:29:24,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:29:24,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:29:24,833 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 19:29:24,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-11 19:29:24,998 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-11 19:29:24,998 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 19:29:25,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-11-11 19:29:25,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:29:25,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 11 treesize of output 7 [2024-11-11 19:29:25,032 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-11-11 19:29:25,077 INFO L349 Elim1Store]: treesize reduction 22, result has 43.6 percent of original size [2024-11-11 19:29:25,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 21 treesize of output 31 [2024-11-11 19:29:25,080 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 8 treesize of output 7 [2024-11-11 19:29:25,093 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-11 19:29:25,094 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 15 treesize of output 15 [2024-11-11 19:29:25,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-11 19:29:25,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2024-11-11 19:29:25,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 19 [2024-11-11 19:29:25,462 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2024-11-11 19:29:25,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 185 treesize of output 154 [2024-11-11 19:29:25,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 25 [2024-11-11 19:29:25,491 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 20 treesize of output 1 [2024-11-11 19:29:25,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 23 [2024-11-11 19:29:25,652 INFO L349 Elim1Store]: treesize reduction 46, result has 43.2 percent of original size [2024-11-11 19:29:25,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 157 treesize of output 136 [2024-11-11 19:29:25,681 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2024-11-11 19:29:25,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2024-11-11 19:29:25,720 INFO L349 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2024-11-11 19:29:25,720 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 2 case distinctions, treesize of input 29 treesize of output 37 [2024-11-11 19:29:25,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2024-11-11 19:29:25,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 47 [2024-11-11 19:29:25,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 54 [2024-11-11 19:29:26,086 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-11 19:29:26,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 47 [2024-11-11 19:29:26,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2024-11-11 19:29:26,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 26 treesize of output 10 [2024-11-11 19:29:26,130 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:29:26,130 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:29:26,273 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (or (let ((.cse0 (select (store |c_#memory_int#2| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1012) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1010) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (.cse1 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1009) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (< (select .cse0 (+ 8 .cse1)) (+ (select .cse0 (+ .cse1 4)) 1))) (not (= (let ((.cse3 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4))) (store (let ((.cse2 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|))) (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base|) .cse2 (select v_ArrVal_1010 .cse2))) .cse3 (select v_ArrVal_1010 .cse3))) v_ArrVal_1010)) (not (= (select v_ArrVal_1010 |c_ULTIMATE.start_main_~i~0#1.offset|) 0)))) is different from false [2024-11-11 19:29:26,309 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 13 treesize of output 1 [2024-11-11 19:29:26,335 WARN L851 $PredicateComparison]: unable to prove that (or |c_ULTIMATE.start_main_#t~short8#1| (forall ((v_ArrVal_1009 (Array Int Int)) (v_ArrVal_1002 (Array Int Int)) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1001 (Array Int Int)) (v_ArrVal_1005 Int) (v_ArrVal_1010 (Array Int Int))) (let ((.cse2 (select v_ArrVal_1001 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse0 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~i~0#1.base|)) (.cse3 (+ 8 |c_ULTIMATE.start_main_~i~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~i~0#1.offset| 4)) (.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1002)) (.cse5 (select v_ArrVal_1002 |c_ULTIMATE.start_main_~i~0#1.offset|))) (or (< v_ArrVal_1005 (select .cse0 .cse1)) (not (= (select v_ArrVal_1010 .cse2) 0)) (not (= (store (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base|) .cse3 (select v_ArrVal_1001 .cse3)) .cse1 (select v_ArrVal_1001 .cse1)) v_ArrVal_1001)) (not (= (let ((.cse7 (+ .cse2 4))) (store (let ((.cse6 (+ .cse2 8))) (store (select .cse4 .cse5) .cse6 (select v_ArrVal_1010 .cse6))) .cse7 (select v_ArrVal_1010 .cse7))) v_ArrVal_1010)) (let ((.cse8 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_main_~i~0#1.base| (store (store .cse0 .cse3 |c_ULTIMATE.start_main_~order~0#1|) .cse1 v_ArrVal_1005)) .cse5 v_ArrVal_1012) (select (select (store .cse4 .cse5 v_ArrVal_1010) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (.cse9 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~i~0#1.base| v_ArrVal_1001) .cse5 v_ArrVal_1009) |c_ULTIMATE.start_main_~l~0#1.base|) |c_ULTIMATE.start_main_~l~0#1.offset|))) (< (select .cse8 (+ .cse9 8)) (+ (select .cse8 (+ .cse9 4)) 1))))))) is different from false [2024-11-11 19:29:26,354 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:26,354 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 102 [2024-11-11 19:29:26,416 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:29:26,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 155 treesize of output 227 [2024-11-11 19:29:26,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 53 treesize of output 21