./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/mods.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 18:25:30,341 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 18:25:30,446 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 18:25:30,452 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 18:25:30,454 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 18:25:30,483 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 18:25:30,484 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 18:25:30,484 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 18:25:30,485 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 18:25:30,486 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 18:25:30,487 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 18:25:30,487 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 18:25:30,488 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 18:25:30,490 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 18:25:30,490 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 18:25:30,490 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 18:25:30,491 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 18:25:30,491 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 18:25:30,491 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 18:25:30,491 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 18:25:30,492 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 18:25:30,496 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 18:25:30,497 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 18:25:30,497 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 18:25:30,497 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 18:25:30,497 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 18:25:30,497 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 18:25:30,498 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 18:25:30,498 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 18:25:30,498 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 18:25:30,498 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 18:25:30,499 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 18:25:30,499 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:25:30,499 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 18:25:30,499 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 18:25:30,499 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 18:25:30,500 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 18:25:30,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 18:25:30,501 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 18:25:30,502 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 18:25:30,502 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 18:25:30,502 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 18:25:30,503 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-11-09 18:25:30,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 18:25:30,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 18:25:30,829 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 18:25:30,831 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 18:25:30,831 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 18:25:30,833 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/mods.c [2024-11-09 18:25:32,343 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 18:25:32,549 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 18:25:32,550 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/mods.c [2024-11-09 18:25:32,559 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57148c76e/e13d6c58880e459f9089a52c3afb87ed/FLAGbf084e522 [2024-11-09 18:25:32,573 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57148c76e/e13d6c58880e459f9089a52c3afb87ed [2024-11-09 18:25:32,576 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 18:25:32,578 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 18:25:32,580 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 18:25:32,580 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 18:25:32,584 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 18:25:32,585 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:25:32" (1/1) ... [2024-11-09 18:25:32,586 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45c227fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:25:32, skipping insertion in model container [2024-11-09 18:25:32,587 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:25:32" (1/1) ... [2024-11-09 18:25:32,608 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 18:25:32,801 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/mods.c[587,600] [2024-11-09 18:25:32,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:25:32,847 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 18:25:32,862 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/mods.c[587,600] [2024-11-09 18:25:32,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:25:32,901 INFO L204 MainTranslator]: Completed translation [2024-11-09 18:25:32,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:25:32 WrapperNode [2024-11-09 18:25:32,902 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 18:25:32,903 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 18:25:32,903 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 18:25:32,903 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 18:25:32,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:25:32" (1/1) ... [2024-11-09 18:25:32,925 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:25:32" (1/1) ... [2024-11-09 18:25:32,949 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 99 [2024-11-09 18:25:32,951 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 18:25:32,952 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 18:25:32,953 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 18:25:32,953 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 18:25:32,965 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:25:32" (1/1) ... [2024-11-09 18:25:32,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:25:32" (1/1) ... [2024-11-09 18:25:32,971 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:25:32" (1/1) ... [2024-11-09 18:25:32,986 INFO L175 MemorySlicer]: Split 21 memory accesses to 4 slices as follows [2, 7, 7, 5]. 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, 3, 2]. [2024-11-09 18:25:32,991 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:25:32" (1/1) ... [2024-11-09 18:25:32,992 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:25:32" (1/1) ... [2024-11-09 18:25:32,999 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:25:32" (1/1) ... [2024-11-09 18:25:33,004 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:25:32" (1/1) ... [2024-11-09 18:25:33,006 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:25:32" (1/1) ... [2024-11-09 18:25:33,007 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:25:32" (1/1) ... [2024-11-09 18:25:33,009 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 18:25:33,013 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 18:25:33,013 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 18:25:33,015 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 18:25:33,016 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:25:32" (1/1) ... [2024-11-09 18:25:33,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:25:33,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:25:33,051 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 18:25:33,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 18:25:33,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 18:25:33,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 18:25:33,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 18:25:33,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 18:25:33,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 18:25:33,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 18:25:33,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 18:25:33,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 18:25:33,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 18:25:33,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 18:25:33,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 18:25:33,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 18:25:33,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 18:25:33,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 18:25:33,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 18:25:33,098 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 18:25:33,099 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 18:25:33,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 18:25:33,177 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 18:25:33,179 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 18:25:33,345 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L28: call ULTIMATE.dealloc(main_~#sum~0#1.base, main_~#sum~0#1.offset);havoc main_~#sum~0#1.base, main_~#sum~0#1.offset; [2024-11-09 18:25:33,352 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-09 18:25:33,352 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 18:25:33,366 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 18:25:33,366 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 18:25:33,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:25:33 BoogieIcfgContainer [2024-11-09 18:25:33,367 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 18:25:33,369 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 18:25:33,369 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 18:25:33,371 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 18:25:33,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:25:32" (1/3) ... [2024-11-09 18:25:33,372 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a84f9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:25:33, skipping insertion in model container [2024-11-09 18:25:33,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:25:32" (2/3) ... [2024-11-09 18:25:33,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a84f9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:25:33, skipping insertion in model container [2024-11-09 18:25:33,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:25:33" (3/3) ... [2024-11-09 18:25:33,374 INFO L112 eAbstractionObserver]: Analyzing ICFG mods.c [2024-11-09 18:25:33,388 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 18:25:33,388 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 18:25:33,448 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 18:25:33,456 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;@22566a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 18:25:33,456 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 18:25:33,460 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 28 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-11-09 18:25:33,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 18:25:33,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:25:33,466 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:25:33,467 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:25:33,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:25:33,472 INFO L85 PathProgramCache]: Analyzing trace with hash -618093490, now seen corresponding path program 1 times [2024-11-09 18:25:33,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:25:33,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565198483] [2024-11-09 18:25:33,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:25:33,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:25:33,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:25:33,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:25:33,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:25:33,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565198483] [2024-11-09 18:25:33,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565198483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:25:33,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:25:33,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:25:33,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567557786] [2024-11-09 18:25:33,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:25:33,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 18:25:33,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:25:33,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 18:25:33,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 18:25:33,693 INFO L87 Difference]: Start difference. First operand has 29 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 28 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) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:25:33,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:25:33,726 INFO L93 Difference]: Finished difference Result 53 states and 75 transitions. [2024-11-09 18:25:33,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 18:25:33,729 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-09 18:25:33,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:25:33,735 INFO L225 Difference]: With dead ends: 53 [2024-11-09 18:25:33,735 INFO L226 Difference]: Without dead ends: 24 [2024-11-09 18:25:33,737 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-11-09 18:25:33,740 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 18:25:33,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 18:25:33,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-09 18:25:33,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-09 18:25:33,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:25:33,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-11-09 18:25:33,784 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 18 [2024-11-09 18:25:33,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:25:33,785 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-11-09 18:25:33,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:25:33,785 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-11-09 18:25:33,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 18:25:33,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:25:33,787 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:25:33,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 18:25:33,788 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:25:33,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:25:33,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1049713915, now seen corresponding path program 1 times [2024-11-09 18:25:33,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:25:33,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489555987] [2024-11-09 18:25:33,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:25:33,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:25:33,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:25:33,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:25:33,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:25:33,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489555987] [2024-11-09 18:25:33,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489555987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:25:33,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:25:33,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 18:25:33,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764261462] [2024-11-09 18:25:33,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:25:33,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:25:33,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:25:33,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:25:33,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:25:33,997 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:25:34,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:25:34,087 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2024-11-09 18:25:34,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 18:25:34,088 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-09 18:25:34,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:25:34,089 INFO L225 Difference]: With dead ends: 56 [2024-11-09 18:25:34,091 INFO L226 Difference]: Without dead ends: 39 [2024-11-09 18:25:34,092 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-11-09 18:25:34,094 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 46 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:25:34,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 27 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 18:25:34,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-09 18:25:34,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2024-11-09 18:25:34,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:25:34,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-11-09 18:25:34,107 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 22 [2024-11-09 18:25:34,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:25:34,107 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-11-09 18:25:34,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:25:34,108 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2024-11-09 18:25:34,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 18:25:34,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:25:34,109 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:25:34,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 18:25:34,111 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:25:34,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:25:34,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1099019653, now seen corresponding path program 1 times [2024-11-09 18:25:34,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:25:34,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469104060] [2024-11-09 18:25:34,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:25:34,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:25:34,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 18:25:34,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [455093117] [2024-11-09 18:25:34,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:25:34,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:25:34,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:25:34,269 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 18:25:34,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 18:25:34,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:25:34,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-09 18:25:34,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:25:34,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 18:25:34,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 18:25:34,712 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-11-09 18:25:34,827 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-11-09 18:25:34,953 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-11-09 18:25:35,049 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:25:35,051 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:25:35,700 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-11-09 18:25:35,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2024-11-09 18:25:35,817 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:25:35,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:25:35,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469104060] [2024-11-09 18:25:35,819 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 18:25:35,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455093117] [2024-11-09 18:25:35,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455093117] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:25:35,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 18:25:35,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2024-11-09 18:25:35,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649550799] [2024-11-09 18:25:35,821 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 18:25:35,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 18:25:35,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:25:35,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 18:25:35,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2024-11-09 18:25:35,828 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 23 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:25:36,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:25:36,522 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2024-11-09 18:25:36,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 18:25:36,523 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 23 states have internal predecessors, (56), 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 30 [2024-11-09 18:25:36,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:25:36,524 INFO L225 Difference]: With dead ends: 70 [2024-11-09 18:25:36,526 INFO L226 Difference]: Without dead ends: 67 [2024-11-09 18:25:36,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2024-11-09 18:25:36,527 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 67 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 18:25:36,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 336 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 18:25:36,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-09 18:25:36,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2024-11-09 18:25:36,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.183673469387755) internal successors, (58), 49 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) [2024-11-09 18:25:36,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2024-11-09 18:25:36,548 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 30 [2024-11-09 18:25:36,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:25:36,548 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2024-11-09 18:25:36,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:25:36,549 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2024-11-09 18:25:36,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 18:25:36,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:25:36,550 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:25:36,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 18:25:36,750 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-11-09 18:25:36,751 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:25:36,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:25:36,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1808626044, now seen corresponding path program 2 times [2024-11-09 18:25:36,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:25:36,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986826697] [2024-11-09 18:25:36,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:25:36,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:25:36,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:25:36,934 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 18:25:36,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:25:36,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986826697] [2024-11-09 18:25:36,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986826697] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:25:36,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292953689] [2024-11-09 18:25:36,935 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 18:25:36,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:25:36,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:25:36,937 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 18:25:36,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 18:25:37,010 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 18:25:37,011 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 18:25:37,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 18:25:37,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:25:37,083 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 18:25:37,084 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:25:37,142 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 18:25:37,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292953689] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:25:37,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 18:25:37,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-11-09 18:25:37,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040386233] [2024-11-09 18:25:37,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 18:25:37,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 18:25:37,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:25:37,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 18:25:37,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-09 18:25:37,145 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 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-11-09 18:25:37,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:25:37,380 INFO L93 Difference]: Finished difference Result 112 states and 129 transitions. [2024-11-09 18:25:37,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 18:25:37,381 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 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) Word has length 32 [2024-11-09 18:25:37,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:25:37,381 INFO L225 Difference]: With dead ends: 112 [2024-11-09 18:25:37,381 INFO L226 Difference]: Without dead ends: 54 [2024-11-09 18:25:37,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2024-11-09 18:25:37,383 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 130 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 18:25:37,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 217 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 18:25:37,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-09 18:25:37,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 40. [2024-11-09 18:25:37,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:25:37,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2024-11-09 18:25:37,391 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 32 [2024-11-09 18:25:37,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:25:37,391 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2024-11-09 18:25:37,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 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-11-09 18:25:37,392 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2024-11-09 18:25:37,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-09 18:25:37,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:25:37,393 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:25:37,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 18:25:37,596 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-11-09 18:25:37,597 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:25:37,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:25:37,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1690203909, now seen corresponding path program 3 times [2024-11-09 18:25:37,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:25:37,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774883243] [2024-11-09 18:25:37,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:25:37,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:25:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 18:25:37,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [32898486] [2024-11-09 18:25:37,684 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 18:25:37,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:25:37,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:25:37,686 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 18:25:37,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 18:25:37,772 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 18:25:37,772 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 18:25:37,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-09 18:25:37,784 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:25:37,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 18:25:37,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 18:25:37,933 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 18:25:37,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-11-09 18:25:38,149 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-11-09 18:25:38,210 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 27 treesize of output 19 [2024-11-09 18:25:38,423 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-11-09 18:25:38,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 29 [2024-11-09 18:25:38,565 INFO L349 Elim1Store]: treesize reduction 42, result has 52.8 percent of original size [2024-11-09 18:25:38,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 44 treesize of output 68 [2024-11-09 18:25:39,076 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 158 treesize of output 120 [2024-11-09 18:25:39,104 INFO L349 Elim1Store]: treesize reduction 52, result has 24.6 percent of original size [2024-11-09 18:25:39,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 120 treesize of output 113 [2024-11-09 18:25:39,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-09 18:25:39,356 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 149 treesize of output 115 [2024-11-09 18:25:39,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 18:25:39,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 18:25:39,395 INFO L349 Elim1Store]: treesize reduction 53, result has 32.9 percent of original size [2024-11-09 18:25:39,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 128 [2024-11-09 18:25:39,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 18:25:39,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 18:25:39,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 18:25:39,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 46 treesize of output 36 [2024-11-09 18:25:40,282 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:25:40,282 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:25:42,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 192 treesize of output 178 [2024-11-09 18:25:42,729 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 344 treesize of output 332 [2024-11-09 18:25:42,860 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:25:42,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:25:42,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774883243] [2024-11-09 18:25:42,861 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 18:25:42,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32898486] [2024-11-09 18:25:42,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32898486] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:25:42,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 18:25:42,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 39 [2024-11-09 18:25:42,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332483083] [2024-11-09 18:25:42,862 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 18:25:42,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-09 18:25:42,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:25:42,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-09 18:25:42,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1278, Unknown=5, NotChecked=0, Total=1482 [2024-11-09 18:25:42,866 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 39 states, 39 states have (on average 1.8461538461538463) internal successors, (72), 39 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:26:16,809 WARN L286 SmtUtils]: Spent 27.51s on a formula simplification. DAG size of input: 119 DAG size of output: 101 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 18:26:29,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:26:29,366 INFO L93 Difference]: Finished difference Result 117 states and 130 transitions. [2024-11-09 18:26:29,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-09 18:26:29,368 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.8461538461538463) internal successors, (72), 39 states have internal predecessors, (72), 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 38 [2024-11-09 18:26:29,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:26:29,369 INFO L225 Difference]: With dead ends: 117 [2024-11-09 18:26:29,369 INFO L226 Difference]: Without dead ends: 114 [2024-11-09 18:26:29,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 47.0s TimeCoverageRelationStatistics Valid=648, Invalid=3769, Unknown=5, NotChecked=0, Total=4422 [2024-11-09 18:26:29,371 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 235 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 18:26:29,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 458 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-09 18:26:29,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-09 18:26:29,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 71. [2024-11-09 18:26:29,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.1571428571428573) internal successors, (81), 70 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:26:29,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2024-11-09 18:26:29,393 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 38 [2024-11-09 18:26:29,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:26:29,394 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2024-11-09 18:26:29,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.8461538461538463) internal successors, (72), 39 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:26:29,394 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2024-11-09 18:26:29,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 18:26:29,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:26:29,395 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:26:29,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 18:26:29,595 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-11-09 18:26:29,596 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:26:29,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:26:29,596 INFO L85 PathProgramCache]: Analyzing trace with hash 766544004, now seen corresponding path program 4 times [2024-11-09 18:26:29,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:26:29,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238170960] [2024-11-09 18:26:29,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:26:29,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:26:29,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:26:29,788 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 18:26:29,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:26:29,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238170960] [2024-11-09 18:26:29,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238170960] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:26:29,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438985464] [2024-11-09 18:26:29,788 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 18:26:29,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:26:29,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:26:29,790 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 18:26:29,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 18:26:29,853 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 18:26:29,854 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 18:26:29,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 18:26:29,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:26:29,956 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 18:26:29,956 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:26:30,046 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 18:26:30,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438985464] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:26:30,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 18:26:30,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2024-11-09 18:26:30,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999195803] [2024-11-09 18:26:30,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 18:26:30,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 18:26:30,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:26:30,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 18:26:30,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2024-11-09 18:26:30,048 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:26:30,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:26:30,369 INFO L93 Difference]: Finished difference Result 157 states and 176 transitions. [2024-11-09 18:26:30,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 18:26:30,370 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 states have internal predecessors, (61), 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 40 [2024-11-09 18:26:30,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:26:30,371 INFO L225 Difference]: With dead ends: 157 [2024-11-09 18:26:30,371 INFO L226 Difference]: Without dead ends: 101 [2024-11-09 18:26:30,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=700, Unknown=0, NotChecked=0, Total=870 [2024-11-09 18:26:30,373 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 296 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 18:26:30,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 354 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 18:26:30,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-09 18:26:30,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 77. [2024-11-09 18:26:30,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 76 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:26:30,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2024-11-09 18:26:30,393 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 40 [2024-11-09 18:26:30,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:26:30,394 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2024-11-09 18:26:30,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.210526315789474) internal successors, (61), 19 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:26:30,394 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2024-11-09 18:26:30,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 18:26:30,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:26:30,404 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:26:30,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 18:26:30,604 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-11-09 18:26:30,605 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:26:30,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:26:30,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1854176948, now seen corresponding path program 1 times [2024-11-09 18:26:30,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:26:30,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274586020] [2024-11-09 18:26:30,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:26:30,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:26:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:26:32,774 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:26:32,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:26:32,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274586020] [2024-11-09 18:26:32,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274586020] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:26:32,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319174515] [2024-11-09 18:26:32,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:26:32,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:26:32,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:26:32,778 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 18:26:32,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 18:26:32,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:26:32,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-09 18:26:32,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:26:32,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 18:26:32,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 18:26:32,934 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-11-09 18:26:33,040 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-11-09 18:26:33,096 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-11-09 18:26:33,205 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 18:26:33,206 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-11-09 18:26:33,264 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 18:26:33,264 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-11-09 18:26:33,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 18:26:33,403 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-11-09 18:26:33,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 18:26:33,463 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-11-09 18:26:33,696 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:26:33,696 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 18:26:49,158 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 205 treesize of output 189 [2024-11-09 18:26:49,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 18:26:49,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1049 treesize of output 953 [2024-11-09 18:26:51,780 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 282 treesize of output 258 [2024-11-09 18:26:51,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 18:26:51,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1064 treesize of output 940 [2024-11-09 18:26:52,297 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 275 treesize of output 251 [2024-11-09 18:26:52,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 18:26:52,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1014 treesize of output 898 [2024-11-09 18:26:53,489 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (= (+ |c_ULTIMATE.start_main_~i~0#1| 1) 0)) (.cse8 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse0 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse4 (not .cse8)) (.cse1 (select (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse24 (not .cse5))) (and (or .cse0 (and (or (forall ((v_arrayElimCell_43 Int)) (let ((.cse2 (* 2 v_arrayElimCell_43)) (.cse3 (+ .cse1 2 v_arrayElimCell_43))) (or (< 0 (+ .cse1 2 .cse2)) (< .cse3 (mod (+ .cse1 .cse2 1) .cse3)) (= (mod .cse3 .cse3) 0)))) .cse4) (or .cse5 (and (or (forall ((v_arrayElimCell_43 Int) (v_arrayElimCell_42 Int)) (let ((.cse6 (+ .cse1 v_arrayElimCell_43 v_arrayElimCell_42 1)) (.cse7 (* 2 v_arrayElimCell_43))) (or (= (mod (+ .cse1 v_arrayElimCell_43 (* 2 v_arrayElimCell_42)) .cse6) 0) (< .cse6 (mod (+ .cse1 .cse7 v_arrayElimCell_42) .cse6)) (< 0 (+ .cse1 .cse7 v_arrayElimCell_42 1))))) .cse8) (or (forall ((v_arrayElimCell_43 Int) (v_arrayElimCell_42 Int)) (let ((.cse9 (+ .cse1 v_arrayElimCell_43 v_arrayElimCell_42 1)) (.cse10 (* 2 v_arrayElimCell_43))) (or (= (mod (+ .cse1 v_arrayElimCell_43 (* 2 v_arrayElimCell_42)) .cse9) 0) (< 0 (+ .cse1 2 .cse10)) (< .cse9 (mod (+ .cse1 .cse10 v_arrayElimCell_42) .cse9)) (let ((.cse11 (+ .cse1 2 v_arrayElimCell_43))) (< .cse11 (mod (+ .cse1 .cse10 1) .cse11))) (< 0 (+ .cse1 .cse10 v_arrayElimCell_42 1))))) .cse8) (or (forall ((v_arrayElimCell_43 Int) (v_arrayElimCell_42 Int)) (let ((.cse12 (+ .cse1 v_arrayElimCell_43 v_arrayElimCell_42 1)) (.cse13 (* 2 v_arrayElimCell_43))) (or (= (mod (+ .cse1 v_arrayElimCell_43 (* 2 v_arrayElimCell_42)) .cse12) 0) (< 0 (+ .cse1 2 .cse13)) (< .cse12 (mod (+ .cse1 .cse13 v_arrayElimCell_42) .cse12)) (< 0 (+ .cse1 .cse13 v_arrayElimCell_42 1))))) .cse8) (forall ((v_arrayElimCell_43 Int) (v_arrayElimCell_42 Int)) (let ((.cse14 (* 2 v_arrayElimCell_43)) (.cse15 (+ .cse1 2 v_arrayElimCell_43))) (or (= (mod (+ .cse1 v_arrayElimCell_43 (* 2 v_arrayElimCell_42)) (+ .cse1 v_arrayElimCell_43 v_arrayElimCell_42 1)) 0) (< 0 (+ .cse1 2 .cse14)) (< .cse15 (mod (+ .cse1 .cse14 1) .cse15)) (= (mod .cse15 .cse15) 0)))))))) (let ((.cse16 (let ((.cse43 (+ .cse1 3))) (mod .cse43 .cse43)))) (or (and .cse0 (= .cse16 0)) (let ((.cse25 (forall ((v_arrayElimCell_39 Int)) (let ((.cse42 (+ .cse1 2 v_arrayElimCell_39))) (or (< 0 (mod .cse42 .cse42)) (= (mod (+ .cse1 (* 2 v_arrayElimCell_39) 1) .cse42) 0))))) (.cse35 (forall ((v_arrayElimCell_40 Int)) (let ((.cse41 (+ .cse1 2 v_arrayElimCell_40))) (or (< 0 (mod (+ .cse1 (* 2 v_arrayElimCell_40) 1) .cse41)) (= (mod .cse41 .cse41) 0)))))) (and (or (and (or (forall ((v_arrayElimCell_40 Int) (v_arrayElimCell_39 Int)) (let ((.cse17 (+ .cse1 v_arrayElimCell_39 v_arrayElimCell_40 1))) (or (< 0 (mod (+ .cse1 (* 2 v_arrayElimCell_40) v_arrayElimCell_39) .cse17)) (= (mod (+ .cse1 (* 2 v_arrayElimCell_39) v_arrayElimCell_40) .cse17) 0)))) .cse5) (forall ((v_arrayElimCell_40 Int) (v_arrayElimCell_39 Int)) (let ((.cse18 (+ .cse1 2 v_arrayElimCell_39)) (.cse19 (* 2 v_arrayElimCell_39)) (.cse20 (+ .cse1 v_arrayElimCell_39 v_arrayElimCell_40 1))) (or (< 0 (mod .cse18 .cse18)) (= (mod (+ .cse1 .cse19 1) .cse18) 0) (< 0 (mod (+ .cse1 (* 2 v_arrayElimCell_40) v_arrayElimCell_39) .cse20)) (= (mod (+ .cse1 .cse19 v_arrayElimCell_40) .cse20) 0)))) (or (forall ((v_arrayElimCell_40 Int) (v_arrayElimCell_39 Int)) (let ((.cse22 (+ .cse1 v_arrayElimCell_39 v_arrayElimCell_40 1))) (or (< 0 (let ((.cse21 (+ .cse1 2 v_arrayElimCell_39))) (mod .cse21 .cse21))) (< 0 (mod (+ .cse1 (* 2 v_arrayElimCell_40) v_arrayElimCell_39) .cse22)) (= (mod (+ .cse1 (* 2 v_arrayElimCell_39) v_arrayElimCell_40) .cse22) 0)))) .cse5) (or (forall ((v_arrayElimCell_40 Int) (v_arrayElimCell_39 Int)) (let ((.cse23 (+ .cse1 2 v_arrayElimCell_39))) (or (< 0 (mod .cse23 .cse23)) (= (mod (+ .cse1 (* 2 v_arrayElimCell_39) 1) .cse23) 0) (< 0 (mod (+ .cse1 (* 2 v_arrayElimCell_40) v_arrayElimCell_39) (+ .cse1 v_arrayElimCell_39 v_arrayElimCell_40 1)))))) .cse24) (or .cse24 .cse25)) .cse8) (or (forall ((v_arrayElimCell_40 Int) (v_arrayElimCell_39 Int)) (let ((.cse26 (+ .cse1 2 v_arrayElimCell_40))) (or (< 0 (mod (+ .cse1 (* 2 v_arrayElimCell_40) 1) .cse26)) (= (mod .cse26 .cse26) 0) (= (mod (+ .cse1 (* 2 v_arrayElimCell_39) v_arrayElimCell_40) (+ .cse1 v_arrayElimCell_39 v_arrayElimCell_40 1)) 0)))) .cse5) (not .cse0) (or (and (or .cse24 (forall ((v_arrayElimCell_40 Int)) (= (let ((.cse27 (+ .cse1 2 v_arrayElimCell_40))) (mod .cse27 .cse27)) 0)) .cse25) (forall ((v_arrayElimCell_40 Int)) (or (forall ((v_arrayElimCell_39 Int)) (let ((.cse28 (+ .cse1 2 v_arrayElimCell_39)) (.cse29 (* 2 v_arrayElimCell_39))) (or (< 0 (mod .cse28 .cse28)) (= (mod (+ .cse1 .cse29 1) .cse28) 0) (= (mod (+ .cse1 .cse29 v_arrayElimCell_40) (+ .cse1 v_arrayElimCell_39 v_arrayElimCell_40 1)) 0)))) (= (let ((.cse30 (+ .cse1 2 v_arrayElimCell_40))) (mod .cse30 .cse30)) 0))) (or .cse24 (forall ((v_arrayElimCell_40 Int) (v_arrayElimCell_39 Int)) (let ((.cse31 (+ .cse1 2 v_arrayElimCell_39))) (or (< 0 (mod .cse31 .cse31)) (= (let ((.cse32 (+ .cse1 2 v_arrayElimCell_40))) (mod .cse32 .cse32)) 0) (= (mod (+ .cse1 (* 2 v_arrayElimCell_39) 1) .cse31) 0) (< 0 (mod (+ .cse1 (* 2 v_arrayElimCell_40) v_arrayElimCell_39) (+ .cse1 v_arrayElimCell_39 v_arrayElimCell_40 1))))))) (or (forall ((v_arrayElimCell_40 Int) (v_arrayElimCell_39 Int)) (let ((.cse34 (+ .cse1 v_arrayElimCell_39 v_arrayElimCell_40 1))) (or (= (let ((.cse33 (+ .cse1 2 v_arrayElimCell_40))) (mod .cse33 .cse33)) 0) (< 0 (mod (+ .cse1 (* 2 v_arrayElimCell_40) v_arrayElimCell_39) .cse34)) (= (mod (+ .cse1 (* 2 v_arrayElimCell_39) v_arrayElimCell_40) .cse34) 0)))) .cse5)) .cse8) (or .cse35 .cse24 .cse25) (or .cse24 (forall ((v_arrayElimCell_40 Int) (v_arrayElimCell_39 Int)) (let ((.cse38 (+ .cse1 2 v_arrayElimCell_40)) (.cse36 (+ .cse1 2 v_arrayElimCell_39)) (.cse37 (* 2 v_arrayElimCell_40))) (or (< 0 (mod .cse36 .cse36)) (< 0 (mod (+ .cse1 .cse37 1) .cse38)) (= (mod .cse38 .cse38) 0) (= (mod (+ .cse1 (* 2 v_arrayElimCell_39) 1) .cse36) 0) (< 0 (mod (+ .cse1 .cse37 v_arrayElimCell_39) (+ .cse1 v_arrayElimCell_39 v_arrayElimCell_40 1))))))) (forall ((v_arrayElimCell_40 Int)) (let ((.cse39 (+ .cse1 2 v_arrayElimCell_40))) (or (< 0 (mod (+ .cse1 (* 2 v_arrayElimCell_40) 1) .cse39)) (= (mod .cse39 .cse39) 0) (forall ((v_arrayElimCell_39 Int)) (let ((.cse40 (* 2 v_arrayElimCell_39))) (or (= (mod (+ .cse1 .cse40 1) (+ .cse1 2 v_arrayElimCell_39)) 0) (= (mod (+ .cse1 .cse40 v_arrayElimCell_40) (+ .cse1 v_arrayElimCell_39 v_arrayElimCell_40 1)) 0))))))) (or .cse35 .cse4))) (and .cse0 (<= 1 .cse16)))) (or .cse0 (and (or (forall ((v_arrayElimCell_46 Int) (v_arrayElimCell_45 Int)) (let ((.cse44 (* 2 v_arrayElimCell_46))) (or (= (mod (+ .cse1 1 (* 2 v_arrayElimCell_45)) (+ .cse1 2 v_arrayElimCell_45)) 0) (< 0 (+ .cse1 (mod (+ .cse1 .cse44 v_arrayElimCell_45) (+ .cse1 v_arrayElimCell_46 v_arrayElimCell_45 1)) v_arrayElimCell_46 v_arrayElimCell_45 1)) (< 0 (+ .cse1 2 v_arrayElimCell_46 (mod (+ .cse1 .cse44 1) (+ .cse1 2 v_arrayElimCell_46)))) (< 0 (+ .cse1 3 v_arrayElimCell_45))))) .cse24) (or (forall ((v_arrayElimCell_46 Int) (v_arrayElimCell_45 Int)) (let ((.cse45 (* 2 v_arrayElimCell_46)) (.cse46 (* 2 v_arrayElimCell_45))) (or (< 0 (+ .cse1 .cse45 v_arrayElimCell_45 1)) (= (mod (+ .cse1 1 .cse46) (+ .cse1 2 v_arrayElimCell_45)) 0) (< 0 (+ .cse1 .cse45 2)) (< 0 (+ .cse1 2 v_arrayElimCell_46 (mod (+ .cse1 .cse45 1) (+ .cse1 2 v_arrayElimCell_46)))) (< 0 (+ .cse1 3 v_arrayElimCell_45)) (= (mod (+ .cse1 v_arrayElimCell_46 .cse46) (+ .cse1 v_arrayElimCell_46 v_arrayElimCell_45 1)) 0)))) .cse8) (or (and (or (forall ((v_arrayElimCell_46 Int) (v_arrayElimCell_45 Int)) (let ((.cse47 (* 2 v_arrayElimCell_46))) (or (< 0 (+ .cse1 .cse47 v_arrayElimCell_45 1)) (< 0 (+ .cse1 2 v_arrayElimCell_46 (mod (+ .cse1 .cse47 1) (+ .cse1 2 v_arrayElimCell_46)))) (< 0 (+ .cse1 3 v_arrayElimCell_45)) (= (mod (+ .cse1 v_arrayElimCell_46 (* 2 v_arrayElimCell_45)) (+ .cse1 v_arrayElimCell_46 v_arrayElimCell_45 1)) 0)))) .cse5) (or .cse24 (forall ((v_arrayElimCell_46 Int) (v_arrayElimCell_45 Int)) (let ((.cse48 (* 2 v_arrayElimCell_46))) (or (< 0 (+ .cse1 .cse48 v_arrayElimCell_45 1)) (= (mod (+ .cse1 1 (* 2 v_arrayElimCell_45)) (+ .cse1 2 v_arrayElimCell_45)) 0) (< 0 (+ .cse1 2 v_arrayElimCell_46 (mod (+ .cse1 .cse48 1) (+ .cse1 2 v_arrayElimCell_46)))) (< 0 (+ .cse1 3 v_arrayElimCell_45)))))) (forall ((v_arrayElimCell_46 Int)) (let ((.cse49 (* 2 v_arrayElimCell_46))) (or (< 0 (+ .cse1 2 v_arrayElimCell_46 (mod (+ .cse1 .cse49 1) (+ .cse1 2 v_arrayElimCell_46)))) (forall ((v_arrayElimCell_45 Int)) (let ((.cse50 (* 2 v_arrayElimCell_45))) (or (< 0 (+ .cse1 .cse49 v_arrayElimCell_45 1)) (= (mod (+ .cse1 1 .cse50) (+ .cse1 2 v_arrayElimCell_45)) 0) (< 0 (+ .cse1 3 v_arrayElimCell_45)) (= (mod (+ .cse1 v_arrayElimCell_46 .cse50) (+ .cse1 v_arrayElimCell_46 v_arrayElimCell_45 1)) 0)))))))) .cse8) (or (forall ((v_arrayElimCell_46 Int)) (let ((.cse51 (* 2 v_arrayElimCell_46)) (.cse52 (+ .cse1 2 v_arrayElimCell_46))) (or (< 0 (+ .cse1 .cse51 2)) (< 0 (+ .cse1 2 v_arrayElimCell_46 (mod (+ .cse1 .cse51 1) .cse52))) (= (mod .cse52 .cse52) 0)))) .cse4) (or (and (forall ((v_arrayElimCell_46 Int) (v_arrayElimCell_45 Int)) (let ((.cse53 (* 2 v_arrayElimCell_45))) (or (< 0 (+ .cse1 (* 2 v_arrayElimCell_46) v_arrayElimCell_45 1)) (= (mod (+ .cse1 1 .cse53) (+ .cse1 2 v_arrayElimCell_45)) 0) (< 0 (+ .cse1 3 v_arrayElimCell_45)) (= (mod (+ .cse1 v_arrayElimCell_46 .cse53) (+ .cse1 v_arrayElimCell_46 v_arrayElimCell_45 1)) 0)))) (or (forall ((v_arrayElimCell_46 Int) (v_arrayElimCell_45 Int)) (or (= (mod (+ .cse1 1 (* 2 v_arrayElimCell_45)) (+ .cse1 2 v_arrayElimCell_45)) 0) (< 0 (+ .cse1 (mod (+ .cse1 (* 2 v_arrayElimCell_46) v_arrayElimCell_45) (+ .cse1 v_arrayElimCell_46 v_arrayElimCell_45 1)) v_arrayElimCell_46 v_arrayElimCell_45 1)) (< 0 (+ .cse1 3 v_arrayElimCell_45)))) .cse24) (or (forall ((v_arrayElimCell_45 Int)) (or (= (mod (+ .cse1 1 (* 2 v_arrayElimCell_45)) (+ .cse1 2 v_arrayElimCell_45)) 0) (< 0 (+ .cse1 3 v_arrayElimCell_45)))) .cse24) (or (forall ((v_arrayElimCell_46 Int) (v_arrayElimCell_45 Int)) (or (< 0 (+ .cse1 (* 2 v_arrayElimCell_46) v_arrayElimCell_45 1)) (< 0 (+ .cse1 3 v_arrayElimCell_45)) (= (mod (+ .cse1 v_arrayElimCell_46 (* 2 v_arrayElimCell_45)) (+ .cse1 v_arrayElimCell_46 v_arrayElimCell_45 1)) 0))) .cse5) (or (forall ((v_arrayElimCell_46 Int) (v_arrayElimCell_45 Int)) (let ((.cse54 (* 2 v_arrayElimCell_46)) (.cse55 (+ .cse1 v_arrayElimCell_46 v_arrayElimCell_45 1))) (or (< 0 (+ .cse1 .cse54 v_arrayElimCell_45 1)) (< 0 (+ .cse1 (mod (+ .cse1 .cse54 v_arrayElimCell_45) .cse55) v_arrayElimCell_46 v_arrayElimCell_45 1)) (= (mod (+ .cse1 v_arrayElimCell_46 (* 2 v_arrayElimCell_45)) .cse55) 0)))) .cse5)) .cse8) (or (forall ((v_arrayElimCell_46 Int) (v_arrayElimCell_45 Int)) (let ((.cse56 (* 2 v_arrayElimCell_46))) (or (< 0 (+ .cse1 .cse56 v_arrayElimCell_45 1)) (< 0 (+ .cse1 .cse56 2)) (< 0 (+ .cse1 2 v_arrayElimCell_46 (mod (+ .cse1 .cse56 1) (+ .cse1 2 v_arrayElimCell_46)))) (< 0 (+ .cse1 3 v_arrayElimCell_45)) (= (mod (+ .cse1 v_arrayElimCell_46 (* 2 v_arrayElimCell_45)) (+ .cse1 v_arrayElimCell_46 v_arrayElimCell_45 1)) 0)))) .cse5 .cse8) (or (forall ((v_arrayElimCell_46 Int) (v_arrayElimCell_45 Int)) (let ((.cse57 (* 2 v_arrayElimCell_46)) (.cse58 (+ .cse1 v_arrayElimCell_46 v_arrayElimCell_45 1))) (or (< 0 (+ .cse1 .cse57 v_arrayElimCell_45 1)) (< 0 (+ .cse1 (mod (+ .cse1 .cse57 v_arrayElimCell_45) .cse58) v_arrayElimCell_46 v_arrayElimCell_45 1)) (< 0 (+ .cse1 2 v_arrayElimCell_46 (mod (+ .cse1 .cse57 1) (+ .cse1 2 v_arrayElimCell_46)))) (= (mod (+ .cse1 v_arrayElimCell_46 (* 2 v_arrayElimCell_45)) .cse58) 0)))) .cse5 .cse8) (or (forall ((v_arrayElimCell_46 Int) (v_arrayElimCell_45 Int)) (let ((.cse59 (* 2 v_arrayElimCell_46))) (or (< 0 (+ .cse1 .cse59 v_arrayElimCell_45 1)) (= (mod (+ .cse1 1 (* 2 v_arrayElimCell_45)) (+ .cse1 2 v_arrayElimCell_45)) 0) (< 0 (+ .cse1 .cse59 2)) (< 0 (+ .cse1 2 v_arrayElimCell_46 (mod (+ .cse1 .cse59 1) (+ .cse1 2 v_arrayElimCell_46)))) (< 0 (+ .cse1 3 v_arrayElimCell_45))))) .cse24)))))) is different from false [2024-11-09 18:26:57,505 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (= (+ |c_ULTIMATE.start_main_~i~0#1| 1) 0)) (.cse8 (= |c_ULTIMATE.start_main_~i~0#1| 1))) (let ((.cse0 (= |c_ULTIMATE.start_main_~i~0#1| 0)) (.cse4 (not .cse8)) (.cse1 (select (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse24 (not .cse5))) (and (or .cse0 (and (or (forall ((v_arrayElimCell_43 Int)) (let ((.cse2 (* 2 v_arrayElimCell_43)) (.cse3 (+ .cse1 2 v_arrayElimCell_43))) (or (< 0 (+ .cse1 2 .cse2)) (< .cse3 (mod (+ .cse1 .cse2 1) .cse3)) (= (mod .cse3 .cse3) 0)))) .cse4) (or .cse5 (and (or (forall ((v_arrayElimCell_43 Int) (v_arrayElimCell_42 Int)) (let ((.cse6 (+ .cse1 v_arrayElimCell_43 v_arrayElimCell_42 1)) (.cse7 (* 2 v_arrayElimCell_43))) (or (= (mod (+ .cse1 v_arrayElimCell_43 (* 2 v_arrayElimCell_42)) .cse6) 0) (< .cse6 (mod (+ .cse1 .cse7 v_arrayElimCell_42) .cse6)) (< 0 (+ .cse1 .cse7 v_arrayElimCell_42 1))))) .cse8) (or (forall ((v_arrayElimCell_43 Int) (v_arrayElimCell_42 Int)) (let ((.cse9 (+ .cse1 v_arrayElimCell_43 v_arrayElimCell_42 1)) (.cse10 (* 2 v_arrayElimCell_43))) (or (= (mod (+ .cse1 v_arrayElimCell_43 (* 2 v_arrayElimCell_42)) .cse9) 0) (< 0 (+ .cse1 2 .cse10)) (< .cse9 (mod (+ .cse1 .cse10 v_arrayElimCell_42) .cse9)) (let ((.cse11 (+ .cse1 2 v_arrayElimCell_43))) (< .cse11 (mod (+ .cse1 .cse10 1) .cse11))) (< 0 (+ .cse1 .cse10 v_arrayElimCell_42 1))))) .cse8) (or (forall ((v_arrayElimCell_43 Int) (v_arrayElimCell_42 Int)) (let ((.cse12 (+ .cse1 v_arrayElimCell_43 v_arrayElimCell_42 1)) (.cse13 (* 2 v_arrayElimCell_43))) (or (= (mod (+ .cse1 v_arrayElimCell_43 (* 2 v_arrayElimCell_42)) .cse12) 0) (< 0 (+ .cse1 2 .cse13)) (< .cse12 (mod (+ .cse1 .cse13 v_arrayElimCell_42) .cse12)) (< 0 (+ .cse1 .cse13 v_arrayElimCell_42 1))))) .cse8) (forall ((v_arrayElimCell_43 Int) (v_arrayElimCell_42 Int)) (let ((.cse14 (* 2 v_arrayElimCell_43)) (.cse15 (+ .cse1 2 v_arrayElimCell_43))) (or (= (mod (+ .cse1 v_arrayElimCell_43 (* 2 v_arrayElimCell_42)) (+ .cse1 v_arrayElimCell_43 v_arrayElimCell_42 1)) 0) (< 0 (+ .cse1 2 .cse14)) (< .cse15 (mod (+ .cse1 .cse14 1) .cse15)) (= (mod .cse15 .cse15) 0)))))))) (let ((.cse16 (let ((.cse43 (+ .cse1 3))) (mod .cse43 .cse43)))) (or (and .cse0 (= .cse16 0)) (let ((.cse25 (forall ((v_arrayElimCell_39 Int)) (let ((.cse42 (+ .cse1 2 v_arrayElimCell_39))) (or (< 0 (mod .cse42 .cse42)) (= (mod (+ .cse1 (* 2 v_arrayElimCell_39) 1) .cse42) 0))))) (.cse35 (forall ((v_arrayElimCell_40 Int)) (let ((.cse41 (+ .cse1 2 v_arrayElimCell_40))) (or (< 0 (mod (+ .cse1 (* 2 v_arrayElimCell_40) 1) .cse41)) (= (mod .cse41 .cse41) 0)))))) (and (or (and (or (forall ((v_arrayElimCell_40 Int) (v_arrayElimCell_39 Int)) (let ((.cse17 (+ .cse1 v_arrayElimCell_39 v_arrayElimCell_40 1))) (or (< 0 (mod (+ .cse1 (* 2 v_arrayElimCell_40) v_arrayElimCell_39) .cse17)) (= (mod (+ .cse1 (* 2 v_arrayElimCell_39) v_arrayElimCell_40) .cse17) 0)))) .cse5) (forall ((v_arrayElimCell_40 Int) (v_arrayElimCell_39 Int)) (let ((.cse18 (+ .cse1 2 v_arrayElimCell_39)) (.cse19 (* 2 v_arrayElimCell_39)) (.cse20 (+ .cse1 v_arrayElimCell_39 v_arrayElimCell_40 1))) (or (< 0 (mod .cse18 .cse18)) (= (mod (+ .cse1 .cse19 1) .cse18) 0) (< 0 (mod (+ .cse1 (* 2 v_arrayElimCell_40) v_arrayElimCell_39) .cse20)) (= (mod (+ .cse1 .cse19 v_arrayElimCell_40) .cse20) 0)))) (or (forall ((v_arrayElimCell_40 Int) (v_arrayElimCell_39 Int)) (let ((.cse22 (+ .cse1 v_arrayElimCell_39 v_arrayElimCell_40 1))) (or (< 0 (let ((.cse21 (+ .cse1 2 v_arrayElimCell_39))) (mod .cse21 .cse21))) (< 0 (mod (+ .cse1 (* 2 v_arrayElimCell_40) v_arrayElimCell_39) .cse22)) (= (mod (+ .cse1 (* 2 v_arrayElimCell_39) v_arrayElimCell_40) .cse22) 0)))) .cse5) (or (forall ((v_arrayElimCell_40 Int) (v_arrayElimCell_39 Int)) (let ((.cse23 (+ .cse1 2 v_arrayElimCell_39))) (or (< 0 (mod .cse23 .cse23)) (= (mod (+ .cse1 (* 2 v_arrayElimCell_39) 1) .cse23) 0) (< 0 (mod (+ .cse1 (* 2 v_arrayElimCell_40) v_arrayElimCell_39) (+ .cse1 v_arrayElimCell_39 v_arrayElimCell_40 1)))))) .cse24) (or .cse24 .cse25)) .cse8) (or (forall ((v_arrayElimCell_40 Int) (v_arrayElimCell_39 Int)) (let ((.cse26 (+ .cse1 2 v_arrayElimCell_40))) (or (< 0 (mod (+ .cse1 (* 2 v_arrayElimCell_40) 1) .cse26)) (= (mod .cse26 .cse26) 0) (= (mod (+ .cse1 (* 2 v_arrayElimCell_39) v_arrayElimCell_40) (+ .cse1 v_arrayElimCell_39 v_arrayElimCell_40 1)) 0)))) .cse5) (not .cse0) (or (and (or .cse24 (forall ((v_arrayElimCell_40 Int)) (= (let ((.cse27 (+ .cse1 2 v_arrayElimCell_40))) (mod .cse27 .cse27)) 0)) .cse25) (forall ((v_arrayElimCell_40 Int)) (or (forall ((v_arrayElimCell_39 Int)) (let ((.cse28 (+ .cse1 2 v_arrayElimCell_39)) (.cse29 (* 2 v_arrayElimCell_39))) (or (< 0 (mod .cse28 .cse28)) (= (mod (+ .cse1 .cse29 1) .cse28) 0) (= (mod (+ .cse1 .cse29 v_arrayElimCell_40) (+ .cse1 v_arrayElimCell_39 v_arrayElimCell_40 1)) 0)))) (= (let ((.cse30 (+ .cse1 2 v_arrayElimCell_40))) (mod .cse30 .cse30)) 0))) (or .cse24 (forall ((v_arrayElimCell_40 Int) (v_arrayElimCell_39 Int)) (let ((.cse31 (+ .cse1 2 v_arrayElimCell_39))) (or (< 0 (mod .cse31 .cse31)) (= (let ((.cse32 (+ .cse1 2 v_arrayElimCell_40))) (mod .cse32 .cse32)) 0) (= (mod (+ .cse1 (* 2 v_arrayElimCell_39) 1) .cse31) 0) (< 0 (mod (+ .cse1 (* 2 v_arrayElimCell_40) v_arrayElimCell_39) (+ .cse1 v_arrayElimCell_39 v_arrayElimCell_40 1))))))) (or (forall ((v_arrayElimCell_40 Int) (v_arrayElimCell_39 Int)) (let ((.cse34 (+ .cse1 v_arrayElimCell_39 v_arrayElimCell_40 1))) (or (= (let ((.cse33 (+ .cse1 2 v_arrayElimCell_40))) (mod .cse33 .cse33)) 0) (< 0 (mod (+ .cse1 (* 2 v_arrayElimCell_40) v_arrayElimCell_39) .cse34)) (= (mod (+ .cse1 (* 2 v_arrayElimCell_39) v_arrayElimCell_40) .cse34) 0)))) .cse5)) .cse8) (or .cse35 .cse24 .cse25) (or .cse24 (forall ((v_arrayElimCell_40 Int) (v_arrayElimCell_39 Int)) (let ((.cse38 (+ .cse1 2 v_arrayElimCell_40)) (.cse36 (+ .cse1 2 v_arrayElimCell_39)) (.cse37 (* 2 v_arrayElimCell_40))) (or (< 0 (mod .cse36 .cse36)) (< 0 (mod (+ .cse1 .cse37 1) .cse38)) (= (mod .cse38 .cse38) 0) (= (mod (+ .cse1 (* 2 v_arrayElimCell_39) 1) .cse36) 0) (< 0 (mod (+ .cse1 .cse37 v_arrayElimCell_39) (+ .cse1 v_arrayElimCell_39 v_arrayElimCell_40 1))))))) (forall ((v_arrayElimCell_40 Int)) (let ((.cse39 (+ .cse1 2 v_arrayElimCell_40))) (or (< 0 (mod (+ .cse1 (* 2 v_arrayElimCell_40) 1) .cse39)) (= (mod .cse39 .cse39) 0) (forall ((v_arrayElimCell_39 Int)) (let ((.cse40 (* 2 v_arrayElimCell_39))) (or (= (mod (+ .cse1 .cse40 1) (+ .cse1 2 v_arrayElimCell_39)) 0) (= (mod (+ .cse1 .cse40 v_arrayElimCell_40) (+ .cse1 v_arrayElimCell_39 v_arrayElimCell_40 1)) 0))))))) (or .cse35 .cse4))) (and .cse0 (<= 1 .cse16)))) (or .cse0 (and (or (forall ((v_arrayElimCell_46 Int) (v_arrayElimCell_45 Int)) (let ((.cse44 (* 2 v_arrayElimCell_46))) (or (= (mod (+ .cse1 1 (* 2 v_arrayElimCell_45)) (+ .cse1 2 v_arrayElimCell_45)) 0) (< 0 (+ .cse1 (mod (+ .cse1 .cse44 v_arrayElimCell_45) (+ .cse1 v_arrayElimCell_46 v_arrayElimCell_45 1)) v_arrayElimCell_46 v_arrayElimCell_45 1)) (< 0 (+ .cse1 2 v_arrayElimCell_46 (mod (+ .cse1 .cse44 1) (+ .cse1 2 v_arrayElimCell_46)))) (< 0 (+ .cse1 3 v_arrayElimCell_45))))) .cse24) (or (forall ((v_arrayElimCell_46 Int) (v_arrayElimCell_45 Int)) (let ((.cse45 (* 2 v_arrayElimCell_46)) (.cse46 (* 2 v_arrayElimCell_45))) (or (< 0 (+ .cse1 .cse45 v_arrayElimCell_45 1)) (= (mod (+ .cse1 1 .cse46) (+ .cse1 2 v_arrayElimCell_45)) 0) (< 0 (+ .cse1 .cse45 2)) (< 0 (+ .cse1 2 v_arrayElimCell_46 (mod (+ .cse1 .cse45 1) (+ .cse1 2 v_arrayElimCell_46)))) (< 0 (+ .cse1 3 v_arrayElimCell_45)) (= (mod (+ .cse1 v_arrayElimCell_46 .cse46) (+ .cse1 v_arrayElimCell_46 v_arrayElimCell_45 1)) 0)))) .cse8) (or (and (or (forall ((v_arrayElimCell_46 Int) (v_arrayElimCell_45 Int)) (let ((.cse47 (* 2 v_arrayElimCell_46))) (or (< 0 (+ .cse1 .cse47 v_arrayElimCell_45 1)) (< 0 (+ .cse1 2 v_arrayElimCell_46 (mod (+ .cse1 .cse47 1) (+ .cse1 2 v_arrayElimCell_46)))) (< 0 (+ .cse1 3 v_arrayElimCell_45)) (= (mod (+ .cse1 v_arrayElimCell_46 (* 2 v_arrayElimCell_45)) (+ .cse1 v_arrayElimCell_46 v_arrayElimCell_45 1)) 0)))) .cse5) (or .cse24 (forall ((v_arrayElimCell_46 Int) (v_arrayElimCell_45 Int)) (let ((.cse48 (* 2 v_arrayElimCell_46))) (or (< 0 (+ .cse1 .cse48 v_arrayElimCell_45 1)) (= (mod (+ .cse1 1 (* 2 v_arrayElimCell_45)) (+ .cse1 2 v_arrayElimCell_45)) 0) (< 0 (+ .cse1 2 v_arrayElimCell_46 (mod (+ .cse1 .cse48 1) (+ .cse1 2 v_arrayElimCell_46)))) (< 0 (+ .cse1 3 v_arrayElimCell_45)))))) (forall ((v_arrayElimCell_46 Int)) (let ((.cse49 (* 2 v_arrayElimCell_46))) (or (< 0 (+ .cse1 2 v_arrayElimCell_46 (mod (+ .cse1 .cse49 1) (+ .cse1 2 v_arrayElimCell_46)))) (forall ((v_arrayElimCell_45 Int)) (let ((.cse50 (* 2 v_arrayElimCell_45))) (or (< 0 (+ .cse1 .cse49 v_arrayElimCell_45 1)) (= (mod (+ .cse1 1 .cse50) (+ .cse1 2 v_arrayElimCell_45)) 0) (< 0 (+ .cse1 3 v_arrayElimCell_45)) (= (mod (+ .cse1 v_arrayElimCell_46 .cse50) (+ .cse1 v_arrayElimCell_46 v_arrayElimCell_45 1)) 0)))))))) .cse8) (or (forall ((v_arrayElimCell_46 Int)) (let ((.cse51 (* 2 v_arrayElimCell_46)) (.cse52 (+ .cse1 2 v_arrayElimCell_46))) (or (< 0 (+ .cse1 .cse51 2)) (< 0 (+ .cse1 2 v_arrayElimCell_46 (mod (+ .cse1 .cse51 1) .cse52))) (= (mod .cse52 .cse52) 0)))) .cse4) (or (and (forall ((v_arrayElimCell_46 Int) (v_arrayElimCell_45 Int)) (let ((.cse53 (* 2 v_arrayElimCell_45))) (or (< 0 (+ .cse1 (* 2 v_arrayElimCell_46) v_arrayElimCell_45 1)) (= (mod (+ .cse1 1 .cse53) (+ .cse1 2 v_arrayElimCell_45)) 0) (< 0 (+ .cse1 3 v_arrayElimCell_45)) (= (mod (+ .cse1 v_arrayElimCell_46 .cse53) (+ .cse1 v_arrayElimCell_46 v_arrayElimCell_45 1)) 0)))) (or (forall ((v_arrayElimCell_46 Int) (v_arrayElimCell_45 Int)) (or (= (mod (+ .cse1 1 (* 2 v_arrayElimCell_45)) (+ .cse1 2 v_arrayElimCell_45)) 0) (< 0 (+ .cse1 (mod (+ .cse1 (* 2 v_arrayElimCell_46) v_arrayElimCell_45) (+ .cse1 v_arrayElimCell_46 v_arrayElimCell_45 1)) v_arrayElimCell_46 v_arrayElimCell_45 1)) (< 0 (+ .cse1 3 v_arrayElimCell_45)))) .cse24) (or (forall ((v_arrayElimCell_45 Int)) (or (= (mod (+ .cse1 1 (* 2 v_arrayElimCell_45)) (+ .cse1 2 v_arrayElimCell_45)) 0) (< 0 (+ .cse1 3 v_arrayElimCell_45)))) .cse24) (or (forall ((v_arrayElimCell_46 Int) (v_arrayElimCell_45 Int)) (or (< 0 (+ .cse1 (* 2 v_arrayElimCell_46) v_arrayElimCell_45 1)) (< 0 (+ .cse1 3 v_arrayElimCell_45)) (= (mod (+ .cse1 v_arrayElimCell_46 (* 2 v_arrayElimCell_45)) (+ .cse1 v_arrayElimCell_46 v_arrayElimCell_45 1)) 0))) .cse5) (or (forall ((v_arrayElimCell_46 Int) (v_arrayElimCell_45 Int)) (let ((.cse54 (* 2 v_arrayElimCell_46)) (.cse55 (+ .cse1 v_arrayElimCell_46 v_arrayElimCell_45 1))) (or (< 0 (+ .cse1 .cse54 v_arrayElimCell_45 1)) (< 0 (+ .cse1 (mod (+ .cse1 .cse54 v_arrayElimCell_45) .cse55) v_arrayElimCell_46 v_arrayElimCell_45 1)) (= (mod (+ .cse1 v_arrayElimCell_46 (* 2 v_arrayElimCell_45)) .cse55) 0)))) .cse5)) .cse8) (or (forall ((v_arrayElimCell_46 Int) (v_arrayElimCell_45 Int)) (let ((.cse56 (* 2 v_arrayElimCell_46))) (or (< 0 (+ .cse1 .cse56 v_arrayElimCell_45 1)) (< 0 (+ .cse1 .cse56 2)) (< 0 (+ .cse1 2 v_arrayElimCell_46 (mod (+ .cse1 .cse56 1) (+ .cse1 2 v_arrayElimCell_46)))) (< 0 (+ .cse1 3 v_arrayElimCell_45)) (= (mod (+ .cse1 v_arrayElimCell_46 (* 2 v_arrayElimCell_45)) (+ .cse1 v_arrayElimCell_46 v_arrayElimCell_45 1)) 0)))) .cse5 .cse8) (or (forall ((v_arrayElimCell_46 Int) (v_arrayElimCell_45 Int)) (let ((.cse57 (* 2 v_arrayElimCell_46)) (.cse58 (+ .cse1 v_arrayElimCell_46 v_arrayElimCell_45 1))) (or (< 0 (+ .cse1 .cse57 v_arrayElimCell_45 1)) (< 0 (+ .cse1 (mod (+ .cse1 .cse57 v_arrayElimCell_45) .cse58) v_arrayElimCell_46 v_arrayElimCell_45 1)) (< 0 (+ .cse1 2 v_arrayElimCell_46 (mod (+ .cse1 .cse57 1) (+ .cse1 2 v_arrayElimCell_46)))) (= (mod (+ .cse1 v_arrayElimCell_46 (* 2 v_arrayElimCell_45)) .cse58) 0)))) .cse5 .cse8) (or (forall ((v_arrayElimCell_46 Int) (v_arrayElimCell_45 Int)) (let ((.cse59 (* 2 v_arrayElimCell_46))) (or (< 0 (+ .cse1 .cse59 v_arrayElimCell_45 1)) (= (mod (+ .cse1 1 (* 2 v_arrayElimCell_45)) (+ .cse1 2 v_arrayElimCell_45)) 0) (< 0 (+ .cse1 .cse59 2)) (< 0 (+ .cse1 2 v_arrayElimCell_46 (mod (+ .cse1 .cse59 1) (+ .cse1 2 v_arrayElimCell_46)))) (< 0 (+ .cse1 3 v_arrayElimCell_45))))) .cse24)))))) is different from true [2024-11-09 18:27:03,468 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-09 18:27:03,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319174515] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 18:27:03,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 18:27:03,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 19] total 50 [2024-11-09 18:27:03,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179455317] [2024-11-09 18:27:03,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 18:27:03,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-09 18:27:03,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:27:03,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-09 18:27:03,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=2026, Unknown=2, NotChecked=94, Total=2450 [2024-11-09 18:27:03,472 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 50 states, 50 states have (on average 2.18) internal successors, (109), 50 states have internal predecessors, (109), 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)