./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/mods.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/mods.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f15d84a1f588b4a2fae1a1f53311fed1d9572550b31409f886696465cdc8f8ba --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 22:32:46,351 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 22:32:46,426 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 22:32:46,430 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 22:32:46,431 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 22:32:46,459 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 22:32:46,460 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 22:32:46,461 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 22:32:46,461 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 22:32:46,462 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 22:32:46,463 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 22:32:46,463 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 22:32:46,464 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 22:32:46,465 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 22:32:46,466 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 22:32:46,466 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 22:32:46,466 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 22:32:46,467 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 22:32:46,467 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 22:32:46,467 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 22:32:46,467 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 22:32:46,471 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 22:32:46,471 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 22:32:46,472 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 22:32:46,472 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 22:32:46,472 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 22:32:46,472 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 22:32:46,473 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 22:32:46,473 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 22:32:46,473 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 22:32:46,473 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 22:32:46,474 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 22:32:46,474 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 22:32:46,474 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 22:32:46,474 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 22:32:46,475 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 22:32:46,475 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 22:32:46,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 22:32:46,476 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 22:32:46,476 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 22:32:46,477 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 22:32:46,477 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 22:32:46,477 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 -> f15d84a1f588b4a2fae1a1f53311fed1d9572550b31409f886696465cdc8f8ba [2024-10-13 22:32:46,749 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 22:32:46,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 22:32:46,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 22:32:46,784 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 22:32:46,784 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 22:32:46,785 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/mods.c [2024-10-13 22:32:48,142 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 22:32:48,318 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 22:32:48,318 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/mods.c [2024-10-13 22:32:48,325 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47cbe7104/d60fdd10e5d94108ba67e46f22f95c1d/FLAG0fa52c0ca [2024-10-13 22:32:48,337 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47cbe7104/d60fdd10e5d94108ba67e46f22f95c1d [2024-10-13 22:32:48,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 22:32:48,342 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 22:32:48,344 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 22:32:48,344 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 22:32:48,348 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 22:32:48,349 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:32:48" (1/1) ... [2024-10-13 22:32:48,349 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57bff846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:32:48, skipping insertion in model container [2024-10-13 22:32:48,349 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:32:48" (1/1) ... [2024-10-13 22:32:48,366 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 22:32:48,531 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/mods.c[587,600] [2024-10-13 22:32:48,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 22:32:48,561 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 22:32:48,571 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/mods.c[587,600] [2024-10-13 22:32:48,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 22:32:48,598 INFO L204 MainTranslator]: Completed translation [2024-10-13 22:32:48,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:32:48 WrapperNode [2024-10-13 22:32:48,599 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 22:32:48,600 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 22:32:48,601 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 22:32:48,601 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 22:32:48,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:32:48" (1/1) ... [2024-10-13 22:32:48,613 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:32:48" (1/1) ... [2024-10-13 22:32:48,632 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 104 [2024-10-13 22:32:48,632 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 22:32:48,633 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 22:32:48,633 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 22:32:48,633 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 22:32:48,644 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:32:48" (1/1) ... [2024-10-13 22:32:48,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:32:48" (1/1) ... [2024-10-13 22:32:48,646 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:32:48" (1/1) ... [2024-10-13 22:32:48,665 INFO L175 MemorySlicer]: Split 21 memory accesses to 4 slices as follows [2, 7, 5, 7]. 33 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0, 0]. The 5 writes are split as follows [0, 0, 2, 3]. [2024-10-13 22:32:48,665 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:32:48" (1/1) ... [2024-10-13 22:32:48,665 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:32:48" (1/1) ... [2024-10-13 22:32:48,671 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:32:48" (1/1) ... [2024-10-13 22:32:48,677 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:32:48" (1/1) ... [2024-10-13 22:32:48,678 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:32:48" (1/1) ... [2024-10-13 22:32:48,679 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:32:48" (1/1) ... [2024-10-13 22:32:48,682 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 22:32:48,683 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 22:32:48,683 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 22:32:48,683 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 22:32:48,684 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:32:48" (1/1) ... [2024-10-13 22:32:48,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 22:32:48,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:32:48,715 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 22:32:48,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 22:32:48,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 22:32:48,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 22:32:48,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 22:32:48,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 22:32:48,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-13 22:32:48,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 22:32:48,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 22:32:48,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 22:32:48,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 22:32:48,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-13 22:32:48,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 22:32:48,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 22:32:48,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 22:32:48,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 22:32:48,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 22:32:48,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 22:32:48,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-13 22:32:48,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 22:32:48,880 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 22:32:48,882 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 22:32:49,093 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-13 22:32:49,093 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 22:32:49,140 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 22:32:49,140 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-13 22:32:49,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:32:49 BoogieIcfgContainer [2024-10-13 22:32:49,141 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 22:32:49,148 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 22:32:49,148 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 22:32:49,151 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 22:32:49,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:32:48" (1/3) ... [2024-10-13 22:32:49,153 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14257c17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:32:49, skipping insertion in model container [2024-10-13 22:32:49,153 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:32:48" (2/3) ... [2024-10-13 22:32:49,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14257c17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:32:49, skipping insertion in model container [2024-10-13 22:32:49,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:32:49" (3/3) ... [2024-10-13 22:32:49,155 INFO L112 eAbstractionObserver]: Analyzing ICFG mods.c [2024-10-13 22:32:49,174 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 22:32:49,174 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 22:32:49,225 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 22:32:49,232 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;@5e365766, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 22:32:49,233 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 22:32:49,238 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:32:49,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 22:32:49,244 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:32:49,245 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:32:49,246 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:32:49,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:32:49,250 INFO L85 PathProgramCache]: Analyzing trace with hash -270928915, now seen corresponding path program 1 times [2024-10-13 22:32:49,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:32:49,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454643316] [2024-10-13 22:32:49,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:32:49,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:32:49,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:32:49,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:32:49,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:32:49,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454643316] [2024-10-13 22:32:49,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454643316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:32:49,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:32:49,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 22:32:49,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415313155] [2024-10-13 22:32:49,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:32:49,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 22:32:49,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:32:49,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 22:32:49,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 22:32:49,426 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 19 states have internal predecessors, (32), 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 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:32:49,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:32:49,453 INFO L93 Difference]: Finished difference Result 37 states and 59 transitions. [2024-10-13 22:32:49,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 22:32:49,458 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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 15 [2024-10-13 22:32:49,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:32:49,464 INFO L225 Difference]: With dead ends: 37 [2024-10-13 22:32:49,464 INFO L226 Difference]: Without dead ends: 17 [2024-10-13 22:32:49,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 22:32:49,469 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:32:49,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 22:32:49,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-10-13 22:32:49,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-10-13 22:32:49,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:32:49,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-10-13 22:32:49,493 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 15 [2024-10-13 22:32:49,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:32:49,493 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-10-13 22:32:49,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:32:49,494 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2024-10-13 22:32:49,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-13 22:32:49,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:32:49,494 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:32:49,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 22:32:49,495 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:32:49,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:32:49,496 INFO L85 PathProgramCache]: Analyzing trace with hash -863276055, now seen corresponding path program 1 times [2024-10-13 22:32:49,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:32:49,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703683715] [2024-10-13 22:32:49,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:32:49,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:32:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:32:49,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:32:49,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:32:49,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703683715] [2024-10-13 22:32:49,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703683715] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 22:32:49,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 22:32:49,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 22:32:49,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188016000] [2024-10-13 22:32:49,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 22:32:49,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 22:32:49,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:32:49,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 22:32:49,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 22:32:49,682 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:32:49,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:32:49,788 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2024-10-13 22:32:49,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 22:32:49,790 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2024-10-13 22:32:49,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:32:49,791 INFO L225 Difference]: With dead ends: 38 [2024-10-13 22:32:49,791 INFO L226 Difference]: Without dead ends: 26 [2024-10-13 22:32:49,791 INFO L431 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-10-13 22:32:49,792 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 22 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:32:49,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 13 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:32:49,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-13 22:32:49,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2024-10-13 22:32:49,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:32:49,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2024-10-13 22:32:49,803 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 15 [2024-10-13 22:32:49,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:32:49,804 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2024-10-13 22:32:49,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:32:49,804 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2024-10-13 22:32:49,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-13 22:32:49,805 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:32:49,805 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:32:49,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 22:32:49,806 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:32:49,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:32:49,807 INFO L85 PathProgramCache]: Analyzing trace with hash 405160390, now seen corresponding path program 1 times [2024-10-13 22:32:49,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:32:49,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488223383] [2024-10-13 22:32:49,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:32:49,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:32:49,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 22:32:49,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1553360935] [2024-10-13 22:32:49,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:32:49,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:32:49,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:32:49,942 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:32:49,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 22:32:50,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:32:50,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-13 22:32:50,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:32:50,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 22:32:50,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 22:32:50,250 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-13 22:32:50,328 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-13 22:32:50,422 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-13 22:32:50,502 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:32:50,502 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:32:51,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2024-10-13 22:32:51,037 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 51 treesize of output 47 [2024-10-13 22:32:51,054 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse2 (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (or (and .cse0 (= 0 (let ((.cse1 (+ .cse2 2))) (mod .cse1 .cse1)))) (and (not .cse0) (forall ((v_arrayElimCell_5 Int)) (= (mod (+ .cse2 (* 2 v_arrayElimCell_5)) (+ .cse2 v_arrayElimCell_5 1)) 0))))) is different from false [2024-10-13 22:32:51,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-10-13 22:32:51,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:32:51,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488223383] [2024-10-13 22:32:51,062 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 22:32:51,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553360935] [2024-10-13 22:32:51,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553360935] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:32:51,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 22:32:51,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2024-10-13 22:32:51,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818763671] [2024-10-13 22:32:51,066 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 22:32:51,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-13 22:32:51,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:32:51,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-13 22:32:51,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=350, Unknown=1, NotChecked=38, Total=462 [2024-10-13 22:32:51,069 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:32:51,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:32:51,629 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2024-10-13 22:32:51,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 22:32:51,630 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-13 22:32:51,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:32:51,632 INFO L225 Difference]: With dead ends: 46 [2024-10-13 22:32:51,633 INFO L226 Difference]: Without dead ends: 44 [2024-10-13 22:32:51,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=113, Invalid=540, Unknown=1, NotChecked=48, Total=702 [2024-10-13 22:32:51,635 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 57 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 22:32:51,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 124 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 223 Invalid, 0 Unknown, 45 Unchecked, 0.3s Time] [2024-10-13 22:32:51,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-13 22:32:51,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2024-10-13 22:32:51,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:32:51,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2024-10-13 22:32:51,651 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 19 [2024-10-13 22:32:51,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:32:51,652 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2024-10-13 22:32:51,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:32:51,653 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2024-10-13 22:32:51,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 22:32:51,654 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:32:51,654 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:32:51,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 22:32:51,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:32:51,855 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:32:51,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:32:51,856 INFO L85 PathProgramCache]: Analyzing trace with hash 316854210, now seen corresponding path program 2 times [2024-10-13 22:32:51,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:32:51,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621205547] [2024-10-13 22:32:51,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:32:51,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:32:51,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:32:52,073 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 22:32:52,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:32:52,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621205547] [2024-10-13 22:32:52,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621205547] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:32:52,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73756779] [2024-10-13 22:32:52,073 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 22:32:52,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:32:52,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:32:52,077 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:32:52,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 22:32:52,156 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 22:32:52,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 22:32:52,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 22:32:52,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:32:52,210 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 22:32:52,211 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:32:52,255 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-13 22:32:52,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73756779] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:32:52,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 22:32:52,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-10-13 22:32:52,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388005413] [2024-10-13 22:32:52,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 22:32:52,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 22:32:52,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:32:52,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 22:32:52,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-13 22:32:52,258 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 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-10-13 22:32:52,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:32:52,379 INFO L93 Difference]: Finished difference Result 77 states and 94 transitions. [2024-10-13 22:32:52,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 22:32:52,379 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 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) Word has length 20 [2024-10-13 22:32:52,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:32:52,380 INFO L225 Difference]: With dead ends: 77 [2024-10-13 22:32:52,380 INFO L226 Difference]: Without dead ends: 43 [2024-10-13 22:32:52,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-10-13 22:32:52,382 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 41 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:32:52,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 36 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:32:52,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-13 22:32:52,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2024-10-13 22:32:52,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:32:52,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-10-13 22:32:52,393 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 20 [2024-10-13 22:32:52,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:32:52,394 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-10-13 22:32:52,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 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-10-13 22:32:52,394 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2024-10-13 22:32:52,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 22:32:52,395 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:32:52,395 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:32:52,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 22:32:52,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-10-13 22:32:52,596 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:32:52,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:32:52,596 INFO L85 PathProgramCache]: Analyzing trace with hash -732578568, now seen corresponding path program 3 times [2024-10-13 22:32:52,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:32:52,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676283616] [2024-10-13 22:32:52,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:32:52,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:32:52,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:32:52,773 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 22:32:52,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:32:52,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676283616] [2024-10-13 22:32:52,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676283616] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:32:52,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196044140] [2024-10-13 22:32:52,774 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 22:32:52,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:32:52,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:32:52,776 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:32:52,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 22:32:52,849 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-13 22:32:52,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 22:32:52,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 22:32:52,855 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:32:52,909 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 22:32:52,910 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:32:52,960 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-13 22:32:52,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196044140] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:32:52,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 22:32:52,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-10-13 22:32:52,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941726673] [2024-10-13 22:32:52,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 22:32:52,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 22:32:52,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:32:52,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 22:32:52,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-13 22:32:52,962 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 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-10-13 22:32:53,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:32:53,074 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2024-10-13 22:32:53,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 22:32:53,075 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 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) Word has length 21 [2024-10-13 22:32:53,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:32:53,076 INFO L225 Difference]: With dead ends: 43 [2024-10-13 22:32:53,076 INFO L226 Difference]: Without dead ends: 35 [2024-10-13 22:32:53,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-10-13 22:32:53,077 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 55 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:32:53,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 34 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:32:53,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-13 22:32:53,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2024-10-13 22:32:53,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 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-10-13 22:32:53,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-10-13 22:32:53,084 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 21 [2024-10-13 22:32:53,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:32:53,085 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-10-13 22:32:53,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 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-10-13 22:32:53,085 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-10-13 22:32:53,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-13 22:32:53,087 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:32:53,087 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:32:53,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-13 22:32:53,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:32:53,288 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:32:53,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:32:53,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1546241993, now seen corresponding path program 4 times [2024-10-13 22:32:53,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:32:53,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105269671] [2024-10-13 22:32:53,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:32:53,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:32:53,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 22:32:53,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1524149866] [2024-10-13 22:32:53,353 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 22:32:53,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:32:53,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:32:53,355 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:32:53,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 22:32:53,456 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 22:32:53,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 22:32:53,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-13 22:32:53,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:32:53,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 22:32:53,489 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 11 [2024-10-13 22:32:53,515 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 25 treesize of output 24 [2024-10-13 22:32:53,618 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 0 case distinctions, treesize of input 23 treesize of output 15 [2024-10-13 22:32:53,656 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 0 case distinctions, treesize of input 33 treesize of output 21 [2024-10-13 22:32:53,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 22:32:53,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2024-10-13 22:32:53,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 22:32:53,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2024-10-13 22:32:53,913 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 22:32:53,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2024-10-13 22:32:53,964 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 22:32:53,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2024-10-13 22:32:54,079 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:32:54,079 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:32:55,086 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:32:55,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:32:55,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105269671] [2024-10-13 22:32:55,087 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 22:32:55,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524149866] [2024-10-13 22:32:55,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524149866] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:32:55,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 22:32:55,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2024-10-13 22:32:55,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104130679] [2024-10-13 22:32:55,088 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 22:32:55,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-13 22:32:55,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:32:55,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-13 22:32:55,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=894, Unknown=0, NotChecked=0, Total=1056 [2024-10-13 22:32:55,091 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 33 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:33:01,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:33:01,870 INFO L93 Difference]: Finished difference Result 119 states and 142 transitions. [2024-10-13 22:33:01,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-10-13 22:33:01,870 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-13 22:33:01,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:33:01,871 INFO L225 Difference]: With dead ends: 119 [2024-10-13 22:33:01,871 INFO L226 Difference]: Without dead ends: 117 [2024-10-13 22:33:01,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1689 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1111, Invalid=5531, Unknown=0, NotChecked=0, Total=6642 [2024-10-13 22:33:01,874 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 227 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 22:33:01,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 235 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 22:33:01,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-13 22:33:01,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 42. [2024-10-13 22:33:01,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 41 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:33:01,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2024-10-13 22:33:01,888 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 23 [2024-10-13 22:33:01,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:33:01,888 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2024-10-13 22:33:01,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:33:01,888 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2024-10-13 22:33:01,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-13 22:33:01,889 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:33:01,889 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:33:01,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 22:33:02,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:33:02,094 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:33:02,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:33:02,094 INFO L85 PathProgramCache]: Analyzing trace with hash -2060537951, now seen corresponding path program 5 times [2024-10-13 22:33:02,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:33:02,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22561379] [2024-10-13 22:33:02,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:33:02,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:33:02,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:33:02,249 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 22:33:02,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:33:02,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22561379] [2024-10-13 22:33:02,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22561379] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:33:02,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075951266] [2024-10-13 22:33:02,250 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-13 22:33:02,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:33:02,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:33:02,254 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:33:02,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 22:33:02,356 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-10-13 22:33:02,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 22:33:02,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 22:33:02,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:33:02,410 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 22:33:02,410 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:33:02,456 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 22:33:02,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075951266] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:33:02,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 22:33:02,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2024-10-13 22:33:02,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425932869] [2024-10-13 22:33:02,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 22:33:02,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 22:33:02,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:33:02,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 22:33:02,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-10-13 22:33:02,461 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:33:02,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:33:02,591 INFO L93 Difference]: Finished difference Result 105 states and 123 transitions. [2024-10-13 22:33:02,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 22:33:02,591 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-10-13 22:33:02,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:33:02,592 INFO L225 Difference]: With dead ends: 105 [2024-10-13 22:33:02,592 INFO L226 Difference]: Without dead ends: 58 [2024-10-13 22:33:02,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-10-13 22:33:02,593 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 51 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:33:02,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 55 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:33:02,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-13 22:33:02,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 39. [2024-10-13 22:33:02,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 38 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-10-13 22:33:02,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2024-10-13 22:33:02,604 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 24 [2024-10-13 22:33:02,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:33:02,604 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2024-10-13 22:33:02,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:33:02,604 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2024-10-13 22:33:02,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 22:33:02,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:33:02,605 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:33:02,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-13 22:33:02,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:33:02,806 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:33:02,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:33:02,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1281102295, now seen corresponding path program 6 times [2024-10-13 22:33:02,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:33:02,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710342047] [2024-10-13 22:33:02,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:33:02,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:33:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:33:02,943 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 22:33:02,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:33:02,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710342047] [2024-10-13 22:33:02,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710342047] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:33:02,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217949761] [2024-10-13 22:33:02,943 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-13 22:33:02,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:33:02,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:33:02,945 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:33:02,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-13 22:33:03,021 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-10-13 22:33:03,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 22:33:03,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 22:33:03,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:33:03,085 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 22:33:03,086 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:33:03,146 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-13 22:33:03,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217949761] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:33:03,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 22:33:03,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2024-10-13 22:33:03,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516962351] [2024-10-13 22:33:03,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 22:33:03,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 22:33:03,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:33:03,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 22:33:03,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-10-13 22:33:03,149 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 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-10-13 22:33:03,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:33:03,265 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2024-10-13 22:33:03,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 22:33:03,266 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 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) Word has length 25 [2024-10-13 22:33:03,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:33:03,266 INFO L225 Difference]: With dead ends: 56 [2024-10-13 22:33:03,267 INFO L226 Difference]: Without dead ends: 44 [2024-10-13 22:33:03,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-13 22:33:03,267 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 68 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:33:03,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 48 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:33:03,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-13 22:33:03,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 29. [2024-10-13 22:33:03,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:33:03,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2024-10-13 22:33:03,275 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 25 [2024-10-13 22:33:03,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:33:03,277 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2024-10-13 22:33:03,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 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-10-13 22:33:03,277 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2024-10-13 22:33:03,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-13 22:33:03,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:33:03,278 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:33:03,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-13 22:33:03,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:33:03,479 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:33:03,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:33:03,479 INFO L85 PathProgramCache]: Analyzing trace with hash 444924774, now seen corresponding path program 7 times [2024-10-13 22:33:03,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:33:03,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976594456] [2024-10-13 22:33:03,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:33:03,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:33:03,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 22:33:03,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [477929143] [2024-10-13 22:33:03,581 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-13 22:33:03,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:33:03,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:33:03,583 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:33:03,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-13 22:33:03,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:33:03,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-10-13 22:33:03,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:33:03,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 22:33:03,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 22:33:03,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-13 22:33:03,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 22:33:03,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2024-10-13 22:33:03,862 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-13 22:33:03,896 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-13 22:33:03,937 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-13 22:33:04,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 22:33:04,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2024-10-13 22:33:04,046 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 22:33:04,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2024-10-13 22:33:04,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 22:33:04,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2024-10-13 22:33:04,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 22:33:04,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2024-10-13 22:33:04,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 22:33:04,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2024-10-13 22:33:04,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 22:33:04,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2024-10-13 22:33:04,347 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:33:04,347 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:33:05,716 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 194 treesize of output 182 [2024-10-13 22:33:05,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 22:33:05,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 15957 treesize of output 14677 [2024-10-13 22:33:10,659 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:33:10,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:33:10,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976594456] [2024-10-13 22:33:10,659 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 22:33:10,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477929143] [2024-10-13 22:33:10,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477929143] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:33:10,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 22:33:10,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2024-10-13 22:33:10,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961177353] [2024-10-13 22:33:10,660 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 22:33:10,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-13 22:33:10,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:33:10,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-13 22:33:10,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1216, Unknown=5, NotChecked=0, Total=1406 [2024-10-13 22:33:10,661 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 38 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:33:13,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-10-13 22:33:23,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-10-13 22:33:28,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-10-13 22:33:28,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:33:28,653 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2024-10-13 22:33:28,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-13 22:33:28,654 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 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 27 [2024-10-13 22:33:28,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:33:28,655 INFO L225 Difference]: With dead ends: 85 [2024-10-13 22:33:28,655 INFO L226 Difference]: Without dead ends: 83 [2024-10-13 22:33:28,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=420, Invalid=2544, Unknown=6, NotChecked=0, Total=2970 [2024-10-13 22:33:28,657 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 138 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 52 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2024-10-13 22:33:28,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 208 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 622 Invalid, 2 Unknown, 0 Unchecked, 12.0s Time] [2024-10-13 22:33:28,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-13 22:33:28,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 56. [2024-10-13 22:33:28,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 55 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:33:28,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2024-10-13 22:33:28,674 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 27 [2024-10-13 22:33:28,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:33:28,674 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2024-10-13 22:33:28,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:33:28,674 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2024-10-13 22:33:28,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-13 22:33:28,675 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:33:28,675 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:33:28,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-13 22:33:28,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:33:28,876 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:33:28,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:33:28,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1432300002, now seen corresponding path program 8 times [2024-10-13 22:33:28,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:33:28,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773933662] [2024-10-13 22:33:28,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:33:28,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:33:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:33:29,033 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 22:33:29,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:33:29,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773933662] [2024-10-13 22:33:29,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773933662] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:33:29,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853689774] [2024-10-13 22:33:29,034 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 22:33:29,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:33:29,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:33:29,036 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:33:29,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-13 22:33:29,124 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 22:33:29,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 22:33:29,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 22:33:29,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:33:29,189 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 22:33:29,189 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:33:29,246 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-13 22:33:29,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853689774] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:33:29,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 22:33:29,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2024-10-13 22:33:29,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474953849] [2024-10-13 22:33:29,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 22:33:29,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-13 22:33:29,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:33:29,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 22:33:29,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2024-10-13 22:33:29,248 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:33:29,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:33:29,414 INFO L93 Difference]: Finished difference Result 130 states and 151 transitions. [2024-10-13 22:33:29,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 22:33:29,414 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 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) Word has length 28 [2024-10-13 22:33:29,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:33:29,415 INFO L225 Difference]: With dead ends: 130 [2024-10-13 22:33:29,415 INFO L226 Difference]: Without dead ends: 94 [2024-10-13 22:33:29,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 43 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2024-10-13 22:33:29,416 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 85 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 22:33:29,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 81 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 22:33:29,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-13 22:33:29,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 68. [2024-10-13 22:33:29,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.164179104477612) internal successors, (78), 67 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:33:29,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2024-10-13 22:33:29,431 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 28 [2024-10-13 22:33:29,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:33:29,431 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2024-10-13 22:33:29,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:33:29,431 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2024-10-13 22:33:29,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-13 22:33:29,432 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:33:29,432 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:33:29,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-13 22:33:29,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-13 22:33:29,633 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:33:29,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:33:29,633 INFO L85 PathProgramCache]: Analyzing trace with hash 637829400, now seen corresponding path program 9 times [2024-10-13 22:33:29,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:33:29,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676239856] [2024-10-13 22:33:29,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:33:29,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:33:29,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 22:33:29,814 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 22:33:29,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:33:29,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676239856] [2024-10-13 22:33:29,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676239856] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 22:33:29,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323519278] [2024-10-13 22:33:29,815 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-13 22:33:29,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:33:29,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:33:29,817 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:33:29,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-13 22:33:29,993 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-13 22:33:29,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 22:33:29,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 22:33:29,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:33:30,059 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 22:33:30,059 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:33:30,121 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-13 22:33:30,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323519278] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:33:30,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 22:33:30,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2024-10-13 22:33:30,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534908098] [2024-10-13 22:33:30,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 22:33:30,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-13 22:33:30,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:33:30,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 22:33:30,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2024-10-13 22:33:30,122 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:33:30,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 22:33:30,379 INFO L93 Difference]: Finished difference Result 111 states and 119 transitions. [2024-10-13 22:33:30,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 22:33:30,379 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 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) Word has length 29 [2024-10-13 22:33:30,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 22:33:30,380 INFO L225 Difference]: With dead ends: 111 [2024-10-13 22:33:30,380 INFO L226 Difference]: Without dead ends: 79 [2024-10-13 22:33:30,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 44 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2024-10-13 22:33:30,381 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 76 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 22:33:30,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 117 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 22:33:30,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-13 22:33:30,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 57. [2024-10-13 22:33:30,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:33:30,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2024-10-13 22:33:30,400 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 29 [2024-10-13 22:33:30,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 22:33:30,400 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2024-10-13 22:33:30,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 17 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 22:33:30,400 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2024-10-13 22:33:30,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-13 22:33:30,401 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 22:33:30,401 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 22:33:30,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-13 22:33:30,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:33:30,604 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 22:33:30,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 22:33:30,605 INFO L85 PathProgramCache]: Analyzing trace with hash -804498519, now seen corresponding path program 10 times [2024-10-13 22:33:30,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 22:33:30,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204618347] [2024-10-13 22:33:30,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 22:33:30,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 22:33:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 22:33:30,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1710536842] [2024-10-13 22:33:30,676 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-13 22:33:30,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 22:33:30,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 22:33:30,678 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 22:33:30,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-13 22:33:30,887 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-13 22:33:30,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 22:33:30,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 94 conjuncts are in the unsatisfiable core [2024-10-13 22:33:30,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 22:33:30,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 22:33:30,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 22:33:30,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-13 22:33:30,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 22:33:30,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 22:33:30,984 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 22:33:30,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2024-10-13 22:33:31,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 22:33:31,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 22:33:31,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 22:33:31,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 22:33:31,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 22:33:31,038 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 22:33:31,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 42 [2024-10-13 22:33:35,200 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-13 22:33:35,245 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 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-13 22:33:35,292 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 0 case distinctions, treesize of input 25 treesize of output 17 [2024-10-13 22:33:35,367 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 0 case distinctions, treesize of input 35 treesize of output 23 [2024-10-13 22:33:35,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 22:33:35,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 22:33:35,570 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 22:33:35,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 22:33:35,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 22:33:35,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 22:33:35,574 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 22:33:35,579 INFO L349 Elim1Store]: treesize reduction 6, result has 14.3 percent of original size [2024-10-13 22:33:35,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 70 treesize of output 77 [2024-10-13 22:33:35,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 22:33:35,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 22:33:35,686 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 22:33:35,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 22:33:35,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 22:33:35,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 22:33:35,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 22:33:35,691 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 22:33:35,695 INFO L349 Elim1Store]: treesize reduction 6, result has 14.3 percent of original size [2024-10-13 22:33:35,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 76 treesize of output 83 [2024-10-13 22:33:35,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 22:33:35,804 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 22:33:35,805 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 22:33:35,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 22:33:35,816 INFO L349 Elim1Store]: treesize reduction 4, result has 42.9 percent of original size [2024-10-13 22:33:35,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 86 treesize of output 98 [2024-10-13 22:33:35,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 22:33:35,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 41 [2024-10-13 22:33:36,006 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 22:33:36,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 41 [2024-10-13 22:33:36,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 22:33:36,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 41 [2024-10-13 22:33:36,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 22:33:36,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 41 [2024-10-13 22:33:36,171 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 22:33:36,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 41 [2024-10-13 22:33:36,299 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 1 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 22:33:36,299 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 22:33:38,952 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 189 treesize of output 177 [2024-10-13 22:33:38,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 22:33:38,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 15638 treesize of output 14358 [2024-10-13 22:34:20,248 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse12 (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse227 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse74 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse0 (< 0 |c_ULTIMATE.start_main_~i~0#1|)) (.cse2 (= (let ((.cse228 (+ .cse12 5))) (mod .cse228 .cse228)) 0))) (let ((.cse75 (or .cse0 .cse2)) (.cse9 (= .cse74 0)) (.cse18 (< 0 .cse227)) (.cse189 (<= 0 .cse227)) (.cse20 (forall ((v_arrayElimCell_94 Int)) (= (let ((.cse226 (+ .cse12 4 v_arrayElimCell_94))) (mod .cse226 .cse226)) 0))) (.cse3 (forall ((v_arrayElimCell_95 Int)) (= (let ((.cse225 (+ .cse12 4 v_arrayElimCell_95))) (mod .cse225 .cse225)) 0)))) (let ((.cse30 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (let ((.cse224 (* 2 v_arrayElimCell_96))) (or (= (let ((.cse223 (+ .cse12 4 v_arrayElimCell_95))) (mod .cse223 .cse223)) 0) (= (mod (+ .cse12 .cse224 2 v_arrayElimCell_95) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_95)) 0) (= (mod (+ .cse12 .cse224 2 v_arrayElimCell_94) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_94)) 0))))) (.cse16 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (let ((.cse221 (* 2 v_arrayElimCell_96))) (or (= (let ((.cse220 (+ .cse12 4 v_arrayElimCell_95))) (mod .cse220 .cse220)) 0) (= (mod (+ .cse12 .cse221 v_arrayElimCell_95 v_arrayElimCell_94 1) (+ .cse12 2 v_arrayElimCell_96 v_arrayElimCell_95 v_arrayElimCell_94)) 0) (= (let ((.cse222 (+ .cse12 3 v_arrayElimCell_95 v_arrayElimCell_94))) (mod .cse222 .cse222)) 0) (= (mod (+ .cse12 .cse221 2 v_arrayElimCell_94) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_94)) 0))))) (.cse104 (or .cse20 .cse3)) (.cse37 (forall ((v_arrayElimCell_96 Int)) (= (mod (+ .cse12 (* 2 v_arrayElimCell_96) 3) (+ .cse12 4 v_arrayElimCell_96)) 0))) (.cse92 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int)) (let ((.cse218 (* 2 v_arrayElimCell_96))) (or (= (mod (+ .cse12 .cse218 2 v_arrayElimCell_94) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_94)) 0) (= (mod (+ .cse12 .cse218 3) (+ .cse12 4 v_arrayElimCell_96)) 0) (= (let ((.cse219 (+ .cse12 4 v_arrayElimCell_94))) (mod .cse219 .cse219)) 0))))) (.cse105 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (let ((.cse216 (* 2 v_arrayElimCell_96))) (or (= (mod (+ .cse12 .cse216 2 v_arrayElimCell_95) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_95)) 0) (= (mod (+ .cse12 .cse216 v_arrayElimCell_95 v_arrayElimCell_94 1) (+ .cse12 2 v_arrayElimCell_96 v_arrayElimCell_95 v_arrayElimCell_94)) 0) (= (mod (+ .cse12 .cse216 2 v_arrayElimCell_94) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_94)) 0) (= (let ((.cse217 (+ .cse12 4 v_arrayElimCell_94))) (mod .cse217 .cse217)) 0))))) (.cse36 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (let ((.cse214 (* 2 v_arrayElimCell_96))) (or (= (mod (+ .cse12 .cse214 v_arrayElimCell_95 v_arrayElimCell_94 1) (+ .cse12 2 v_arrayElimCell_96 v_arrayElimCell_95 v_arrayElimCell_94)) 0) (= (let ((.cse215 (+ .cse12 3 v_arrayElimCell_95 v_arrayElimCell_94))) (mod .cse215 .cse215)) 0) (= (mod (+ .cse12 .cse214 2 v_arrayElimCell_94) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_94)) 0) (= (mod (+ .cse12 .cse214 3) (+ .cse12 4 v_arrayElimCell_96)) 0))))) (.cse17 (< 0 (+ 3 |c_ULTIMATE.start_main_~i~0#1|))) (.cse52 (and (or .cse2 .cse18) .cse189)) (.cse51 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (let ((.cse212 (* 2 v_arrayElimCell_96))) (or (= (let ((.cse211 (+ .cse12 4 v_arrayElimCell_95))) (mod .cse211 .cse211)) 0) (= (mod (+ .cse12 .cse212 v_arrayElimCell_95 v_arrayElimCell_94 1) (+ .cse12 2 v_arrayElimCell_96 v_arrayElimCell_95 v_arrayElimCell_94)) 0) (= (mod (+ .cse12 .cse212 2 v_arrayElimCell_94) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_94)) 0) (= (let ((.cse213 (+ .cse12 4 v_arrayElimCell_94))) (mod .cse213 .cse213)) 0))))) (.cse79 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (let ((.cse209 (* 2 v_arrayElimCell_96))) (or (= (mod (+ .cse12 .cse209 v_arrayElimCell_95 v_arrayElimCell_94 1) (+ .cse12 2 v_arrayElimCell_96 v_arrayElimCell_95 v_arrayElimCell_94)) 0) (= (mod (+ .cse12 .cse209 2 v_arrayElimCell_94) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_94)) 0) (= (mod (+ .cse12 .cse209 3) (+ .cse12 4 v_arrayElimCell_96)) 0) (= (let ((.cse210 (+ .cse12 4 v_arrayElimCell_94))) (mod .cse210 .cse210)) 0))))) (.cse163 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (let ((.cse208 (* 2 v_arrayElimCell_96))) (or (= (mod (+ .cse12 .cse208 v_arrayElimCell_95 v_arrayElimCell_94 1) (+ .cse12 2 v_arrayElimCell_96 v_arrayElimCell_95 v_arrayElimCell_94)) 0) (= (mod (+ .cse12 .cse208 2 v_arrayElimCell_94) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_94)) 0) (= (mod (+ .cse12 .cse208 3) (+ .cse12 4 v_arrayElimCell_96)) 0))))) (.cse131 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int)) (let ((.cse207 (* 2 v_arrayElimCell_96))) (or (= (mod (+ .cse12 .cse207 2 v_arrayElimCell_94) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_94)) 0) (= (mod (+ .cse12 .cse207 3) (+ .cse12 4 v_arrayElimCell_96)) 0))))) (.cse162 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (let ((.cse206 (* 2 v_arrayElimCell_96))) (or (= (let ((.cse205 (+ .cse12 3 v_arrayElimCell_95 v_arrayElimCell_94))) (mod .cse205 .cse205)) 0) (= (mod (+ .cse12 .cse206 2 v_arrayElimCell_94) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_94)) 0) (= (mod (+ .cse12 .cse206 3) (+ .cse12 4 v_arrayElimCell_96)) 0))))) (.cse97 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (let ((.cse202 (* 2 v_arrayElimCell_96))) (or (= (mod (+ .cse12 .cse202 2 v_arrayElimCell_95) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_95)) 0) (= (mod (+ .cse12 .cse202 v_arrayElimCell_95 v_arrayElimCell_94 1) (+ .cse12 2 v_arrayElimCell_96 v_arrayElimCell_95 v_arrayElimCell_94)) 0) (= (let ((.cse203 (+ .cse12 3 v_arrayElimCell_95 v_arrayElimCell_94))) (mod .cse203 .cse203)) 0) (= (let ((.cse204 (+ .cse12 4 v_arrayElimCell_94))) (mod .cse204 .cse204)) 0))))) (.cse94 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (let ((.cse200 (* 2 v_arrayElimCell_96))) (or (= (mod (+ .cse12 .cse200 2 v_arrayElimCell_95) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_95)) 0) (= (mod (+ .cse12 .cse200 v_arrayElimCell_95 v_arrayElimCell_94 1) (+ .cse12 2 v_arrayElimCell_96 v_arrayElimCell_95 v_arrayElimCell_94)) 0) (= (let ((.cse201 (+ .cse12 3 v_arrayElimCell_95 v_arrayElimCell_94))) (mod .cse201 .cse201)) 0))))) (.cse95 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (let ((.cse198 (* 2 v_arrayElimCell_96))) (or (= (mod (+ .cse12 .cse198 2 v_arrayElimCell_95) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_95)) 0) (= (mod (+ .cse12 .cse198 v_arrayElimCell_95 v_arrayElimCell_94 1) (+ .cse12 2 v_arrayElimCell_96 v_arrayElimCell_95 v_arrayElimCell_94)) 0) (= (let ((.cse199 (+ .cse12 3 v_arrayElimCell_95 v_arrayElimCell_94))) (mod .cse199 .cse199)) 0) (= (mod (+ .cse12 .cse198 2 v_arrayElimCell_94) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_94)) 0))))) (.cse10 (< 0 .cse74)) (.cse99 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_95 Int)) (or (= (let ((.cse195 (+ .cse12 4 v_arrayElimCell_95))) (mod .cse195 .cse195)) 0) (= (let ((.cse196 (+ .cse12 3 v_arrayElimCell_95 v_arrayElimCell_94))) (mod .cse196 .cse196)) 0) (= (let ((.cse197 (+ .cse12 4 v_arrayElimCell_94))) (mod .cse197 .cse197)) 0)))) (.cse49 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_95 Int)) (or (= (let ((.cse193 (+ .cse12 3 v_arrayElimCell_95 v_arrayElimCell_94))) (mod .cse193 .cse193)) 0) (= (let ((.cse194 (+ .cse12 4 v_arrayElimCell_94))) (mod .cse194 .cse194)) 0)))) (.cse29 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (let ((.cse191 (* 2 v_arrayElimCell_96))) (or (= (mod (+ .cse12 .cse191 v_arrayElimCell_95 v_arrayElimCell_94 1) (+ .cse12 2 v_arrayElimCell_96 v_arrayElimCell_95 v_arrayElimCell_94)) 0) (= (let ((.cse192 (+ .cse12 3 v_arrayElimCell_95 v_arrayElimCell_94))) (mod .cse192 .cse192)) 0) (= (mod (+ .cse12 .cse191 2 v_arrayElimCell_94) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_94)) 0))))) (.cse98 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (or (= (mod (+ .cse12 (* 2 v_arrayElimCell_96) v_arrayElimCell_95 v_arrayElimCell_94 1) (+ .cse12 2 v_arrayElimCell_96 v_arrayElimCell_95 v_arrayElimCell_94)) 0) (= (let ((.cse190 (+ .cse12 3 v_arrayElimCell_95 v_arrayElimCell_94))) (mod .cse190 .cse190)) 0)))) (.cse19 (not .cse9)) (.cse93 (and .cse75 .cse189)) (.cse57 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (let ((.cse187 (* 2 v_arrayElimCell_96))) (or (= (let ((.cse186 (+ .cse12 4 v_arrayElimCell_95))) (mod .cse186 .cse186)) 0) (= (mod (+ .cse12 .cse187 v_arrayElimCell_95 v_arrayElimCell_94 1) (+ .cse12 2 v_arrayElimCell_96 v_arrayElimCell_95 v_arrayElimCell_94)) 0) (= (let ((.cse188 (+ .cse12 3 v_arrayElimCell_95 v_arrayElimCell_94))) (mod .cse188 .cse188)) 0) (= (mod (+ .cse12 .cse187 3) (+ .cse12 4 v_arrayElimCell_96)) 0))))) (.cse85 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int)) (= (mod (+ .cse12 (* 2 v_arrayElimCell_96) 2 v_arrayElimCell_94) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_94)) 0)))) (let ((.cse4 (or .cse0 .cse85 .cse2 .cse3)) (.cse58 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_95 Int)) (or (= (let ((.cse184 (+ .cse12 4 v_arrayElimCell_95))) (mod .cse184 .cse184)) 0) (= (let ((.cse185 (+ .cse12 3 v_arrayElimCell_95 v_arrayElimCell_94))) (mod .cse185 .cse185)) 0)))) (.cse73 (or .cse93 .cse57)) (.cse69 (or .cse19 .cse3)) (.cse70 (forall ((v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (or (= (let ((.cse183 (+ .cse12 4 v_arrayElimCell_95))) (mod .cse183 .cse183)) 0) (= (mod (+ .cse12 (* 2 v_arrayElimCell_96) 2 v_arrayElimCell_95) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_95)) 0)))) (.cse34 (or .cse18 .cse98)) (.cse28 (or .cse29 .cse18)) (.cse38 (and .cse99 .cse20 .cse49)) (.cse32 (or .cse95 .cse10 .cse9)) (.cse35 (or .cse94 .cse10 .cse9)) (.cse33 (or .cse97 .cse10 .cse9)) (.cse1 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int)) (or (= (mod (+ .cse12 (* 2 v_arrayElimCell_96) 2 v_arrayElimCell_94) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_94)) 0) (= (let ((.cse182 (+ .cse12 4 v_arrayElimCell_94))) (mod .cse182 .cse182)) 0)))) (.cse64 (or .cse0 .cse162 .cse2)) (.cse65 (or .cse0 .cse131 .cse2)) (.cse66 (or .cse0 .cse163 .cse2)) (.cse80 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (or (= (let ((.cse180 (+ .cse12 3 v_arrayElimCell_95 v_arrayElimCell_94))) (mod .cse180 .cse180)) 0) (= (mod (+ .cse12 (* 2 v_arrayElimCell_96) 2 v_arrayElimCell_94) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_94)) 0) (= (let ((.cse181 (+ .cse12 4 v_arrayElimCell_94))) (mod .cse181 .cse181)) 0)))) (.cse56 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (let ((.cse178 (* 2 v_arrayElimCell_96))) (or (= (let ((.cse177 (+ .cse12 4 v_arrayElimCell_95))) (mod .cse177 .cse177)) 0) (= (mod (+ .cse12 .cse178 2 v_arrayElimCell_95) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_95)) 0) (= (mod (+ .cse12 .cse178 v_arrayElimCell_95 v_arrayElimCell_94 1) (+ .cse12 2 v_arrayElimCell_96 v_arrayElimCell_95 v_arrayElimCell_94)) 0) (= (let ((.cse179 (+ .cse12 4 v_arrayElimCell_94))) (mod .cse179 .cse179)) 0))))) (.cse77 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (let ((.cse175 (* 2 v_arrayElimCell_96))) (or (= (mod (+ .cse12 .cse175 v_arrayElimCell_95 v_arrayElimCell_94 1) (+ .cse12 2 v_arrayElimCell_96 v_arrayElimCell_95 v_arrayElimCell_94)) 0) (= (mod (+ .cse12 .cse175 2 v_arrayElimCell_94) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_94)) 0) (= (let ((.cse176 (+ .cse12 4 v_arrayElimCell_94))) (mod .cse176 .cse176)) 0))))) (.cse23 (or .cse0 .cse79)) (.cse24 (or .cse0 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (let ((.cse173 (* 2 v_arrayElimCell_96))) (or (= (let ((.cse172 (+ .cse12 3 v_arrayElimCell_95 v_arrayElimCell_94))) (mod .cse172 .cse172)) 0) (= (mod (+ .cse12 .cse173 2 v_arrayElimCell_94) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_94)) 0) (= (mod (+ .cse12 .cse173 3) (+ .cse12 4 v_arrayElimCell_96)) 0) (= (let ((.cse174 (+ .cse12 4 v_arrayElimCell_94))) (mod .cse174 .cse174)) 0)))))) (.cse91 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (or (= (mod (+ .cse12 (* 2 v_arrayElimCell_96) v_arrayElimCell_95 v_arrayElimCell_94 1) (+ .cse12 2 v_arrayElimCell_96 v_arrayElimCell_95 v_arrayElimCell_94)) 0) (= (let ((.cse170 (+ .cse12 3 v_arrayElimCell_95 v_arrayElimCell_94))) (mod .cse170 .cse170)) 0) (= (let ((.cse171 (+ .cse12 4 v_arrayElimCell_94))) (mod .cse171 .cse171)) 0)))) (.cse22 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (let ((.cse168 (* 2 v_arrayElimCell_96))) (or (= (mod (+ .cse12 .cse168 v_arrayElimCell_95 v_arrayElimCell_94 1) (+ .cse12 2 v_arrayElimCell_96 v_arrayElimCell_95 v_arrayElimCell_94)) 0) (= (let ((.cse169 (+ .cse12 3 v_arrayElimCell_95 v_arrayElimCell_94))) (mod .cse169 .cse169)) 0) (= (mod (+ .cse12 .cse168 3) (+ .cse12 4 v_arrayElimCell_96)) 0))))) (.cse81 (or .cse0 .cse51)) (.cse25 (or .cse52 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (let ((.cse165 (* 2 v_arrayElimCell_96))) (or (= (mod (+ .cse12 .cse165 v_arrayElimCell_95 v_arrayElimCell_94 1) (+ .cse12 2 v_arrayElimCell_96 v_arrayElimCell_95 v_arrayElimCell_94)) 0) (= (let ((.cse166 (+ .cse12 3 v_arrayElimCell_95 v_arrayElimCell_94))) (mod .cse166 .cse166)) 0) (= (mod (+ .cse12 .cse165 3) (+ .cse12 4 v_arrayElimCell_96)) 0) (= (let ((.cse167 (+ .cse12 4 v_arrayElimCell_94))) (mod .cse167 .cse167)) 0)))))) (.cse39 (or (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (let ((.cse164 (* 2 v_arrayElimCell_96))) (or (= (mod (+ .cse12 .cse164 v_arrayElimCell_95 v_arrayElimCell_94 1) (+ .cse12 2 v_arrayElimCell_96 v_arrayElimCell_95 v_arrayElimCell_94)) 0) (= (mod (+ .cse12 .cse164 3) (+ .cse12 4 v_arrayElimCell_96)) 0)))) .cse17)) (.cse40 (or .cse0 .cse163)) (.cse41 (or .cse0 .cse36)) (.cse43 (or .cse0 .cse162)) (.cse44 (or .cse0 .cse131)) (.cse45 (or .cse0 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (let ((.cse161 (* 2 v_arrayElimCell_96))) (or (= (mod (+ .cse12 .cse161 2 v_arrayElimCell_95) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_95)) 0) (= (mod (+ .cse12 .cse161 2 v_arrayElimCell_94) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_94)) 0) (= (mod (+ .cse12 .cse161 3) (+ .cse12 4 v_arrayElimCell_96)) 0)))))) (.cse46 (or .cse0 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (let ((.cse159 (* 2 v_arrayElimCell_96))) (or (= (mod (+ .cse12 .cse159 2 v_arrayElimCell_95) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_95)) 0) (= (let ((.cse160 (+ .cse12 3 v_arrayElimCell_95 v_arrayElimCell_94))) (mod .cse160 .cse160)) 0) (= (mod (+ .cse12 .cse159 2 v_arrayElimCell_94) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_94)) 0) (= (mod (+ .cse12 .cse159 3) (+ .cse12 4 v_arrayElimCell_96)) 0)))))) (.cse42 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (let ((.cse158 (* 2 v_arrayElimCell_96))) (or (= (mod (+ .cse12 .cse158 2 v_arrayElimCell_95) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_95)) 0) (= (mod (+ .cse12 .cse158 v_arrayElimCell_95 v_arrayElimCell_94 1) (+ .cse12 2 v_arrayElimCell_96 v_arrayElimCell_95 v_arrayElimCell_94)) 0) (= (mod (+ .cse12 .cse158 3) (+ .cse12 4 v_arrayElimCell_96)) 0))))) (.cse47 (or .cse0 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (let ((.cse157 (* 2 v_arrayElimCell_96))) (or (= (mod (+ .cse12 .cse157 2 v_arrayElimCell_95) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_95)) 0) (= (mod (+ .cse12 .cse157 v_arrayElimCell_95 v_arrayElimCell_94 1) (+ .cse12 2 v_arrayElimCell_96 v_arrayElimCell_95 v_arrayElimCell_94)) 0) (= (mod (+ .cse12 .cse157 2 v_arrayElimCell_94) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_94)) 0) (= (mod (+ .cse12 .cse157 3) (+ .cse12 4 v_arrayElimCell_96)) 0)))))) (.cse88 (or .cse95 .cse0)) (.cse48 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_95 Int)) (= (let ((.cse156 (+ .cse12 3 v_arrayElimCell_95 v_arrayElimCell_94))) (mod .cse156 .cse156)) 0))) (.cse31 (or .cse0 .cse105 .cse9)) (.cse50 (or .cse92 .cse0)) (.cse27 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (let ((.cse154 (* 2 v_arrayElimCell_96))) (or (= (mod (+ .cse12 .cse154 2 v_arrayElimCell_95) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_95)) 0) (= (mod (+ .cse12 .cse154 v_arrayElimCell_95 v_arrayElimCell_94 1) (+ .cse12 2 v_arrayElimCell_96 v_arrayElimCell_95 v_arrayElimCell_94)) 0) (= (let ((.cse155 (+ .cse12 3 v_arrayElimCell_95 v_arrayElimCell_94))) (mod .cse155 .cse155)) 0) (= (mod (+ .cse12 .cse154 3) (+ .cse12 4 v_arrayElimCell_96)) 0))))) (.cse14 (forall ((v_arrayElimCell_96 Int)) (let ((.cse153 (* 2 v_arrayElimCell_96))) (or (forall ((v_arrayElimCell_95 Int)) (or (= (let ((.cse152 (+ .cse12 4 v_arrayElimCell_95))) (mod .cse152 .cse152)) 0) (= (mod (+ .cse12 .cse153 2 v_arrayElimCell_95) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_95)) 0))) (= (mod (+ .cse12 .cse153 3) (+ .cse12 4 v_arrayElimCell_96)) 0))))) (.cse26 (or (forall ((v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (let ((.cse151 (* 2 v_arrayElimCell_96))) (or (= (mod (+ .cse12 .cse151 2 v_arrayElimCell_95) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_95)) 0) (= (mod (+ .cse12 .cse151 3) (+ .cse12 4 v_arrayElimCell_96)) 0)))) .cse9)) (.cse15 (or .cse19 .cse37 .cse3)) (.cse96 (forall ((v_arrayElimCell_94 Int)) (or (forall ((v_arrayElimCell_95 Int)) (or (= (let ((.cse148 (+ .cse12 4 v_arrayElimCell_95))) (mod .cse148 .cse148)) 0) (= (let ((.cse149 (+ .cse12 3 v_arrayElimCell_95 v_arrayElimCell_94))) (mod .cse149 .cse149)) 0))) (= (let ((.cse150 (+ .cse12 4 v_arrayElimCell_94))) (mod .cse150 .cse150)) 0)))) (.cse54 (forall ((v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (let ((.cse147 (* 2 v_arrayElimCell_96))) (or (= (let ((.cse146 (+ .cse12 4 v_arrayElimCell_95))) (mod .cse146 .cse146)) 0) (= (mod (+ .cse12 .cse147 2 v_arrayElimCell_95) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_95)) 0) (= (mod (+ .cse12 .cse147 3) (+ .cse12 4 v_arrayElimCell_96)) 0))))) (.cse68 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (let ((.cse145 (* 2 v_arrayElimCell_96))) (or (= (let ((.cse144 (+ .cse12 4 v_arrayElimCell_95))) (mod .cse144 .cse144)) 0) (= (mod (+ .cse12 .cse145 2 v_arrayElimCell_95) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_95)) 0) (= (mod (+ .cse12 .cse145 v_arrayElimCell_95 v_arrayElimCell_94 1) (+ .cse12 2 v_arrayElimCell_96 v_arrayElimCell_95 v_arrayElimCell_94)) 0))))) (.cse114 (and (forall ((v_arrayElimCell_95 Int)) (or (= (let ((.cse141 (+ .cse12 4 v_arrayElimCell_95))) (mod .cse141 .cse141)) 0) (forall ((v_arrayElimCell_94 Int)) (or (= (let ((.cse142 (+ .cse12 3 v_arrayElimCell_95 v_arrayElimCell_94))) (mod .cse142 .cse142)) 0) (= (let ((.cse143 (+ .cse12 4 v_arrayElimCell_94))) (mod .cse143 .cse143)) 0))))) .cse104)) (.cse63 (or .cse0 .cse29 .cse2)) (.cse5 (or (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (or (= (let ((.cse140 (+ .cse12 4 v_arrayElimCell_95))) (mod .cse140 .cse140)) 0) (= (mod (+ .cse12 (* 2 v_arrayElimCell_96) v_arrayElimCell_95 v_arrayElimCell_94 1) (+ .cse12 2 v_arrayElimCell_96 v_arrayElimCell_95 v_arrayElimCell_94)) 0))) .cse17)) (.cse83 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (or (= (let ((.cse139 (+ .cse12 3 v_arrayElimCell_95 v_arrayElimCell_94))) (mod .cse139 .cse139)) 0) (= (mod (+ .cse12 (* 2 v_arrayElimCell_96) 2 v_arrayElimCell_94) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_94)) 0)))) (.cse7 (or (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (let ((.cse138 (* 2 v_arrayElimCell_96))) (or (= (let ((.cse137 (+ .cse12 4 v_arrayElimCell_95))) (mod .cse137 .cse137)) 0) (= (mod (+ .cse12 .cse138 v_arrayElimCell_95 v_arrayElimCell_94 1) (+ .cse12 2 v_arrayElimCell_96 v_arrayElimCell_95 v_arrayElimCell_94)) 0) (= (mod (+ .cse12 .cse138 2 v_arrayElimCell_94) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_94)) 0)))) .cse93)) (.cse89 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (let ((.cse136 (* 2 v_arrayElimCell_96))) (or (= (mod (+ .cse12 .cse136 v_arrayElimCell_95 v_arrayElimCell_94 1) (+ .cse12 2 v_arrayElimCell_96 v_arrayElimCell_95 v_arrayElimCell_94)) 0) (= (mod (+ .cse12 .cse136 2 v_arrayElimCell_94) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_94)) 0))))) (.cse76 (and .cse20 (forall ((v_arrayElimCell_94 Int)) (or (= (let ((.cse134 (+ .cse12 4 v_arrayElimCell_94))) (mod .cse134 .cse134)) 0) (forall ((v_arrayElimCell_95 Int)) (= (let ((.cse135 (+ .cse12 3 v_arrayElimCell_95 v_arrayElimCell_94))) (mod .cse135 .cse135)) 0)))))) (.cse61 (or (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (let ((.cse133 (* 2 v_arrayElimCell_96))) (or (= (let ((.cse132 (+ .cse12 4 v_arrayElimCell_95))) (mod .cse132 .cse132)) 0) (= (mod (+ .cse12 .cse133 v_arrayElimCell_95 v_arrayElimCell_94 1) (+ .cse12 2 v_arrayElimCell_96 v_arrayElimCell_95 v_arrayElimCell_94)) 0) (= (mod (+ .cse12 .cse133 2 v_arrayElimCell_94) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_94)) 0) (= (mod (+ .cse12 .cse133 3) (+ .cse12 4 v_arrayElimCell_96)) 0)))) .cse93)) (.cse72 (or .cse0 .cse131 .cse2 .cse3)) (.cse62 (or .cse16 .cse93)) (.cse53 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (let ((.cse130 (* 2 v_arrayElimCell_96))) (or (= (let ((.cse129 (+ .cse12 4 v_arrayElimCell_95))) (mod .cse129 .cse129)) 0) (= (mod (+ .cse12 .cse130 2 v_arrayElimCell_95) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_95)) 0) (= (mod (+ .cse12 .cse130 v_arrayElimCell_95 v_arrayElimCell_94 1) (+ .cse12 2 v_arrayElimCell_96 v_arrayElimCell_95 v_arrayElimCell_94)) 0) (= (mod (+ .cse12 .cse130 3) (+ .cse12 4 v_arrayElimCell_96)) 0))))) (.cse6 (or .cse0 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (or (= (let ((.cse127 (+ .cse12 4 v_arrayElimCell_95))) (mod .cse127 .cse127)) 0) (= (let ((.cse128 (+ .cse12 3 v_arrayElimCell_95 v_arrayElimCell_94))) (mod .cse128 .cse128)) 0) (= (mod (+ .cse12 (* 2 v_arrayElimCell_96) 2 v_arrayElimCell_94) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_94)) 0))) .cse2)) (.cse78 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (let ((.cse126 (* 2 v_arrayElimCell_96))) (or (= (let ((.cse125 (+ .cse12 4 v_arrayElimCell_95))) (mod .cse125 .cse125)) 0) (= (mod (+ .cse12 .cse126 2 v_arrayElimCell_95) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_95)) 0) (= (mod (+ .cse12 .cse126 v_arrayElimCell_95 v_arrayElimCell_94 1) (+ .cse12 2 v_arrayElimCell_96 v_arrayElimCell_95 v_arrayElimCell_94)) 0) (= (mod (+ .cse12 .cse126 2 v_arrayElimCell_94) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_94)) 0))))) (.cse8 (or .cse0 .cse30 .cse2)) (.cse67 (or (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (let ((.cse124 (* 2 v_arrayElimCell_96))) (or (= (let ((.cse123 (+ .cse12 4 v_arrayElimCell_95))) (mod .cse123 .cse123)) 0) (= (mod (+ .cse12 .cse124 v_arrayElimCell_95 v_arrayElimCell_94 1) (+ .cse12 2 v_arrayElimCell_96 v_arrayElimCell_95 v_arrayElimCell_94)) 0) (= (mod (+ .cse12 .cse124 3) (+ .cse12 4 v_arrayElimCell_96)) 0)))) .cse17)) (.cse21 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse55 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (or (= (let ((.cse121 (+ .cse12 4 v_arrayElimCell_95))) (mod .cse121 .cse121)) 0) (= (mod (+ .cse12 (* 2 v_arrayElimCell_96) v_arrayElimCell_95 v_arrayElimCell_94 1) (+ .cse12 2 v_arrayElimCell_96 v_arrayElimCell_95 v_arrayElimCell_94)) 0) (= (let ((.cse122 (+ .cse12 3 v_arrayElimCell_95 v_arrayElimCell_94))) (mod .cse122 .cse122)) 0)))) (.cse71 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (or (= (let ((.cse118 (+ .cse12 4 v_arrayElimCell_95))) (mod .cse118 .cse118)) 0) (= (mod (+ .cse12 (* 2 v_arrayElimCell_96) v_arrayElimCell_95 v_arrayElimCell_94 1) (+ .cse12 2 v_arrayElimCell_96 v_arrayElimCell_95 v_arrayElimCell_94)) 0) (= (let ((.cse119 (+ .cse12 3 v_arrayElimCell_95 v_arrayElimCell_94))) (mod .cse119 .cse119)) 0) (= (let ((.cse120 (+ .cse12 4 v_arrayElimCell_94))) (mod .cse120 .cse120)) 0))))) (and (or .cse0 .cse1 .cse2 .cse3) (or (and .cse4 .cse5 .cse6 .cse7 .cse8) .cse9) (or .cse10 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (let ((.cse13 (* 2 v_arrayElimCell_96))) (or (= (let ((.cse11 (+ .cse12 4 v_arrayElimCell_95))) (mod .cse11 .cse11)) 0) (= (mod (+ .cse12 .cse13 2 v_arrayElimCell_95) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_95)) 0) (= (mod (+ .cse12 .cse13 2 v_arrayElimCell_94) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_94)) 0) (= (mod (+ .cse12 .cse13 3) (+ .cse12 4 v_arrayElimCell_96)) 0))))) (or .cse10 (and .cse14 .cse15)) (or .cse16 .cse17) (or .cse16 .cse18) (or .cse19 .cse20 .cse2 .cse3) (or .cse21 (and (or .cse17 .cse22) .cse23 .cse24 .cse25 (or .cse10 (and .cse14 .cse26 .cse15)) (or .cse27 .cse10 .cse9) (or (and .cse28 (or .cse10 .cse29 .cse9) (or .cse10 .cse30)) .cse2) .cse31 .cse32 .cse33 (or (and .cse34 .cse35) .cse2) (or .cse36 .cse17) (or .cse19 .cse37 .cse38) (or (and (or .cse0 .cse27) .cse39 .cse40 .cse41 (or .cse10 .cse42) .cse43 .cse44 .cse45 .cse46 .cse47) .cse9) (or .cse48 .cse37 .cse2 .cse18) (or .cse37 .cse2 .cse18 .cse49) .cse50)) (or .cse10 .cse51) (or .cse52 .cse53) (or .cse10 .cse20 .cse54) (or .cse55 .cse18) (or .cse56 .cse10) (or .cse19 .cse57) (or .cse58 .cse2 .cse18) (or .cse19 .cse16) (or (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (or (= (let ((.cse59 (+ .cse12 4 v_arrayElimCell_95))) (mod .cse59 .cse59)) 0) (= (mod (+ .cse12 (* 2 v_arrayElimCell_96) v_arrayElimCell_95 v_arrayElimCell_94 1) (+ .cse12 2 v_arrayElimCell_96 v_arrayElimCell_95 v_arrayElimCell_94)) 0) (= (let ((.cse60 (+ .cse12 4 v_arrayElimCell_94))) (mod .cse60 .cse60)) 0))) .cse2 .cse18) (or (and .cse61 .cse62 .cse63 .cse64 .cse65 .cse66 .cse67) .cse9) (or .cse10 .cse68) (or .cse10 (and .cse69 .cse70)) (or .cse52 .cse57) (or .cse37 .cse20 .cse2 .cse3 .cse18) (or .cse0 .cse1 .cse2) (or .cse19 .cse71) (or (and .cse61 .cse72 .cse73 .cse6 .cse8 .cse67) .cse9) (or .cse71 .cse17) (or (and .cse4 .cse5 .cse6 .cse7) .cse9) (or (and (<= 0 .cse74) .cse75) .cse51) (or .cse19 .cse2 .cse76) (or .cse58 .cse37 .cse2 .cse18) (or .cse52 .cse71) (or (and .cse61 .cse72 .cse62 .cse6 .cse67) .cse9) (or .cse0 .cse2 .cse77) (or .cse78 .cse10) (or .cse58 .cse18) (or .cse55 .cse2 .cse18) (or .cse10 .cse79) (or (and .cse61 .cse72 .cse73 .cse6 .cse67) .cse9) (or .cse21 (and (or (and .cse69 .cse70 (or (forall ((v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (= (mod (+ .cse12 (* 2 v_arrayElimCell_96) 2 v_arrayElimCell_95) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_95)) 0)) .cse9)) .cse10) (or .cse80 .cse0) .cse34 .cse81 (or .cse0 .cse77) (or .cse48 .cse18) .cse28 (or .cse19 .cse38) .cse31 (or (and (or .cse0 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (let ((.cse82 (* 2 v_arrayElimCell_96))) (or (= (mod (+ .cse12 .cse82 2 v_arrayElimCell_95) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_95)) 0) (= (mod (+ .cse12 .cse82 v_arrayElimCell_95 v_arrayElimCell_94 1) (+ .cse12 2 v_arrayElimCell_96 v_arrayElimCell_95 v_arrayElimCell_94)) 0) (= (mod (+ .cse12 .cse82 2 v_arrayElimCell_94) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_94)) 0))))) (or .cse83 .cse0) (or (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (let ((.cse84 (* 2 v_arrayElimCell_96))) (or (= (mod (+ .cse12 .cse84 2 v_arrayElimCell_95) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_95)) 0) (= (mod (+ .cse12 .cse84 v_arrayElimCell_95 v_arrayElimCell_94 1) (+ .cse12 2 v_arrayElimCell_96 v_arrayElimCell_95 v_arrayElimCell_94)) 0)))) .cse10) (or .cse0 .cse85) (or (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (= (mod (+ .cse12 (* 2 v_arrayElimCell_96) v_arrayElimCell_95 v_arrayElimCell_94 1) (+ .cse12 2 v_arrayElimCell_96 v_arrayElimCell_95 v_arrayElimCell_94)) 0)) .cse17) (or .cse0 .cse29) (or (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (let ((.cse86 (* 2 v_arrayElimCell_96))) (or (= (mod (+ .cse12 .cse86 2 v_arrayElimCell_95) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_95)) 0) (= (let ((.cse87 (+ .cse12 3 v_arrayElimCell_95 v_arrayElimCell_94))) (mod .cse87 .cse87)) 0) (= (mod (+ .cse12 .cse86 2 v_arrayElimCell_94) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_94)) 0)))) .cse0) .cse88 (or .cse0 .cse89) (or .cse0 (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_96 Int) (v_arrayElimCell_95 Int)) (let ((.cse90 (* 2 v_arrayElimCell_96))) (or (= (mod (+ .cse12 .cse90 2 v_arrayElimCell_95) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_95)) 0) (= (mod (+ .cse12 .cse90 2 v_arrayElimCell_94) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_94)) 0)))))) .cse9) .cse32 .cse35 (or .cse91 .cse18) .cse33 (or .cse0 .cse1) (or .cse18 .cse49))) (or .cse92 .cse3 .cse93) (or .cse20 .cse2 .cse3 .cse18) (or (and .cse61 .cse63 .cse64 .cse65 .cse66 (or .cse36 .cse93) .cse67) .cse9) (or .cse80 .cse0 .cse2) (or .cse19 .cse37 .cse20 .cse2 .cse3) (or .cse57 .cse17) (or .cse78 .cse52) (or .cse53 .cse10) (or .cse21 (and (or .cse56 .cse52) (or .cse2 .cse18 .cse49) (or .cse2 .cse18 .cse77) .cse23 .cse24 (or .cse91 .cse2 .cse18) (or .cse52 .cse22) .cse81 .cse25 (or (and .cse39 .cse40 .cse41 .cse43 .cse44 .cse45 .cse46 (or .cse42 .cse17) .cse47 .cse88) .cse9) (or .cse48 .cse2 .cse18) .cse31 (or .cse27 .cse52) (or .cse94 .cse2 .cse18) (or .cse52 .cse36) (or .cse95 .cse52) (or .cse19 .cse37 (and .cse96 .cse20 .cse49)) (or .cse97 .cse52) (or .cse29 .cse2 .cse18) (or .cse2 .cse18 .cse98) .cse50)) (or .cse99 .cse18) (or (and (or .cse27 .cse9) .cse14 (forall ((v_arrayElimCell_96 Int)) (let ((.cse100 (* 2 v_arrayElimCell_96))) (or (= (mod (+ .cse12 .cse100 3) (+ .cse12 4 v_arrayElimCell_96)) 0) (forall ((v_arrayElimCell_94 Int)) (or (forall ((v_arrayElimCell_95 Int)) (= (mod (+ .cse12 .cse100 v_arrayElimCell_95 v_arrayElimCell_94 1) (+ .cse12 2 v_arrayElimCell_96 v_arrayElimCell_95 v_arrayElimCell_94)) 0)) (= (mod (+ .cse12 .cse100 2 v_arrayElimCell_94) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_94)) 0) (= (let ((.cse101 (+ .cse12 4 v_arrayElimCell_94))) (mod .cse101 .cse101)) 0)))))) .cse26 .cse15 (forall ((v_arrayElimCell_96 Int)) (let ((.cse103 (* 2 v_arrayElimCell_96))) (or (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_95 Int)) (or (= (let ((.cse102 (+ .cse12 4 v_arrayElimCell_95))) (mod .cse102 .cse102)) 0) (= (mod (+ .cse12 .cse103 2 v_arrayElimCell_95) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_95)) 0) (= (mod (+ .cse12 .cse103 v_arrayElimCell_95 v_arrayElimCell_94 1) (+ .cse12 2 v_arrayElimCell_96 v_arrayElimCell_95 v_arrayElimCell_94)) 0))) (= (mod (+ .cse12 .cse103 3) (+ .cse12 4 v_arrayElimCell_96)) 0)))) (or .cse97 .cse9) (or .cse95 .cse9) (or (and .cse104 .cse96) .cse19 .cse37) (or .cse20 .cse54) (or .cse105 .cse9) (forall ((v_arrayElimCell_96 Int)) (let ((.cse106 (* 2 v_arrayElimCell_96))) (or (= (mod (+ .cse12 .cse106 3) (+ .cse12 4 v_arrayElimCell_96)) 0) (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_95 Int)) (or (= (mod (+ .cse12 .cse106 v_arrayElimCell_95 v_arrayElimCell_94 1) (+ .cse12 2 v_arrayElimCell_96 v_arrayElimCell_95 v_arrayElimCell_94)) 0) (= (mod (+ .cse12 .cse106 2 v_arrayElimCell_94) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_94)) 0) (= (let ((.cse107 (+ .cse12 4 v_arrayElimCell_94))) (mod .cse107 .cse107)) 0)))))) (forall ((v_arrayElimCell_96 Int)) (let ((.cse108 (* 2 v_arrayElimCell_96))) (or (forall ((v_arrayElimCell_94 Int)) (= (mod (+ .cse12 .cse108 2 v_arrayElimCell_94) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_94)) 0)) (forall ((v_arrayElimCell_95 Int)) (or (= (let ((.cse109 (+ .cse12 4 v_arrayElimCell_95))) (mod .cse109 .cse109)) 0) (= (mod (+ .cse12 .cse108 2 v_arrayElimCell_95) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_95)) 0))) (= (mod (+ .cse12 .cse108 3) (+ .cse12 4 v_arrayElimCell_96)) 0)))) (or .cse78 .cse9) (or (and (forall ((v_arrayElimCell_96 Int)) (let ((.cse110 (* 2 v_arrayElimCell_96))) (or (forall ((v_arrayElimCell_95 Int)) (or (forall ((v_arrayElimCell_94 Int)) (or (= (mod (+ .cse12 .cse110 v_arrayElimCell_95 v_arrayElimCell_94 1) (+ .cse12 2 v_arrayElimCell_96 v_arrayElimCell_95 v_arrayElimCell_94)) 0) (= (let ((.cse111 (+ .cse12 3 v_arrayElimCell_95 v_arrayElimCell_94))) (mod .cse111 .cse111)) 0))) (= (mod (+ .cse12 .cse110 2 v_arrayElimCell_95) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_95)) 0))) (= (mod (+ .cse12 .cse110 3) (+ .cse12 4 v_arrayElimCell_96)) 0)))) (forall ((v_arrayElimCell_96 Int)) (let ((.cse112 (* 2 v_arrayElimCell_96))) (or (forall ((v_arrayElimCell_95 Int)) (or (forall ((v_arrayElimCell_94 Int)) (or (= (mod (+ .cse12 .cse112 v_arrayElimCell_95 v_arrayElimCell_94 1) (+ .cse12 2 v_arrayElimCell_96 v_arrayElimCell_95 v_arrayElimCell_94)) 0) (= (mod (+ .cse12 .cse112 2 v_arrayElimCell_94) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_94)) 0))) (= (mod (+ .cse12 .cse112 2 v_arrayElimCell_95) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_95)) 0))) (= (mod (+ .cse12 .cse112 3) (+ .cse12 4 v_arrayElimCell_96)) 0)))) (forall ((v_arrayElimCell_96 Int)) (let ((.cse113 (* 2 v_arrayElimCell_96))) (or (forall ((v_arrayElimCell_94 Int) (v_arrayElimCell_95 Int)) (or (= (mod (+ .cse12 .cse113 2 v_arrayElimCell_95) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_95)) 0) (= (mod (+ .cse12 .cse113 v_arrayElimCell_95 v_arrayElimCell_94 1) (+ .cse12 2 v_arrayElimCell_96 v_arrayElimCell_95 v_arrayElimCell_94)) 0))) (= (mod (+ .cse12 .cse113 3) (+ .cse12 4 v_arrayElimCell_96)) 0))))) .cse9)) .cse10) (or .cse93 .cse79) (or .cse114 .cse19 .cse37) (or .cse2 .cse68 .cse18) (or .cse114 .cse19) (or (and .cse62 (or .cse0 .cse85 .cse2) .cse63 .cse5 (or .cse83 .cse0 .cse2) .cse7 (or .cse0 .cse89 .cse2)) .cse9) (or .cse19 .cse37 .cse2 .cse76) (or .cse55 .cse19) (or .cse52 .cse16) (or (and .cse61 .cse72 .cse62 (or .cse53 .cse17) .cse6 (or .cse78 .cse93) .cse8 .cse67) .cse9) (or (not .cse21) .cse2) (or .cse71 .cse18) (or .cse55 .cse17) (or .cse93 .cse51) (or (and (forall ((v_arrayElimCell_95 Int)) (or (= (let ((.cse115 (+ .cse12 4 v_arrayElimCell_95))) (mod .cse115 .cse115)) 0) (forall ((v_arrayElimCell_94 Int)) (or (forall ((v_arrayElimCell_96 Int)) (let ((.cse116 (* 2 v_arrayElimCell_96))) (or (= (mod (+ .cse12 .cse116 2 v_arrayElimCell_95) (+ .cse12 3 v_arrayElimCell_96 v_arrayElimCell_95)) 0) (= (mod (+ .cse12 .cse116 v_arrayElimCell_95 v_arrayElimCell_94 1) (+ .cse12 2 v_arrayElimCell_96 v_arrayElimCell_95 v_arrayElimCell_94)) 0)))) (= (let ((.cse117 (+ .cse12 4 v_arrayElimCell_94))) (mod .cse117 .cse117)) 0))))) .cse71) .cse52))))))) is different from true [2024-10-13 22:34:20,294 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-10-13 22:34:20,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 22:34:20,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204618347] [2024-10-13 22:34:20,294 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 22:34:20,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710536842] [2024-10-13 22:34:20,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710536842] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 22:34:20,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 22:34:20,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-13 22:34:20,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644620478] [2024-10-13 22:34:20,294 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 22:34:20,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-13 22:34:20,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 22:34:20,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-13 22:34:20,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=2032, Unknown=14, NotChecked=94, Total=2450 [2024-10-13 22:34:20,296 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 50 states, 50 states have (on average 1.16) internal successors, (58), 50 states have internal predecessors, (58), 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)