./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/02_inc_cas.i --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.tracecheck.mode.for.conditional.commutativity SYMBOLIC_RELATION -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b86fb0b7 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread-ext/02_inc_cas.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-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 GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ede09850ec25b369afc0cd16258beff942f9fc7c5304532be31fd5925a934e14 --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.tracecheck.mode.for.conditional.commutativity SYMBOLIC_RELATION -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m [2024-10-17 06:37:23,172 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-17 06:37:23,245 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-17 06:37:23,253 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-17 06:37:23,254 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-17 06:37:23,298 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-17 06:37:23,299 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-17 06:37:23,300 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-17 06:37:23,300 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-17 06:37:23,301 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-17 06:37:23,303 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-17 06:37:23,303 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-17 06:37:23,304 INFO L153 SettingsManager]: * Use SBE=true [2024-10-17 06:37:23,304 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-17 06:37:23,307 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-17 06:37:23,307 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-17 06:37:23,308 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-17 06:37:23,308 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-17 06:37:23,308 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-17 06:37:23,309 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-17 06:37:23,309 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-17 06:37:23,309 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-17 06:37:23,310 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-17 06:37:23,310 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-17 06:37:23,310 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-17 06:37:23,310 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-17 06:37:23,311 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-17 06:37:23,311 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-17 06:37:23,311 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-17 06:37:23,312 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-17 06:37:23,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 06:37:23,312 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-17 06:37:23,312 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-17 06:37:23,313 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-17 06:37:23,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-17 06:37:23,315 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-17 06:37:23,315 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-17 06:37:23,315 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-17 06:37:23,315 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-17 06:37:23,321 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-17 06:37:23,321 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-17 06:37:23,322 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/UGemCutter-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/UGemCutter-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 -> GemCutter 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 -> ede09850ec25b369afc0cd16258beff942f9fc7c5304532be31fd5925a934e14 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> COUNTEREXAMPLE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: TraceCheck mode for conditional commutativity -> SYMBOLIC_RELATION [2024-10-17 06:37:23,585 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-17 06:37:23,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-17 06:37:23,615 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-17 06:37:23,616 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-17 06:37:23,617 INFO L274 PluginConnector]: CDTParser initialized [2024-10-17 06:37:23,618 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2024-10-17 06:37:25,131 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-17 06:37:25,378 INFO L384 CDTParser]: Found 1 translation units. [2024-10-17 06:37:25,379 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i [2024-10-17 06:37:25,391 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/bfc3b22aa/6c9395b847244d78af17155297f27c64/FLAGcf92c8402 [2024-10-17 06:37:25,406 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/bfc3b22aa/6c9395b847244d78af17155297f27c64 [2024-10-17 06:37:25,408 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-17 06:37:25,410 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-17 06:37:25,411 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-17 06:37:25,411 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-17 06:37:25,418 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-17 06:37:25,419 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 06:37:25" (1/1) ... [2024-10-17 06:37:25,420 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38e4dcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 06:37:25, skipping insertion in model container [2024-10-17 06:37:25,420 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 06:37:25" (1/1) ... [2024-10-17 06:37:25,465 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-17 06:37:25,764 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i[30873,30886] [2024-10-17 06:37:25,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 06:37:25,783 INFO L200 MainTranslator]: Completed pre-run [2024-10-17 06:37:25,846 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/02_inc_cas.i[30873,30886] [2024-10-17 06:37:25,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 06:37:25,893 INFO L204 MainTranslator]: Completed translation [2024-10-17 06:37:25,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 06:37:25 WrapperNode [2024-10-17 06:37:25,894 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-17 06:37:25,895 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-17 06:37:25,895 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-17 06:37:25,896 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-17 06:37:25,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 06:37:25" (1/1) ... [2024-10-17 06:37:25,916 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 06:37:25" (1/1) ... [2024-10-17 06:37:25,937 INFO L138 Inliner]: procedures = 170, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 72 [2024-10-17 06:37:25,938 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-17 06:37:25,939 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-17 06:37:25,939 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-17 06:37:25,939 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-17 06:37:25,946 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 06:37:25" (1/1) ... [2024-10-17 06:37:25,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 06:37:25" (1/1) ... [2024-10-17 06:37:25,951 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 06:37:25" (1/1) ... [2024-10-17 06:37:25,951 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 06:37:25" (1/1) ... [2024-10-17 06:37:25,957 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 06:37:25" (1/1) ... [2024-10-17 06:37:25,964 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 06:37:25" (1/1) ... [2024-10-17 06:37:25,968 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 06:37:25" (1/1) ... [2024-10-17 06:37:25,969 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 06:37:25" (1/1) ... [2024-10-17 06:37:25,972 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-17 06:37:25,975 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-17 06:37:25,976 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-17 06:37:25,976 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-17 06:37:25,977 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 06:37:25" (1/1) ... [2024-10-17 06:37:25,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 06:37:25,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 06:37:26,009 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-17 06:37:26,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-17 06:37:26,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-17 06:37:26,054 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-10-17 06:37:26,054 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-10-17 06:37:26,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-17 06:37:26,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-17 06:37:26,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-17 06:37:26,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-17 06:37:26,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-17 06:37:26,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-17 06:37:26,055 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-17 06:37:26,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-17 06:37:26,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-17 06:37:26,057 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-17 06:37:26,175 INFO L238 CfgBuilder]: Building ICFG [2024-10-17 06:37:26,177 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-17 06:37:26,334 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-17 06:37:26,334 INFO L287 CfgBuilder]: Performing block encoding [2024-10-17 06:37:26,465 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-17 06:37:26,467 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-17 06:37:26,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 06:37:26 BoogieIcfgContainer [2024-10-17 06:37:26,467 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-17 06:37:26,470 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-17 06:37:26,470 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-17 06:37:26,473 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-17 06:37:26,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 06:37:25" (1/3) ... [2024-10-17 06:37:26,474 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a90c986 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 06:37:26, skipping insertion in model container [2024-10-17 06:37:26,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 06:37:25" (2/3) ... [2024-10-17 06:37:26,475 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a90c986 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 06:37:26, skipping insertion in model container [2024-10-17 06:37:26,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 06:37:26" (3/3) ... [2024-10-17 06:37:26,477 INFO L112 eAbstractionObserver]: Analyzing ICFG 02_inc_cas.i [2024-10-17 06:37:26,492 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-17 06:37:26,492 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-17 06:37:26,493 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-17 06:37:26,533 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-17 06:37:26,579 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-17 06:37:26,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-17 06:37:26,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 06:37:26,585 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-17 06:37:26,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-17 06:37:26,690 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-17 06:37:26,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 06:37:26,706 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-10-17 06:37:26,713 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=PARTIAL_ORDER_FA, 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;@4616a337, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=SYMBOLIC_RELATION, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-17 06:37:26,713 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-17 06:37:27,075 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 06:37:27,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 06:37:27,083 INFO L85 PathProgramCache]: Analyzing trace with hash 559333503, now seen corresponding path program 1 times [2024-10-17 06:37:27,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 06:37:27,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539389187] [2024-10-17 06:37:27,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:37:27,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:37:27,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:37:27,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 06:37:27,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 06:37:27,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539389187] [2024-10-17 06:37:27,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539389187] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 06:37:27,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 06:37:27,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-17 06:37:27,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657393901] [2024-10-17 06:37:27,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 06:37:27,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-17 06:37:27,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 06:37:27,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-17 06:37:27,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-17 06:37:27,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:37:27,304 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 06:37:27,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 06:37:27,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:37:27,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:37:27,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-17 06:37:27,583 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 06:37:27,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 06:37:27,585 INFO L85 PathProgramCache]: Analyzing trace with hash 555599738, now seen corresponding path program 1 times [2024-10-17 06:37:27,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 06:37:27,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51922242] [2024-10-17 06:37:27,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:37:27,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:37:27,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:37:28,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 06:37:28,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 06:37:28,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51922242] [2024-10-17 06:37:28,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51922242] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 06:37:28,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 06:37:28,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-17 06:37:28,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672307701] [2024-10-17 06:37:28,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 06:37:28,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-17 06:37:28,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 06:37:28,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-17 06:37:28,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-17 06:37:28,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:37:28,282 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 06:37:28,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 06:37:28,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:37:28,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:37:28,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:37:28,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:37:28,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-17 06:37:28,614 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 06:37:28,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 06:37:28,615 INFO L85 PathProgramCache]: Analyzing trace with hash 812658582, now seen corresponding path program 1 times [2024-10-17 06:37:28,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 06:37:28,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968094134] [2024-10-17 06:37:28,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:37:28,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:37:28,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:37:29,664 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 06:37:29,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 06:37:29,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968094134] [2024-10-17 06:37:29,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968094134] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 06:37:29,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108734834] [2024-10-17 06:37:29,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:37:29,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 06:37:29,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 06:37:29,684 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 06:37:29,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-17 06:37:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:37:29,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-17 06:37:29,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 06:37:29,877 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 06:37:29,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-17 06:37:29,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 106 [2024-10-17 06:37:29,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 40 [2024-10-17 06:37:29,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2024-10-17 06:37:30,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 21 [2024-10-17 06:37:32,593 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 06:37:32,594 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 06:37:32,794 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= (mod |c_thr1Thread1of1ForFork0_~v~0#1| 4294967296) (mod (select .cse4 |c_~#value~0.offset|) 4294967296))) (.cse2 (* 4294967296 (div |c_thr1Thread1of1ForFork0_~v~0#1| 4294967296)))) (and (or (not .cse0) (let ((.cse1 (select (select (let ((.cse3 (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| |c_thr1Thread1of1ForFork0_~vn~0#1|)))) (store .cse3 |c_thr1Thread1of1ForFork0_~#casret~0#1.base| (store (select .cse3 |c_thr1Thread1of1ForFork0_~#casret~0#1.base|) |c_thr1Thread1of1ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* (div .cse1 4294967296) 4294967296) |c_thr1Thread1of1ForFork0_~v~0#1|) (+ .cse1 .cse2)))) (or .cse0 (forall ((v_DerPreprocessor_6 (Array Int Int))) (or (= (mod (select v_DerPreprocessor_6 |c_thr1Thread1of1ForFork0_~#casret~0#1.offset|) 4294967296) 0) (let ((.cse5 (select (select (store |c_#memory_int| |c_thr1Thread1of1ForFork0_~#casret~0#1.base| v_DerPreprocessor_6) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* (div .cse5 4294967296) 4294967296) |c_thr1Thread1of1ForFork0_~v~0#1|) (+ .cse2 .cse5))))))))) is different from false [2024-10-17 06:37:32,843 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= (mod |c_thr1Thread1of1ForFork0_~v~0#1| 4294967296) (mod (select .cse4 |c_~#value~0.offset|) 4294967296))) (.cse2 (* 4294967296 (div |c_thr1Thread1of1ForFork0_~v~0#1| 4294967296)))) (and (or (not .cse0) (let ((.cse1 (select (select (let ((.cse3 (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| (+ |c_thr1Thread1of1ForFork0_~v~0#1| 1))))) (store .cse3 |c_thr1Thread1of1ForFork0_~#casret~0#1.base| (store (select .cse3 |c_thr1Thread1of1ForFork0_~#casret~0#1.base|) |c_thr1Thread1of1ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* (div .cse1 4294967296) 4294967296) |c_thr1Thread1of1ForFork0_~v~0#1|) (+ .cse1 .cse2)))) (or .cse0 (forall ((v_DerPreprocessor_6 (Array Int Int))) (or (= (mod (select v_DerPreprocessor_6 |c_thr1Thread1of1ForFork0_~#casret~0#1.offset|) 4294967296) 0) (let ((.cse5 (select (select (store |c_#memory_int| |c_thr1Thread1of1ForFork0_~#casret~0#1.base| v_DerPreprocessor_6) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* (div .cse5 4294967296) 4294967296) |c_thr1Thread1of1ForFork0_~v~0#1|) (+ .cse2 .cse5))))))))) is different from false [2024-10-17 06:37:33,339 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-17 06:37:33,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108734834] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 06:37:33,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 06:37:33,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2024-10-17 06:37:33,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024936567] [2024-10-17 06:37:33,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 06:37:33,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-17 06:37:33,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 06:37:33,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-17 06:37:33,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=644, Unknown=3, NotChecked=110, Total=930 [2024-10-17 06:37:33,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:37:33,344 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 06:37:33,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 30 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 06:37:33,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:37:33,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:37:33,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:37:33,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:37:33,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:37:33,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-17 06:37:33,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-17 06:37:33,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-17 06:37:34,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-10-17 06:37:34,149 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-17 06:37:34,151 INFO L312 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2024-10-17 06:37:34,153 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-17 06:37:34,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-17 06:37:34,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 06:37:34,156 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-17 06:37:34,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2024-10-17 06:37:34,190 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-17 06:37:34,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 06:37:34,191 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-17 06:37:34,192 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=PARTIAL_ORDER_FA, 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;@4616a337, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=SYMBOLIC_RELATION, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-17 06:37:34,192 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-17 06:37:34,309 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 06:37:34,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 06:37:34,310 INFO L85 PathProgramCache]: Analyzing trace with hash 648589722, now seen corresponding path program 1 times [2024-10-17 06:37:34,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 06:37:34,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188307770] [2024-10-17 06:37:34,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:37:34,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:37:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:37:34,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 06:37:34,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 06:37:34,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188307770] [2024-10-17 06:37:34,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188307770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 06:37:34,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 06:37:34,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-17 06:37:34,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594289937] [2024-10-17 06:37:34,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 06:37:34,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-17 06:37:34,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 06:37:34,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-17 06:37:34,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-17 06:37:34,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:37:34,328 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 06:37:34,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 06:37:34,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:37:34,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:37:34,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-17 06:37:34,506 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 06:37:34,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 06:37:34,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1355408853, now seen corresponding path program 1 times [2024-10-17 06:37:34,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 06:37:34,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164234476] [2024-10-17 06:37:34,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:37:34,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:37:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:37:34,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 06:37:34,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 06:37:34,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164234476] [2024-10-17 06:37:34,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164234476] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 06:37:34,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 06:37:34,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-17 06:37:34,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367149979] [2024-10-17 06:37:34,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 06:37:34,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-17 06:37:34,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 06:37:34,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-17 06:37:34,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-17 06:37:34,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:37:34,895 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 06:37:34,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 06:37:34,896 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:37:34,896 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:37:35,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:37:35,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:37:35,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-17 06:37:35,048 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 06:37:35,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 06:37:35,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1174367672, now seen corresponding path program 1 times [2024-10-17 06:37:35,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 06:37:35,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353554389] [2024-10-17 06:37:35,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:37:35,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:37:35,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:37:35,062 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 06:37:35,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:37:35,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-17 06:37:35,094 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-17 06:37:35,094 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-10-17 06:37:35,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-17 06:37:35,098 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-17 06:37:35,099 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-10-17 06:37:35,099 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-17 06:37:35,099 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-17 06:37:35,119 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-17 06:37:35,121 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-17 06:37:35,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-17 06:37:35,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 06:37:35,124 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-17 06:37:35,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2024-10-17 06:37:35,168 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-17 06:37:35,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 06:37:35,168 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-17 06:37:35,169 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=PARTIAL_ORDER_FA, 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;@4616a337, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=SYMBOLIC_RELATION, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-17 06:37:35,169 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-17 06:37:35,876 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 06:37:35,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 06:37:35,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1146461421, now seen corresponding path program 1 times [2024-10-17 06:37:35,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 06:37:35,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764437539] [2024-10-17 06:37:35,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:37:35,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:37:35,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:37:35,895 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 06:37:35,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 06:37:35,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764437539] [2024-10-17 06:37:35,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764437539] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 06:37:35,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 06:37:35,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-17 06:37:35,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644545435] [2024-10-17 06:37:35,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 06:37:35,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-17 06:37:35,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 06:37:35,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-17 06:37:35,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-17 06:37:35,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:37:35,899 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 06:37:35,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 06:37:35,900 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:37:36,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:37:36,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-17 06:37:36,349 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 06:37:36,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 06:37:36,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1959299849, now seen corresponding path program 1 times [2024-10-17 06:37:36,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 06:37:36,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829583012] [2024-10-17 06:37:36,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:37:36,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:37:36,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:37:36,765 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 06:37:36,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 06:37:36,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829583012] [2024-10-17 06:37:36,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829583012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 06:37:36,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 06:37:36,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-17 06:37:36,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390578692] [2024-10-17 06:37:36,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 06:37:36,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-17 06:37:36,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 06:37:36,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-17 06:37:36,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-17 06:37:36,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:37:36,768 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 06:37:36,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 06:37:36,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:37:36,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:37:37,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:37:37,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:37:37,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-17 06:37:37,024 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 06:37:37,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 06:37:37,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1017090324, now seen corresponding path program 1 times [2024-10-17 06:37:37,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 06:37:37,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965207079] [2024-10-17 06:37:37,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:37:37,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:37:37,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:37:37,569 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 06:37:37,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 06:37:37,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965207079] [2024-10-17 06:37:37,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965207079] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 06:37:37,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700776429] [2024-10-17 06:37:37,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:37:37,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 06:37:37,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 06:37:37,573 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 06:37:37,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-17 06:37:37,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:37:37,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-17 06:37:37,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 06:37:37,714 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-17 06:37:37,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 16 [2024-10-17 06:37:37,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 18 [2024-10-17 06:37:37,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-10-17 06:37:38,053 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 06:37:38,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-17 06:37:38,256 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-10-17 06:37:38,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 28 [2024-10-17 06:37:38,377 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 06:37:38,377 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 06:37:38,461 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_thr1Thread2of2ForFork0_~v~0#1| 4294967296)) (.cse2 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse3 (= .cse0 (mod (select .cse2 |c_~#value~0.offset|) 4294967296)))) (and (or (forall ((|thr1Thread2of2ForFork0_~#casret~0#1.offset| Int)) (< .cse0 (mod (select (select (let ((.cse1 (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| |c_thr1Thread2of2ForFork0_~vn~0#1|)))) (store .cse1 |c_thr1Thread2of2ForFork0_~#casret~0#1.base| (store (select .cse1 |c_thr1Thread2of2ForFork0_~#casret~0#1.base|) |thr1Thread2of2ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse3)) (or .cse3 (forall ((v_DerPreprocessor_7 (Array Int Int))) (< .cse0 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of2ForFork0_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))) is different from false [2024-10-17 06:37:38,487 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_thr1Thread2of2ForFork0_~v~0#1| 4294967296)) (.cse2 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse3 (= .cse0 (mod (select .cse2 |c_~#value~0.offset|) 4294967296)))) (and (or (forall ((|thr1Thread2of2ForFork0_~#casret~0#1.offset| Int)) (< .cse0 (mod (select (select (let ((.cse1 (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| (+ |c_thr1Thread2of2ForFork0_~v~0#1| 1))))) (store .cse1 |c_thr1Thread2of2ForFork0_~#casret~0#1.base| (store (select .cse1 |c_thr1Thread2of2ForFork0_~#casret~0#1.base|) |thr1Thread2of2ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse3)) (or .cse3 (forall ((v_DerPreprocessor_7 (Array Int Int))) (< .cse0 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of2ForFork0_~#casret~0#1.base| v_DerPreprocessor_7) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))) is different from false [2024-10-17 06:37:39,257 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_~#value~0.base|)) (.cse14 (mod |c_thr1Thread1of2ForFork0_~v~0#1| 4294967296))) (let ((.cse5 (+ .cse14 1)) (.cse6 (= (mod (select .cse13 |c_~#value~0.offset|) 4294967296) .cse14))) (and (or (forall ((v_ArrVal_124 Int) (|v_thr1Thread2of2ForFork0_~#casret~0#1.base_13| Int) (v_DerPreprocessor_8 (Array Int Int)) (|thr1Thread2of2ForFork0_~#casret~0#1.offset| Int)) (let ((.cse2 (store |c_#memory_int| |c_thr1Thread1of2ForFork0_~#casret~0#1.base| v_DerPreprocessor_8))) (let ((.cse3 (select .cse2 |c_~#value~0.base|))) (let ((.cse4 (select .cse3 |c_~#value~0.offset|))) (let ((.cse0 (mod .cse4 4294967296))) (or (< .cse0 (mod (select (select (let ((.cse1 (store .cse2 |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| (+ .cse4 1))))) (store .cse1 |v_thr1Thread2of2ForFork0_~#casret~0#1.base_13| (store (select .cse1 |v_thr1Thread2of2ForFork0_~#casret~0#1.base_13|) |thr1Thread2of2ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (< .cse0 .cse5) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_~#casret~0#1.base| v_ArrVal_124) |v_thr1Thread2of2ForFork0_~#casret~0#1.base_13|) 0)))))))) .cse6) (or (forall ((v_ArrVal_124 Int) (|v_thr1Thread2of2ForFork0_~#casret~0#1.base_13| Int) (|thr1Thread1of2ForFork0_~#casret~0#1.offset| Int) (|thr1Thread2of2ForFork0_~#casret~0#1.offset| Int)) (let ((.cse12 (store |c_#memory_int| |c_~#value~0.base| (store .cse13 |c_~#value~0.offset| (+ |c_thr1Thread1of2ForFork0_~v~0#1| 1))))) (let ((.cse9 (store (select .cse12 |c_thr1Thread1of2ForFork0_~#casret~0#1.base|) |thr1Thread1of2ForFork0_~#casret~0#1.offset| 1))) (let ((.cse10 (select (store .cse12 |c_thr1Thread1of2ForFork0_~#casret~0#1.base| .cse9) |c_~#value~0.base|))) (let ((.cse11 (select .cse10 |c_~#value~0.offset|))) (let ((.cse7 (mod .cse11 4294967296))) (or (< .cse7 .cse5) (< .cse7 (mod (select (select (let ((.cse8 (store (store |c_#memory_int| |c_thr1Thread1of2ForFork0_~#casret~0#1.base| .cse9) |c_~#value~0.base| (store .cse10 |c_~#value~0.offset| (+ .cse11 1))))) (store .cse8 |v_thr1Thread2of2ForFork0_~#casret~0#1.base_13| (store (select .cse8 |v_thr1Thread2of2ForFork0_~#casret~0#1.base_13|) |thr1Thread2of2ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (select (store |c_#valid| |c_thr1Thread1of2ForFork0_~#casret~0#1.base| v_ArrVal_124) |v_thr1Thread2of2ForFork0_~#casret~0#1.base_13|) 0))))))))) (not .cse6))))) is different from false [2024-10-17 06:37:44,537 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 06:37:44,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700776429] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 06:37:44,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 06:37:44,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 12] total 36 [2024-10-17 06:37:44,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687440891] [2024-10-17 06:37:44,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 06:37:44,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-17 06:37:44,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 06:37:44,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-17 06:37:44,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=940, Unknown=8, NotChecked=198, Total=1332 [2024-10-17 06:37:44,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:37:44,541 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 06:37:44,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 36 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 06:37:44,542 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:37:44,542 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:37:44,542 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:37:45,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:37:45,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:37:45,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-17 06:37:45,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-17 06:37:45,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-17 06:37:45,589 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 06:37:45,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 06:37:45,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1830282799, now seen corresponding path program 1 times [2024-10-17 06:37:45,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 06:37:45,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493476109] [2024-10-17 06:37:45,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:37:45,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:37:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:37:45,613 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 06:37:45,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:37:45,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-17 06:37:45,644 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-17 06:37:45,644 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-10-17 06:37:45,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-17 06:37:45,648 INFO L414 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-17 06:37:45,649 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2024-10-17 06:37:45,649 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-17 06:37:45,649 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-17 06:37:45,673 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-17 06:37:45,677 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-17 06:37:45,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-17 06:37:45,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 06:37:45,679 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-17 06:37:45,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Waiting until timeout for monitored process [2024-10-17 06:37:45,725 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-17 06:37:45,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 06:37:45,726 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-10-17 06:37:45,727 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=PARTIAL_ORDER_FA, 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;@4616a337, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=SYMBOLIC_RELATION, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-17 06:37:45,728 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-17 06:37:47,059 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 06:37:47,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 06:37:47,060 INFO L85 PathProgramCache]: Analyzing trace with hash 289691451, now seen corresponding path program 1 times [2024-10-17 06:37:47,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 06:37:47,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731178120] [2024-10-17 06:37:47,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:37:47,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:37:47,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:37:47,073 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-17 06:37:47,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 06:37:47,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731178120] [2024-10-17 06:37:47,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731178120] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 06:37:47,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 06:37:47,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-17 06:37:47,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784606926] [2024-10-17 06:37:47,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 06:37:47,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-17 06:37:47,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 06:37:47,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-17 06:37:47,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-17 06:37:47,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:37:47,077 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 06:37:47,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 06:37:47,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:37:47,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:37:47,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-17 06:37:47,726 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 06:37:47,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 06:37:47,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1893296980, now seen corresponding path program 1 times [2024-10-17 06:37:47,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 06:37:47,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928626946] [2024-10-17 06:37:47,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:37:47,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:37:47,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:37:48,397 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-17 06:37:48,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 06:37:48,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928626946] [2024-10-17 06:37:48,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928626946] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 06:37:48,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 06:37:48,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-17 06:37:48,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748805705] [2024-10-17 06:37:48,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 06:37:48,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-17 06:37:48,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 06:37:48,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-17 06:37:48,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-17 06:37:48,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:37:48,399 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 06:37:48,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 06:37:48,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:37:48,400 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:37:48,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:37:48,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:37:48,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-17 06:37:48,792 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 06:37:48,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 06:37:48,793 INFO L85 PathProgramCache]: Analyzing trace with hash -708586065, now seen corresponding path program 1 times [2024-10-17 06:37:48,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 06:37:48,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718116076] [2024-10-17 06:37:48,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:37:48,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:37:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:37:49,519 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 06:37:49,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 06:37:49,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718116076] [2024-10-17 06:37:49,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718116076] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 06:37:49,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092201956] [2024-10-17 06:37:49,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:37:49,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 06:37:49,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 06:37:49,522 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 06:37:49,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-17 06:37:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:37:49,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-17 06:37:49,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 06:37:49,695 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-17 06:37:49,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 16 [2024-10-17 06:37:49,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 18 [2024-10-17 06:37:49,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-10-17 06:37:50,013 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 06:37:50,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-17 06:37:50,150 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-10-17 06:37:50,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 28 [2024-10-17 06:37:50,273 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 06:37:50,273 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 06:37:50,408 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296)) (.cse3 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= .cse1 (mod (select .cse3 |c_~#value~0.offset|) 4294967296)))) (and (or .cse0 (forall ((v_DerPreprocessor_9 (Array Int Int))) (< .cse1 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_9) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (or (not .cse0) (forall ((|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (< .cse1 (mod (select (select (let ((.cse2 (store |c_#memory_int| |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| (+ |c_thr1Thread2of3ForFork0_~v~0#1| 1))))) (store .cse2 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse2 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))) is different from false [2024-10-17 06:37:54,411 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 06:37:54,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092201956] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 06:37:54,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 06:37:54,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 12] total 37 [2024-10-17 06:37:54,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293625050] [2024-10-17 06:37:54,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 06:37:54,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-17 06:37:54,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 06:37:54,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-17 06:37:54,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1074, Unknown=10, NotChecked=68, Total=1332 [2024-10-17 06:37:54,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:37:54,432 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 06:37:54,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.3783783783783785) internal successors, (88), 37 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 06:37:54,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:37:54,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:37:54,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:37:56,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:37:56,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:37:56,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-17 06:37:56,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-17 06:37:56,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-17 06:37:56,399 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 06:37:56,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 06:37:56,400 INFO L85 PathProgramCache]: Analyzing trace with hash -857142964, now seen corresponding path program 1 times [2024-10-17 06:37:56,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 06:37:56,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708654580] [2024-10-17 06:37:56,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:37:56,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:37:56,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:37:57,133 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-17 06:37:57,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 06:37:57,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708654580] [2024-10-17 06:37:57,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708654580] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 06:37:57,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764120383] [2024-10-17 06:37:57,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:37:57,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 06:37:57,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 06:37:57,136 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 06:37:57,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-17 06:37:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:37:57,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-17 06:37:57,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 06:37:57,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-10-17 06:37:57,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 17 [2024-10-17 06:37:57,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-17 06:37:57,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 32 [2024-10-17 06:37:57,295 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-17 06:37:57,296 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 36 treesize of output 17 [2024-10-17 06:37:57,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-17 06:37:57,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-17 06:37:57,450 INFO L349 Elim1Store]: treesize reduction 55, result has 24.7 percent of original size [2024-10-17 06:37:57,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 54 [2024-10-17 06:37:57,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-17 06:37:57,526 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-17 06:37:57,527 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 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-17 06:37:57,594 INFO L349 Elim1Store]: treesize reduction 51, result has 22.7 percent of original size [2024-10-17 06:37:57,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2024-10-17 06:37:57,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-17 06:37:57,610 INFO L349 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2024-10-17 06:37:57,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 1 [2024-10-17 06:37:57,689 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-17 06:37:57,690 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-17 06:37:57,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764120383] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 06:37:57,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-17 06:37:57,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 19 [2024-10-17 06:37:57,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183588172] [2024-10-17 06:37:57,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 06:37:57,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-17 06:37:57,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 06:37:57,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-17 06:37:57,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2024-10-17 06:37:57,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:37:57,692 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 06:37:57,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 06:37:57,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:37:57,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:37:57,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-10-17 06:37:57,694 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:38:01,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:38:01,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:38:01,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-17 06:38:01,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-17 06:38:01,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-17 06:38:01,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 06:38:01,682 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 06:38:01,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1699484387, now seen corresponding path program 1 times [2024-10-17 06:38:01,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:38:01,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:38:01,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:38:02,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 06:38:02,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:38:02,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:38:02,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:38:04,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 06:38:04,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-17 06:38:04,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-17 06:38:04,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812 [2024-10-17 06:38:04,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:38:04,608 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 06:38:04,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.75) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 06:38:04,609 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:38:04,609 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:38:04,609 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-10-17 06:38:04,609 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-10-17 06:38:04,609 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:38:06,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:38:06,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:38:06,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-10-17 06:38:06,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-17 06:38:06,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-17 06:38:06,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,SelfDestructingSolverStorable15 [2024-10-17 06:38:06,725 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 06:38:06,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 06:38:06,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1752847101, now seen corresponding path program 1 times [2024-10-17 06:38:06,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 06:38:06,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700746212] [2024-10-17 06:38:06,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:38:06,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:38:06,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:38:07,385 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 06:38:07,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 06:38:07,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700746212] [2024-10-17 06:38:07,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700746212] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 06:38:07,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183121158] [2024-10-17 06:38:07,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:38:07,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 06:38:07,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 06:38:07,388 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 06:38:07,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-17 06:38:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:38:07,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-17 06:38:07,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 06:38:07,550 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-17 06:38:07,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 16 [2024-10-17 06:38:07,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-10-17 06:38:07,655 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-17 06:38:07,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 21 [2024-10-17 06:38:07,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-10-17 06:38:07,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 17 [2024-10-17 06:38:07,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-17 06:38:07,815 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-17 06:38:07,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-10-17 06:38:07,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 47 [2024-10-17 06:38:07,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 22 [2024-10-17 06:38:07,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-17 06:38:08,000 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 06:38:08,000 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 06:38:08,066 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (and (or (forall ((v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (= (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_17) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_18) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)) .cse0) (or (forall ((v_DerPreprocessor_19 (Array Int Int))) (= (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_19) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)) (not .cse0)))) is different from false [2024-10-17 06:38:08,847 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (let ((.cse3 (not .cse5)) (.cse2 (select |c_#memory_int| |c_~#value~0.base|)) (.cse0 (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_~#value~0.base|))) (and (or (not .cse0) (and (or (forall ((v_ArrVal_445 Int) (v_DerPreprocessor_19 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse1 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| v_ArrVal_445)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)))) (or (= (mod (select (select (store .cse1 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_19) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< 0 (mod (select (select .cse1 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296))))) .cse3) (or (forall ((v_ArrVal_445 Int) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse4 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| v_ArrVal_445)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)))) (or (= (mod (select (select (store (store .cse4 |c_~#value~0.base| v_DerPreprocessor_17) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_18) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< 0 (mod (select (select .cse4 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296))))) .cse5))) (or (and (or .cse3 (forall ((v_ArrVal_445 Int) (v_DerPreprocessor_21 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (< 0 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_21) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| v_ArrVal_445)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)))) (or (forall ((v_ArrVal_445 Int) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int)) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse6 (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| v_ArrVal_445)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1))) (or (< 0 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_22) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| .cse6) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (= (mod (select (select (store (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| .cse6) |c_~#value~0.base| v_DerPreprocessor_17) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_18) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)))) .cse5)) .cse0)))) is different from false [2024-10-17 06:38:09,513 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#value~0.base|)) (.cse9 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (let ((.cse5 (not (= (select |c_#valid| |c_~#value~0.base|) 0))) (.cse4 (not .cse9)) (.cse0 (= (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296) (mod (select .cse3 |c_~#value~0.offset|) 4294967296)))) (and (or (not .cse0) (and (or (forall ((v_ArrVal_445 Int) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| Int) (v_DerPreprocessor_21 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (or (= |c_~#value~0.base| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) (< 0 (mod (select (select (let ((.cse2 (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse1 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse2))) (store (store .cse1 |c_~#value~0.base| v_DerPreprocessor_21) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| (store (select (store .cse1 |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| v_ArrVal_445)) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) 0)))) .cse4) (or .cse5 .cse4 (forall ((v_ArrVal_445 Int) (v_DerPreprocessor_19 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse6 (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) (or (= (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store (store .cse6 |c_~#value~0.offset| v_ArrVal_445) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#value~0.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< 0 (mod (select (select (let ((.cse7 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse6))) (store .cse7 |c_~#value~0.base| (store (store (select .cse7 |c_~#value~0.base|) |c_~#value~0.offset| v_ArrVal_445) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)))))))) (or (and (or .cse4 (forall ((v_prenex_59 Int) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| Int) (v_DerPreprocessor_21 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_23 (Array Int Int)) (v_prenex_60 Int)) (or (= |c_~#value~0.base| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) 0)) (< 0 (mod (select (select (let ((.cse8 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_23))) (store (store .cse8 |c_~#value~0.base| v_DerPreprocessor_21) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| (store (select (store .cse8 |c_~#value~0.base| (store v_DerPreprocessor_23 |c_~#value~0.offset| v_prenex_59)) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) v_prenex_60 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296))))) (or .cse9 (forall ((v_prenex_64 (Array Int Int)) (v_prenex_63 (Array Int Int)) (v_prenex_62 Int) (v_prenex_65 Int) (v_DerPreprocessor_22 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_23 (Array Int Int)) (v_prenex_61 Int)) (let ((.cse10 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_23))) (let ((.cse11 (store (select (store .cse10 |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| v_prenex_61)) v_prenex_62) v_prenex_65 1))) (or (= |c_~#value~0.base| v_prenex_62) (< 0 (mod (select (select (store (store .cse10 |c_~#value~0.base| v_DerPreprocessor_22) v_prenex_62 .cse11) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (not (= (select |c_#valid| v_prenex_62) 0)) (= (mod (select (select (store (store (store |c_#memory_int| v_prenex_62 .cse11) |c_~#value~0.base| v_prenex_63) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_prenex_64) v_prenex_62) v_prenex_65) 4294967296) 0)))))) (or .cse5 (and (or (forall ((v_DerPreprocessor_19 (Array Int Int)) (v_prenex_58 Int) (v_prenex_57 Int) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_23 (Array Int Int))) (or (= (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store (store v_DerPreprocessor_23 |c_~#value~0.offset| v_prenex_57) v_prenex_58 1)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#value~0.base|) v_prenex_58) 4294967296) 0) (< 0 (mod (select (select (let ((.cse12 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_23))) (store .cse12 |c_~#value~0.base| (store (store (select .cse12 |c_~#value~0.base|) |c_~#value~0.offset| v_prenex_57) v_prenex_58 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)))) .cse4) (or .cse9 (forall ((v_ArrVal_445 Int) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_23 (Array Int Int))) (or (< 0 (mod (select (select (let ((.cse13 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_23))) (store .cse13 |c_~#value~0.base| (store (store (select .cse13 |c_~#value~0.base|) |c_~#value~0.offset| v_ArrVal_445) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (= (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_17) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_18) |c_~#value~0.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0))))))) .cse0)))) is different from false [2024-10-17 06:38:09,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-17 06:38:09,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-17 06:38:09,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2024-10-17 06:38:09,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2024-10-17 06:38:09,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-17 06:38:09,689 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-17 06:38:10,088 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 11 not checked. [2024-10-17 06:38:10,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183121158] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 06:38:10,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 06:38:10,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 13] total 31 [2024-10-17 06:38:10,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026290470] [2024-10-17 06:38:10,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 06:38:10,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-17 06:38:10,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 06:38:10,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-17 06:38:10,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=688, Unknown=7, NotChecked=168, Total=992 [2024-10-17 06:38:10,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:38:10,091 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 06:38:10,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.09375) internal successors, (99), 31 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 06:38:10,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:38:10,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:38:10,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-10-17 06:38:10,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-17 06:38:10,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-17 06:38:10,092 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:38:12,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:38:12,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:38:12,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-10-17 06:38:12,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-17 06:38:12,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-17 06:38:12,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-17 06:38:12,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-17 06:38:12,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-17 06:38:12,941 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 06:38:13,032 INFO L85 PathProgramCache]: Analyzing trace with hash 878789600, now seen corresponding path program 1 times [2024-10-17 06:38:13,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:38:13,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:38:13,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:38:13,059 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 06:38:13,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:38:13,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 06:38:13,077 INFO L85 PathProgramCache]: Analyzing trace with hash -830412570, now seen corresponding path program 2 times [2024-10-17 06:38:13,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 06:38:13,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375915049] [2024-10-17 06:38:13,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:38:13,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:38:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:38:13,956 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-17 06:38:13,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 06:38:13,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375915049] [2024-10-17 06:38:13,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375915049] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 06:38:13,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450878170] [2024-10-17 06:38:13,957 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-17 06:38:13,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 06:38:13,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 06:38:13,958 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 06:38:13,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-17 06:38:14,067 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-17 06:38:14,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 06:38:14,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-17 06:38:14,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 06:38:14,287 INFO L349 Elim1Store]: treesize reduction 25, result has 51.9 percent of original size [2024-10-17 06:38:14,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 103 [2024-10-17 06:38:14,313 INFO L349 Elim1Store]: treesize reduction 25, result has 41.9 percent of original size [2024-10-17 06:38:14,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 69 treesize of output 82 [2024-10-17 06:38:14,347 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 16 treesize of output 13 [2024-10-17 06:38:14,363 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-17 06:38:14,364 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 2 case distinctions, treesize of input 23 treesize of output 7 [2024-10-17 06:38:14,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 57 [2024-10-17 06:38:14,409 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 3 [2024-10-17 06:38:14,587 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-17 06:38:14,587 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 06:38:14,746 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#value~0.base|)) (.cse0 (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296))) (let ((.cse3 (= (mod (select .cse2 |c_~#value~0.offset|) 4294967296) .cse0))) (and (or (< .cse0 (mod (select (select (let ((.cse1 (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| |c_thr1Thread3of3ForFork0_~vn~0#1|)))) (store .cse1 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select .cse1 |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not .cse3)) (or (forall ((v_DerPreprocessor_27 (Array Int Int))) (or (< .cse0 (mod (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_27) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= (mod (select v_DerPreprocessor_27 |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0))) .cse3)))) is different from false [2024-10-17 06:38:14,989 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-10-17 06:38:14,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 1 [2024-10-17 06:38:14,991 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-17 06:38:14,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450878170] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 06:38:14,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 06:38:14,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 26 [2024-10-17 06:38:14,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689965243] [2024-10-17 06:38:14,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 06:38:14,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-17 06:38:14,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 06:38:14,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-17 06:38:14,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=532, Unknown=1, NotChecked=48, Total=702 [2024-10-17 06:38:14,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:38:14,993 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 06:38:14,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.769230769230769) internal successors, (98), 27 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 06:38:14,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:38:14,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:38:14,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-10-17 06:38:14,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-17 06:38:14,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-17 06:38:14,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-17 06:38:14,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:38:17,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:38:17,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:38:17,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-10-17 06:38:17,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-17 06:38:17,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-17 06:38:17,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-17 06:38:17,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-17 06:38:17,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-17 06:38:18,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-17 06:38:18,052 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 06:38:18,136 INFO L85 PathProgramCache]: Analyzing trace with hash 878789653, now seen corresponding path program 1 times [2024-10-17 06:38:18,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:38:18,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:38:18,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:38:18,154 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 06:38:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:38:18,285 INFO L85 PathProgramCache]: Analyzing trace with hash -2108269025, now seen corresponding path program 1 times [2024-10-17 06:38:18,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:38:18,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:38:18,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:38:18,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 06:38:18,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:38:18,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:38:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:38:19,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 06:38:19,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-17 06:38:19,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-17 06:38:19,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=2715, Unknown=0, NotChecked=0, Total=2970 [2024-10-17 06:38:19,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:38:19,160 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 06:38:19,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 06:38:19,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:38:19,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:38:19,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-10-17 06:38:19,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-17 06:38:19,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-17 06:38:19,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-10-17 06:38:19,160 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-10-17 06:38:19,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:38:20,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:38:20,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:38:20,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-10-17 06:38:20,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-17 06:38:20,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-17 06:38:20,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-17 06:38:20,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-17 06:38:20,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-17 06:38:20,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,SelfDestructingSolverStorable20,SelfDestructingSolverStorable21 [2024-10-17 06:38:20,950 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 06:38:21,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1592029854, now seen corresponding path program 1 times [2024-10-17 06:38:21,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:38:21,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:38:21,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:38:21,465 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 06:38:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:38:21,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 06:38:21,513 INFO L85 PathProgramCache]: Analyzing trace with hash 693590328, now seen corresponding path program 1 times [2024-10-17 06:38:21,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 06:38:21,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054970718] [2024-10-17 06:38:21,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:38:21,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:38:21,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:38:22,369 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 06:38:22,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 06:38:22,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054970718] [2024-10-17 06:38:22,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054970718] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 06:38:22,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669744842] [2024-10-17 06:38:22,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:38:22,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 06:38:22,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 06:38:22,372 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 06:38:22,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-17 06:38:22,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:38:22,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-17 06:38:22,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 06:38:22,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-17 06:38:22,559 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-17 06:38:22,560 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-17 06:38:22,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669744842] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 06:38:22,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-17 06:38:22,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [14] total 17 [2024-10-17 06:38:22,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52743209] [2024-10-17 06:38:22,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 06:38:22,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-17 06:38:22,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 06:38:22,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-17 06:38:22,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-10-17 06:38:22,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:38:22,561 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 06:38:22,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 06:38:22,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:38:22,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:38:22,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-10-17 06:38:22,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-17 06:38:22,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-17 06:38:22,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-10-17 06:38:22,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2024-10-17 06:38:22,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-17 06:38:22,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:38:23,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:38:23,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:38:23,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-10-17 06:38:23,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-17 06:38:23,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-17 06:38:23,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-17 06:38:23,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-17 06:38:23,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-17 06:38:23,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 06:38:23,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-17 06:38:23,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 06:38:23,457 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 06:38:24,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1592029835, now seen corresponding path program 1 times [2024-10-17 06:38:24,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:38:24,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:38:24,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:38:24,151 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 06:38:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:38:24,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 06:38:24,190 INFO L85 PathProgramCache]: Analyzing trace with hash -579704076, now seen corresponding path program 1 times [2024-10-17 06:38:24,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 06:38:24,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113435872] [2024-10-17 06:38:24,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:38:24,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:38:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:38:25,502 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 06:38:25,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 06:38:25,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113435872] [2024-10-17 06:38:25,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113435872] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 06:38:25,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132341960] [2024-10-17 06:38:25,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:38:25,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 06:38:25,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 06:38:25,504 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 06:38:25,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-17 06:38:25,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:38:25,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-17 06:38:25,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 06:38:25,675 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-17 06:38:25,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 16 [2024-10-17 06:38:25,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 18 [2024-10-17 06:38:25,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-10-17 06:38:26,049 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-17 06:38:26,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 16 [2024-10-17 06:38:26,259 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 06:38:26,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-17 06:38:26,464 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2024-10-17 06:38:26,481 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-17 06:38:26,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 25 [2024-10-17 06:38:26,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-17 06:38:26,655 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 06:38:26,656 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 06:38:29,948 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_23| Int) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| Int) (v_ArrVal_815 Int) (v_ArrVal_814 Int) (v_DerPreprocessor_29 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse6 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse1 (select .cse6 |c_~#value~0.offset|))) (let ((.cse4 (+ 1 .cse1))) (let ((.cse5 (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_814)) (.cse3 (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| .cse4)) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base|))) (or (let ((.cse0 (select (select (let ((.cse2 (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| .cse4)))) (store .cse2 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23| (store (select .cse2 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* (div .cse0 4294967296) 4294967296) .cse1) (+ .cse0 (* (div .cse1 4294967296) 4294967296)))) (not (= (select (store .cse5 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23| v_ArrVal_815) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20|) 0)) (not (= (select .cse5 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23|) 0)) (not (= (mod (select .cse3 |c_~#value~0.offset|) 4294967296) (mod .cse1 4294967296))))))))) is different from false [2024-10-17 06:38:31,087 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_23| Int) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| Int) (v_ArrVal_815 Int) (v_ArrVal_814 Int) (v_DerPreprocessor_29 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse12 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse1 (select .cse12 |c_~#value~0.offset|))) (let ((.cse11 (store |c_#memory_int| |c_~#value~0.base| (store .cse12 |c_~#value~0.offset| (+ 1 .cse1))))) (let ((.cse10 (store (select .cse11 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse9 (select (store .cse11 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse10) |c_~#value~0.base|))) (let ((.cse3 (select .cse9 |c_~#value~0.offset|))) (let ((.cse6 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse10)) (.cse8 (+ .cse3 1))) (let ((.cse7 (select (store (store .cse6 |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| .cse8)) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base|)) (.cse0 (mod .cse3 4294967296)) (.cse2 (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_814))) (or (< .cse0 (+ (mod .cse1 4294967296) 1)) (not (= (select (store .cse2 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23| v_ArrVal_815) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20|) 0)) (let ((.cse4 (select (select (let ((.cse5 (store (store .cse6 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base| (store .cse7 |c_~#value~0.offset| .cse8)))) (store .cse5 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23| (store (select .cse5 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ .cse3 (* 4294967296 (div .cse4 4294967296))) (+ .cse4 (* (div .cse3 4294967296) 4294967296)))) (not (= (mod (select .cse7 |c_~#value~0.offset|) 4294967296) .cse0)) (not (= (select .cse2 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23|) 0)))))))))))) is different from false [2024-10-17 06:38:31,468 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-17 06:38:31,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132341960] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 06:38:31,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 06:38:31,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 17] total 54 [2024-10-17 06:38:31,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90717284] [2024-10-17 06:38:31,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 06:38:31,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-10-17 06:38:31,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 06:38:31,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-10-17 06:38:31,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=2484, Unknown=26, NotChecked=206, Total=2970 [2024-10-17 06:38:31,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:38:31,471 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 06:38:31,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 1.7272727272727273) internal successors, (95), 54 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 06:38:31,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:38:31,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:38:31,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-10-17 06:38:31,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-17 06:38:31,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-17 06:38:31,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-10-17 06:38:31,471 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-10-17 06:38:31,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-17 06:38:31,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-17 06:38:31,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:38:42,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:38:48,740 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse26 (select .cse9 |c_~#value~0.offset|))) (let ((.cse18 (mod .cse26 4294967296)) (.cse46 (div .cse26 4294967296)) (.cse47 (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_~#value~0.base|))) (let ((.cse52 (+ 1 .cse26)) (.cse29 (not .cse47)) (.cse27 (* .cse46 4294967296)) (.cse7 (* (div |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296) 4294967296)) (.cse42 (= .cse18 (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296))) (.cse48 (= (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 0))) (let ((.cse0 (not (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (.cse1 (or .cse47 .cse48)) (.cse3 (not .cse42)) (.cse2 (or .cse29 (< (+ |c_thr1Thread3of3ForFork0_~v~0#1| .cse27) (+ .cse7 .cse26)))) (.cse4 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296)) (.cse30 (div |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296)) (.cse34 (+ |c_thr1Thread3of3ForFork0_~v~0#1| 1)) (.cse21 (store |c_#memory_int| |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| .cse52)))) (and .cse0 (or (and .cse0 .cse1 .cse2) (= (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 0)) (or .cse3 (forall ((v_DerPreprocessor_29 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse5 (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| |c_thr1Thread3of3ForFork0_~vn~0#1|)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_29) |c_~#value~0.base|))) (or (not (= .cse4 (mod (select .cse5 |c_~#value~0.offset|) 4294967296))) (let ((.cse6 (select (select (let ((.cse8 (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_29) |c_~#value~0.base| (store .cse5 |c_~#value~0.offset| |c_thr1Thread2of3ForFork0_~vn~0#1|)))) (store .cse8 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse8 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ |c_thr1Thread3of3ForFork0_~v~0#1| (* (div .cse6 4294967296) 4294967296)) (+ .cse7 .cse6))))))) (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_23| Int) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| Int) (v_ArrVal_815 Int) (v_ArrVal_814 Int) (|v_thr1Thread1of3ForFork0_~#casret~0#1.base_20| Int) (v_DerPreprocessor_29 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse20 (store (select .cse21 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_20|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse19 (select (store .cse21 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_20| .cse20) |c_~#value~0.base|))) (let ((.cse10 (select .cse19 |c_~#value~0.offset|))) (let ((.cse13 (store |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_20| .cse20)) (.cse15 (+ .cse10 1))) (let ((.cse14 (select (store (store .cse13 |c_~#value~0.base| (store .cse19 |c_~#value~0.offset| .cse15)) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base|)) (.cse17 (mod .cse10 4294967296)) (.cse16 (store |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_20| v_ArrVal_814))) (or (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_20|) 0)) (let ((.cse11 (select (select (let ((.cse12 (store (store .cse13 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base| (store .cse14 |c_~#value~0.offset| .cse15)))) (store .cse12 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23| (store (select .cse12 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ .cse10 (* (div .cse11 4294967296) 4294967296)) (+ .cse11 (* (div .cse10 4294967296) 4294967296)))) (not (= (select (store .cse16 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23| v_ArrVal_815) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20|) 0)) (not (= .cse17 (mod (select .cse14 |c_~#value~0.offset|) 4294967296))) (< .cse17 (+ .cse18 1)) (not (= (select .cse16 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23|) 0))))))))) (or (forall ((|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse22 (select (select (let ((.cse23 (store |c_#memory_int| |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| |c_thr1Thread2of3ForFork0_~vn~0#1|)))) (store .cse23 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse23 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ |c_thr1Thread3of3ForFork0_~v~0#1| (* (div .cse22 4294967296) 4294967296)) (+ .cse7 .cse22)))) (not (= .cse4 .cse18))) (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| Int) (v_DerPreprocessor_29 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse24 (select (store .cse21 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base|))) (or (not (= (mod (select .cse24 |c_~#value~0.offset|) 4294967296) .cse4)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20|) 0)) (let ((.cse25 (select (select (let ((.cse28 (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base| (store .cse24 |c_~#value~0.offset| (+ |c_thr1Thread2of3ForFork0_~v~0#1| 1))))) (store .cse28 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse28 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* 4294967296 (div .cse25 4294967296)) .cse26) (+ .cse25 .cse27)))))) (or .cse29 (and (<= .cse30 0) (= 0 .cse26) (<= 1 |c_thr1Thread2of3ForFork0_~v~0#1|)) (and (<= |c_thr1Thread3of3ForFork0_~v~0#1| (+ .cse7 4294967294)) (<= |c_thr1Thread2of3ForFork0_~vn~0#1| (+ |c_thr1Thread3of3ForFork0_~v~0#1| (* (div (+ (- 1) (* (- 1) |c_thr1Thread3of3ForFork0_~v~0#1|) |c_thr1Thread2of3ForFork0_~vn~0#1|) 4294967296) 4294967296) 1)))) .cse1 (or (forall ((v_DerPreprocessor_29 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse33 (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| .cse34)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_29) |c_~#value~0.base|))) (or (let ((.cse31 (select (select (let ((.cse32 (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_29) |c_~#value~0.base| (store .cse33 |c_~#value~0.offset| |c_thr1Thread2of3ForFork0_~vn~0#1|)))) (store .cse32 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse32 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ |c_thr1Thread3of3ForFork0_~v~0#1| (* (div .cse31 4294967296) 4294967296)) (+ .cse31 .cse7))) (not (= .cse4 (mod (select .cse33 |c_~#value~0.offset|) 4294967296)))))) .cse3) .cse2 (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| Int)) (or (forall ((v_DerPreprocessor_29 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse37 (select (store .cse21 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base|))) (or (let ((.cse35 (select (select (let ((.cse36 (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base| (store .cse37 |c_~#value~0.offset| |c_thr1Thread2of3ForFork0_~vn~0#1|)))) (store .cse36 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse36 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* (div .cse35 4294967296) 4294967296) .cse26) (+ .cse27 .cse35))) (not (= (mod (select .cse37 |c_~#value~0.offset|) 4294967296) .cse4))))) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20|) 0)))) (or (forall ((v_DerPreprocessor_28 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse41 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_28))) (let ((.cse38 (select .cse41 |c_~#value~0.base|))) (or (not (= .cse4 (mod (select .cse38 |c_~#value~0.offset|) 4294967296))) (let ((.cse39 (select (select (let ((.cse40 (store .cse41 |c_~#value~0.base| (store .cse38 |c_~#value~0.offset| |c_thr1Thread2of3ForFork0_~vn~0#1|)))) (store .cse40 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse40 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ |c_thr1Thread3of3ForFork0_~v~0#1| (* (div .cse39 4294967296) 4294967296)) (+ .cse7 .cse39))))))) .cse42) (forall ((v_DerPreprocessor_29 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse45 (select (store .cse21 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_29) |c_~#value~0.base|))) (or (let ((.cse43 (select (select (let ((.cse44 (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_29) |c_~#value~0.base| (store .cse45 |c_~#value~0.offset| |c_thr1Thread2of3ForFork0_~vn~0#1|)))) (store .cse44 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse44 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* (div .cse43 4294967296) 4294967296) .cse26) (+ .cse43 .cse27))) (not (= .cse4 (mod (select .cse45 |c_~#value~0.offset|) 4294967296)))))) (or (and (<= .cse34 .cse26) (or (< .cse46 (+ .cse30 1)) (= .cse34 .cse26)) (= |c_thr1Thread3of3ForFork0_~v~0#1| |c_thr1Thread2of3ForFork0_~v~0#1|)) .cse47 .cse48) (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_23| Int) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| Int) (v_ArrVal_815 Int) (v_DerPreprocessor_29 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse51 (select (store .cse21 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base|))) (or (let ((.cse49 (select (select (let ((.cse50 (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base| (store .cse51 |c_~#value~0.offset| .cse52)))) (store .cse50 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23| (store (select .cse50 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* (div .cse49 4294967296) 4294967296) .cse26) (+ .cse49 .cse27))) (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23|) 0)) (not (= (mod (select .cse51 |c_~#value~0.offset|) 4294967296) .cse18)) (not (= (select (store |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23| v_ArrVal_815) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20|) 0))))) (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| Int) (v_DerPreprocessor_29 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse53 (select (store .cse21 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base|))) (or (not (= (mod (select .cse53 |c_~#value~0.offset|) 4294967296) .cse18)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20|) 0)) (let ((.cse54 (select (select (let ((.cse55 (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base| (store .cse53 |c_~#value~0.offset| .cse52)))) (store .cse55 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse55 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* 4294967296 (div .cse54 4294967296)) .cse26) (+ .cse54 .cse27)))))))))))) is different from false [2024-10-17 06:39:05,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:39:05,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:39:05,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-10-17 06:39:05,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-17 06:39:05,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-17 06:39:05,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-17 06:39:05,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-17 06:39:05,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-17 06:39:05,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:39:05,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-10-17 06:39:05,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-17 06:39:05,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25 [2024-10-17 06:39:05,874 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 06:39:06,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1592029792, now seen corresponding path program 1 times [2024-10-17 06:39:06,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:39:06,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:39:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:39:06,264 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 06:39:06,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:39:06,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 06:39:06,302 INFO L85 PathProgramCache]: Analyzing trace with hash -274147192, now seen corresponding path program 1 times [2024-10-17 06:39:06,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 06:39:06,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071353410] [2024-10-17 06:39:06,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:39:06,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:39:06,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:39:07,201 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-17 06:39:07,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 06:39:07,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071353410] [2024-10-17 06:39:07,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071353410] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 06:39:07,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662539913] [2024-10-17 06:39:07,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:39:07,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 06:39:07,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 06:39:07,204 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 06:39:07,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-17 06:39:07,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:39:07,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-17 06:39:07,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 06:39:07,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-17 06:39:07,384 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 06:39:07,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-17 06:39:07,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-10-17 06:39:07,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-17 06:39:07,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 32 [2024-10-17 06:39:07,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2024-10-17 06:39:07,517 INFO L349 Elim1Store]: treesize reduction 74, result has 20.4 percent of original size [2024-10-17 06:39:07,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 129 treesize of output 180 [2024-10-17 06:39:07,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2024-10-17 06:39:07,552 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2024-10-17 06:39:07,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 49 treesize of output 38 [2024-10-17 06:39:07,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-17 06:39:07,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-17 06:39:07,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-17 06:39:07,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2024-10-17 06:39:07,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-10-17 06:39:07,839 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 06:39:07,840 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 06:39:07,913 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 7 treesize of output 5 [2024-10-17 06:39:08,189 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= (mod (select .cse2 |c_~#value~0.offset|) 4294967296) (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296)))) (and (or .cse0 (forall ((v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (or (< 0 (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_44) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_42) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select v_DerPreprocessor_42 |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296))))) (or (not .cse0) (let ((.cse1 (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_~#value~0.base|))) (and (or .cse1 (forall ((v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_952 Int)) (or (< 0 (mod (select (select (store (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_43) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| v_ArrVal_952)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_42) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select v_DerPreprocessor_42 |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296))))) (or (not .cse1) (forall ((v_DerPreprocessor_42 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_ArrVal_952 Int)) (or (< 0 (mod (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| v_ArrVal_952)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_42) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select v_DerPreprocessor_42 |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296))))))))))) is different from false [2024-10-17 06:39:08,273 INFO L349 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2024-10-17 06:39:08,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 34 [2024-10-17 06:39:08,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-17 06:39:08,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 43 [2024-10-17 06:39:08,292 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-17 06:39:08,292 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-17 06:39:08,338 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 06:39:08,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662539913] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 06:39:08,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 06:39:08,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 12] total 32 [2024-10-17 06:39:08,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892670636] [2024-10-17 06:39:08,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 06:39:08,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-17 06:39:08,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 06:39:08,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-17 06:39:08,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=828, Unknown=6, NotChecked=58, Total=992 [2024-10-17 06:39:08,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:39:08,341 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 06:39:08,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.25) internal successors, (104), 32 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 06:39:08,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:39:08,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:39:08,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-10-17 06:39:08,341 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-17 06:39:08,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-17 06:39:08,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-17 06:39:08,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-10-17 06:39:08,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-17 06:39:08,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:39:08,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2024-10-17 06:39:08,342 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:39:11,899 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|)) (.cse0 (+ |c_thr1Thread2of3ForFork0_~v~0#1| 1)) (.cse3 (not (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (.cse4 (= |c_thr1Thread2of3ForFork0_~#casret~0#1.offset| |c_~#value~0.offset|)) (.cse2 (<= |c_thr1Thread2of3ForFork0_~v~0#1| (+ 4294967294 (* 4294967296 (div |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296)))))) (and (or (and (= .cse0 .cse1) .cse2) (= (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 0)) (= (select |c_#valid| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) 1) (or .cse3 (and .cse4 (or (= 0 .cse1) (= 1 .cse1)))) (= |c_thr1Thread2of3ForFork0_~vn~0#1| .cse0) (= 0 |c_~#value~0.offset|) (or .cse3 (and (= |c_thr1Thread2of3ForFork0_~v~0#1| 0) .cse4)) (forall ((v_DerPreprocessor_42 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (or (< 0 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_42) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296)) (< 0 (mod (select v_DerPreprocessor_42 |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)))) .cse2)) is different from false [2024-10-17 06:39:41,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:39:49,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-17 06:39:51,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-17 06:39:53,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-17 06:39:55,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-17 06:39:57,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-17 06:40:10,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:40:10,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:40:10,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2024-10-17 06:40:10,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-17 06:40:10,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-17 06:40:10,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-17 06:40:10,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-17 06:40:10,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-17 06:40:10,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:40:10,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-10-17 06:40:10,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-10-17 06:40:10,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-10-17 06:40:10,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27 [2024-10-17 06:40:10,833 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 06:40:10,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1710471982, now seen corresponding path program 1 times [2024-10-17 06:40:10,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:40:10,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:40:10,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:40:10,958 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 06:40:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:40:10,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 06:40:10,970 INFO L85 PathProgramCache]: Analyzing trace with hash -55427819, now seen corresponding path program 2 times [2024-10-17 06:40:10,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 06:40:10,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17865044] [2024-10-17 06:40:10,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:40:10,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:40:10,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:40:12,519 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 06:40:12,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 06:40:12,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17865044] [2024-10-17 06:40:12,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17865044] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 06:40:12,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123423827] [2024-10-17 06:40:12,520 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-17 06:40:12,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 06:40:12,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 06:40:12,521 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 06:40:12,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-17 06:40:12,661 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-17 06:40:12,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 06:40:12,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-17 06:40:12,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 06:40:12,723 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-17 06:40:12,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 16 [2024-10-17 06:40:12,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-10-17 06:40:12,844 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 16 treesize of output 11 [2024-10-17 06:40:12,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-10-17 06:40:12,990 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-17 06:40:12,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 21 [2024-10-17 06:40:13,061 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-17 06:40:13,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-10-17 06:40:13,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-10-17 06:40:13,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-17 06:40:13,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-10-17 06:40:13,328 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 16 treesize of output 11 [2024-10-17 06:40:13,370 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 06:40:13,370 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 06:40:13,587 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296))) (or (= .cse0 4294967295) (let ((.cse1 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse2 (= .cse0 (mod (select .cse1 |c_~#value~0.offset|) 4294967296)))) (and (or (forall ((v_DerPreprocessor_46 (Array Int Int))) (< .cse0 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse1 |c_~#value~0.offset| (+ |c_thr1Thread2of3ForFork0_~v~0#1| 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_46) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (not .cse2)) (or .cse2 (forall ((v_DerPreprocessor_45 (Array Int Int))) (< .cse0 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_45) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))))))))) is different from false [2024-10-17 06:40:14,520 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (select .cse5 |c_~#value~0.offset|))) (or (= (mod .cse0 4294967296) 4294967295) (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_26| Int) (v_ArrVal_1034 Int) (v_DerPreprocessor_48 (Array Int Int)) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_27| Int) (v_DerPreprocessor_46 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse5 |c_~#value~0.offset| (+ 1 .cse0))) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_26| v_DerPreprocessor_48) |c_~#value~0.base|))) (let ((.cse4 (select .cse3 |c_~#value~0.offset|))) (let ((.cse2 (mod .cse4 4294967296)) (.cse1 (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_1034))) (or (not (= (select .cse1 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_27|) 0)) (< .cse2 (mod (select (select (store (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_26| v_DerPreprocessor_48) |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| (+ .cse4 1))) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_27| v_DerPreprocessor_46) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (= .cse2 4294967295) (not (= (select (store .cse1 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_27| 1) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_26|) 0)))))))))) is different from false [2024-10-17 06:40:44,206 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 06:40:44,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123423827] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 06:40:44,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 06:40:44,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 16] total 51 [2024-10-17 06:40:44,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927251716] [2024-10-17 06:40:44,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 06:40:44,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-17 06:40:44,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 06:40:44,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-17 06:40:44,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=2132, Unknown=35, NotChecked=194, Total=2652 [2024-10-17 06:40:44,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:40:44,209 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 06:40:44,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.8461538461538463) internal successors, (96), 51 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 06:40:44,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:40:44,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:40:44,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 68 states. [2024-10-17 06:40:44,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-17 06:40:44,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-17 06:40:44,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-17 06:40:44,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-10-17 06:40:44,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-17 06:40:44,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:40:44,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-10-17 06:40:44,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-10-17 06:40:44,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:40:54,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:41:18,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:41:26,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:41:51,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:41:53,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:41:56,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:41:58,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:42:03,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:42:36,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:42:38,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:42:42,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:42:44,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:42:46,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:42:48,111 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (let ((.cse0 (not .cse3))) (let ((.cse1 (or (forall ((v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (= (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_17) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_18) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)) .cse3)) (.cse2 (or (forall ((v_DerPreprocessor_19 (Array Int Int))) (= (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_19) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)) .cse0))) (and (or .cse0 (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| Int)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) 0)))) (or (< 0 (mod (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |c_thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (and .cse1 .cse2)) (or (not (= (select |c_#valid| |c_~#value~0.base|) 0)) .cse0) (= (select |c_#valid| 3) 1) .cse1 (= |c_~#value~0.base| 3) (= 0 |c_~#value~0.offset|) .cse2)))) is different from false [2024-10-17 06:42:49,097 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#value~0.base|)) (.cse0 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_~#casret~0#1.base|))) (let ((.cse6 (not (= (select |c_#valid| |c_~#value~0.base|) 0))) (.cse5 (not .cse0)) (.cse1 (= (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296) (mod (select .cse4 |c_~#value~0.offset|) 4294967296)))) (and (or (forall ((v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (= (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_17) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_18) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)) .cse0) (or (not .cse1) (and (or (forall ((v_ArrVal_445 Int) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| Int) (v_DerPreprocessor_21 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (or (= |c_~#value~0.base| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) (< 0 (mod (select (select (let ((.cse3 (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse2 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse3))) (store (store .cse2 |c_~#value~0.base| v_DerPreprocessor_21) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| (store (select (store .cse2 |c_~#value~0.base| (store .cse3 |c_~#value~0.offset| v_ArrVal_445)) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) 0)))) .cse5) (or .cse6 .cse5 (forall ((v_ArrVal_445 Int) (v_DerPreprocessor_19 (Array Int Int)) (|thr1Thread2of3ForFork0_~vn~0#1| Int) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse7 (store (select (store |c_#memory_int| |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| |thr1Thread2of3ForFork0_~vn~0#1|)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) (or (= (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store (store .cse7 |c_~#value~0.offset| v_ArrVal_445) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#value~0.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0) (< 0 (mod (select (select (let ((.cse8 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| .cse7))) (store .cse8 |c_~#value~0.base| (store (store (select .cse8 |c_~#value~0.base|) |c_~#value~0.offset| v_ArrVal_445) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)))))))) (or (forall ((v_DerPreprocessor_19 (Array Int Int))) (= (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_19) |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0)) .cse5) (or (and (or .cse5 (forall ((v_prenex_59 Int) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| Int) (v_DerPreprocessor_21 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_23 (Array Int Int)) (v_prenex_60 Int)) (or (= |c_~#value~0.base| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) 0)) (< 0 (mod (select (select (let ((.cse9 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_23))) (store (store .cse9 |c_~#value~0.base| v_DerPreprocessor_21) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15| (store (select (store .cse9 |c_~#value~0.base| (store v_DerPreprocessor_23 |c_~#value~0.offset| v_prenex_59)) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_15|) v_prenex_60 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296))))) (or .cse0 (forall ((v_prenex_64 (Array Int Int)) (v_prenex_63 (Array Int Int)) (v_prenex_62 Int) (v_prenex_65 Int) (v_DerPreprocessor_22 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_23 (Array Int Int)) (v_prenex_61 Int)) (let ((.cse10 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_23))) (let ((.cse11 (store (select (store .cse10 |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| v_prenex_61)) v_prenex_62) v_prenex_65 1))) (or (= |c_~#value~0.base| v_prenex_62) (< 0 (mod (select (select (store (store .cse10 |c_~#value~0.base| v_DerPreprocessor_22) v_prenex_62 .cse11) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (not (= (select |c_#valid| v_prenex_62) 0)) (= (mod (select (select (store (store (store |c_#memory_int| v_prenex_62 .cse11) |c_~#value~0.base| v_prenex_63) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_prenex_64) v_prenex_62) v_prenex_65) 4294967296) 0)))))) (or .cse6 (and (or (forall ((v_DerPreprocessor_19 (Array Int Int)) (v_prenex_58 Int) (v_prenex_57 Int) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_23 (Array Int Int))) (or (= (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store (store v_DerPreprocessor_23 |c_~#value~0.offset| v_prenex_57) v_prenex_58 1)) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_19) |c_~#value~0.base|) v_prenex_58) 4294967296) 0) (< 0 (mod (select (select (let ((.cse12 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_23))) (store .cse12 |c_~#value~0.base| (store (store (select .cse12 |c_~#value~0.base|) |c_~#value~0.offset| v_prenex_57) v_prenex_58 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)))) .cse5) (or .cse0 (forall ((v_ArrVal_445 Int) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (|thr1Thread3of3ForFork0_~#casret~0#1.offset| Int) (v_DerPreprocessor_23 (Array Int Int))) (or (< 0 (mod (select (select (let ((.cse13 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_23))) (store .cse13 |c_~#value~0.base| (store (store (select .cse13 |c_~#value~0.base|) |c_~#value~0.offset| v_ArrVal_445) |thr1Thread3of3ForFork0_~#casret~0#1.offset| 1))) |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset|) 4294967296)) (= (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| v_DerPreprocessor_17) |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_18) |c_~#value~0.base|) |thr1Thread3of3ForFork0_~#casret~0#1.offset|) 4294967296) 0))))))) .cse1)))) is different from false [2024-10-17 06:42:56,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:42:56,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:42:56,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-10-17 06:42:56,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-17 06:42:56,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-17 06:42:56,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-10-17 06:42:56,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-17 06:42:56,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-17 06:42:56,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:42:56,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2024-10-17 06:42:56,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-10-17 06:42:56,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-17 06:42:56,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-10-17 06:42:57,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-17 06:42:57,141 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 06:42:57,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1117146847, now seen corresponding path program 1 times [2024-10-17 06:42:57,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:42:57,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:42:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:42:58,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 06:42:58,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:42:58,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:42:58,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:43:01,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 06:43:01,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-17 06:43:01,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-17 06:43:01,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=6732, Unknown=0, NotChecked=0, Total=7140 [2024-10-17 06:43:01,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:43:01,075 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 06:43:01,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 06:43:01,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:43:01,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:43:01,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2024-10-17 06:43:01,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-17 06:43:01,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-10-17 06:43:01,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2024-10-17 06:43:01,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-17 06:43:01,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-17 06:43:01,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:43:01,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 70 states. [2024-10-17 06:43:01,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-10-17 06:43:01,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 71 states. [2024-10-17 06:43:01,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:43:12,968 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse8 (select .cse6 |c_~#value~0.offset|))) (let ((.cse11 (mod .cse8 4294967296))) (let ((.cse33 (+ 1 .cse8)) (.cse26 (= .cse11 (mod |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296)))) (let ((.cse0 (not .cse26)) (.cse4 (* (div |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296) 4294967296)) (.cse1 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296)) (.cse7 (* (div .cse8 4294967296) 4294967296)) (.cse15 (store |c_#memory_int| |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| .cse33)))) (and (or .cse0 (forall ((v_DerPreprocessor_29 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| |c_thr1Thread3of3ForFork0_~vn~0#1|)) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_29) |c_~#value~0.base|))) (or (not (= .cse1 (mod (select .cse2 |c_~#value~0.offset|) 4294967296))) (let ((.cse3 (select (select (let ((.cse5 (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_29) |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| |c_thr1Thread2of3ForFork0_~vn~0#1|)))) (store .cse5 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse5 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ |c_thr1Thread3of3ForFork0_~v~0#1| (* (div .cse3 4294967296) 4294967296)) (+ .cse4 .cse3))))))) (< (+ |c_thr1Thread3of3ForFork0_~v~0#1| .cse7) (+ .cse4 .cse8)) (or (forall ((|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse9 (select (select (let ((.cse10 (store |c_#memory_int| |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| |c_thr1Thread2of3ForFork0_~vn~0#1|)))) (store .cse10 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse10 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ |c_thr1Thread3of3ForFork0_~v~0#1| (* (div .cse9 4294967296) 4294967296)) (+ .cse4 .cse9)))) (not (= .cse1 .cse11))) (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| Int) (v_DerPreprocessor_29 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse12 (select (store .cse15 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base|))) (or (not (= (mod (select .cse12 |c_~#value~0.offset|) 4294967296) .cse1)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20|) 0)) (let ((.cse13 (select (select (let ((.cse14 (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base| (store .cse12 |c_~#value~0.offset| (+ |c_thr1Thread2of3ForFork0_~v~0#1| 1))))) (store .cse14 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse14 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* 4294967296 (div .cse13 4294967296)) .cse8) (+ .cse13 .cse7)))))) (or (forall ((v_DerPreprocessor_29 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse18 (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse6 |c_~#value~0.offset| (+ |c_thr1Thread3of3ForFork0_~v~0#1| 1))) |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_29) |c_~#value~0.base|))) (or (let ((.cse16 (select (select (let ((.cse17 (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_29) |c_~#value~0.base| (store .cse18 |c_~#value~0.offset| |c_thr1Thread2of3ForFork0_~vn~0#1|)))) (store .cse17 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse17 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ |c_thr1Thread3of3ForFork0_~v~0#1| (* (div .cse16 4294967296) 4294967296)) (+ .cse16 .cse4))) (not (= .cse1 (mod (select .cse18 |c_~#value~0.offset|) 4294967296)))))) .cse0) (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| Int)) (or (forall ((v_DerPreprocessor_29 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse21 (select (store .cse15 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base|))) (or (let ((.cse19 (select (select (let ((.cse20 (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base| (store .cse21 |c_~#value~0.offset| |c_thr1Thread2of3ForFork0_~vn~0#1|)))) (store .cse20 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse20 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* (div .cse19 4294967296) 4294967296) .cse8) (+ .cse7 .cse19))) (not (= (mod (select .cse21 |c_~#value~0.offset|) 4294967296) .cse1))))) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20|) 0)))) (or (forall ((v_DerPreprocessor_28 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse25 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_28))) (let ((.cse22 (select .cse25 |c_~#value~0.base|))) (or (not (= .cse1 (mod (select .cse22 |c_~#value~0.offset|) 4294967296))) (let ((.cse23 (select (select (let ((.cse24 (store .cse25 |c_~#value~0.base| (store .cse22 |c_~#value~0.offset| |c_thr1Thread2of3ForFork0_~vn~0#1|)))) (store .cse24 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse24 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ |c_thr1Thread3of3ForFork0_~v~0#1| (* (div .cse23 4294967296) 4294967296)) (+ .cse4 .cse23))))))) .cse26) (forall ((v_DerPreprocessor_29 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse29 (select (store .cse15 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_29) |c_~#value~0.base|))) (or (let ((.cse27 (select (select (let ((.cse28 (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_29) |c_~#value~0.base| (store .cse29 |c_~#value~0.offset| |c_thr1Thread2of3ForFork0_~vn~0#1|)))) (store .cse28 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse28 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* (div .cse27 4294967296) 4294967296) .cse8) (+ .cse27 .cse7))) (not (= .cse1 (mod (select .cse29 |c_~#value~0.offset|) 4294967296)))))) (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_23| Int) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| Int) (v_ArrVal_815 Int) (v_DerPreprocessor_29 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse32 (select (store .cse15 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base|))) (or (let ((.cse30 (select (select (let ((.cse31 (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base| (store .cse32 |c_~#value~0.offset| .cse33)))) (store .cse31 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23| (store (select .cse31 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* (div .cse30 4294967296) 4294967296) .cse8) (+ .cse30 .cse7))) (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23|) 0)) (not (= (mod (select .cse32 |c_~#value~0.offset|) 4294967296) .cse11)) (not (= (select (store |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23| v_ArrVal_815) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20|) 0))))) (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| Int) (v_DerPreprocessor_29 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse34 (select (store .cse15 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base|))) (or (not (= (mod (select .cse34 |c_~#value~0.offset|) 4294967296) .cse11)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20|) 0)) (let ((.cse35 (select (select (let ((.cse36 (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base| (store .cse34 |c_~#value~0.offset| .cse33)))) (store .cse36 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse36 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* 4294967296 (div .cse35 4294967296)) .cse8) (+ .cse35 .cse7)))))))))))) is different from false [2024-10-17 06:43:15,505 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse29 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse15 (select .cse29 |c_~#value~0.offset|))) (let ((.cse28 (+ 1 .cse15))) (let ((.cse18 (= |c_thr1Thread3of3ForFork0_~#casret~0#1.base| |c_~#value~0.base|)) (.cse13 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296)) (.cse16 (* (div .cse15 4294967296) 4294967296)) (.cse8 (mod .cse15 4294967296)) (.cse11 (store |c_#memory_int| |c_~#value~0.base| (store .cse29 |c_~#value~0.offset| .cse28)))) (and (= |c_thr1Thread2of3ForFork0_~v~0#1| 1) (= (select (select |c_#memory_int| 3) |c_~#value~0.offset|) 2) (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_23| Int) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| Int) (v_ArrVal_815 Int) (v_ArrVal_814 Int) (|v_thr1Thread1of3ForFork0_~#casret~0#1.base_20| Int) (v_DerPreprocessor_29 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse10 (store (select .cse11 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_20|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse9 (select (store .cse11 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_20| .cse10) |c_~#value~0.base|))) (let ((.cse0 (select .cse9 |c_~#value~0.offset|))) (let ((.cse3 (store |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_20| .cse10)) (.cse5 (+ .cse0 1))) (let ((.cse4 (select (store (store .cse3 |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| .cse5)) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base|)) (.cse7 (mod .cse0 4294967296)) (.cse6 (store |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_20| v_ArrVal_814))) (or (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_20|) 0)) (let ((.cse1 (select (select (let ((.cse2 (store (store .cse3 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| .cse5)))) (store .cse2 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23| (store (select .cse2 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ .cse0 (* (div .cse1 4294967296) 4294967296)) (+ .cse1 (* (div .cse0 4294967296) 4294967296)))) (not (= (select (store .cse6 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23| v_ArrVal_815) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20|) 0)) (not (= .cse7 (mod (select .cse4 |c_~#value~0.offset|) 4294967296))) (< .cse7 (+ .cse8 1)) (not (= (select .cse6 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23|) 0))))))))) (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| Int) (v_DerPreprocessor_29 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse12 (select (store .cse11 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base|))) (or (not (= (mod (select .cse12 |c_~#value~0.offset|) 4294967296) .cse13)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20|) 0)) (let ((.cse14 (select (select (let ((.cse17 (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base| (store .cse12 |c_~#value~0.offset| (+ |c_thr1Thread2of3ForFork0_~v~0#1| 1))))) (store .cse17 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse17 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* 4294967296 (div .cse14 4294967296)) .cse15) (+ .cse14 .cse16)))))) (= |c_thr1Thread3of3ForFork0_~v~0#1| 1) (or .cse18 (= (select (select |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base|) |c_thr1Thread3of3ForFork0_~#casret~0#1.offset|) 0)) (= |c_~#value~0.base| 3) (or (not .cse18) (< (+ |c_thr1Thread3of3ForFork0_~v~0#1| .cse16) (+ (* (div |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296) 4294967296) .cse15))) (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| Int)) (or (forall ((v_DerPreprocessor_29 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse21 (select (store .cse11 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base|))) (or (let ((.cse19 (select (select (let ((.cse20 (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base| (store .cse21 |c_~#value~0.offset| |c_thr1Thread2of3ForFork0_~vn~0#1|)))) (store .cse20 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse20 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* (div .cse19 4294967296) 4294967296) .cse15) (+ .cse16 .cse19))) (not (= (mod (select .cse21 |c_~#value~0.offset|) 4294967296) .cse13))))) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20|) 0)))) (= 2 |c_thr1Thread2of3ForFork0_~vn~0#1|) (forall ((v_DerPreprocessor_29 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse24 (select (store .cse11 |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_29) |c_~#value~0.base|))) (or (let ((.cse22 (select (select (let ((.cse23 (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_29) |c_~#value~0.base| (store .cse24 |c_~#value~0.offset| |c_thr1Thread2of3ForFork0_~vn~0#1|)))) (store .cse23 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse23 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* (div .cse22 4294967296) 4294967296) .cse15) (+ .cse22 .cse16))) (not (= .cse13 (mod (select .cse24 |c_~#value~0.offset|) 4294967296)))))) (not (= 3 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|)) (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_23| Int) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| Int) (v_ArrVal_815 Int) (v_DerPreprocessor_29 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse27 (select (store .cse11 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base|))) (or (let ((.cse25 (select (select (let ((.cse26 (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base| (store .cse27 |c_~#value~0.offset| .cse28)))) (store .cse26 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23| (store (select .cse26 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* (div .cse25 4294967296) 4294967296) .cse15) (+ .cse25 .cse16))) (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23|) 0)) (not (= (mod (select .cse27 |c_~#value~0.offset|) 4294967296) .cse8)) (not (= (select (store |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23| v_ArrVal_815) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20|) 0)))))))))) is different from false [2024-10-17 06:43:23,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:43:23,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:43:23,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-10-17 06:43:23,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-17 06:43:23,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-17 06:43:23,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-10-17 06:43:23,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-17 06:43:23,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-17 06:43:23,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:43:23,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2024-10-17 06:43:23,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-10-17 06:43:23,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-10-17 06:43:23,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-17 06:43:23,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,SelfDestructingSolverStorable31 [2024-10-17 06:43:23,703 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 06:43:23,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1992671352, now seen corresponding path program 1 times [2024-10-17 06:43:23,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:43:23,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:43:23,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:43:23,799 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 06:43:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 06:43:23,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1390291582, now seen corresponding path program 1 times [2024-10-17 06:43:23,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:43:23,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:43:23,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:43:24,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 06:43:24,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:43:24,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:43:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:43:25,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 06:43:25,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-17 06:43:25,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-17 06:43:25,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=604, Invalid=11606, Unknown=0, NotChecked=0, Total=12210 [2024-10-17 06:43:25,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:43:25,467 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 06:43:25,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 06:43:25,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:43:25,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:43:25,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2024-10-17 06:43:25,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-17 06:43:25,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-10-17 06:43:25,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2024-10-17 06:43:25,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-17 06:43:25,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-17 06:43:25,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:43:25,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 82 states. [2024-10-17 06:43:25,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 69 states. [2024-10-17 06:43:25,467 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 76 states. [2024-10-17 06:43:25,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-10-17 06:43:25,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:43:27,041 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse29 (select .cse14 |c_~#value~0.offset|))) (let ((.cse8 (mod .cse29 4294967296)) (.cse69 (mod |c_thr1Thread1of3ForFork0_~v~0#1| 4294967296))) (let ((.cse26 (= .cse8 .cse69)) (.cse47 (+ 1 .cse29))) (let ((.cse15 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296)) (.cse30 (* (div .cse29 4294967296) 4294967296)) (.cse11 (store |c_#memory_int| |c_~#value~0.base| (store .cse14 |c_~#value~0.offset| .cse47))) (.cse24 (+ 1 .cse69)) (.cse43 (not .cse26))) (and (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_23| Int) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| Int) (v_ArrVal_815 Int) (v_ArrVal_814 Int) (|v_thr1Thread1of3ForFork0_~#casret~0#1.base_20| Int) (v_DerPreprocessor_29 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse10 (store (select .cse11 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_20|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse9 (select (store .cse11 |v_thr1Thread1of3ForFork0_~#casret~0#1.base_20| .cse10) |c_~#value~0.base|))) (let ((.cse0 (select .cse9 |c_~#value~0.offset|))) (let ((.cse3 (store |c_#memory_int| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_20| .cse10)) (.cse5 (+ .cse0 1))) (let ((.cse4 (select (store (store .cse3 |c_~#value~0.base| (store .cse9 |c_~#value~0.offset| .cse5)) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base|)) (.cse7 (mod .cse0 4294967296)) (.cse6 (store |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_20| v_ArrVal_814))) (or (not (= (select |c_#valid| |v_thr1Thread1of3ForFork0_~#casret~0#1.base_20|) 0)) (let ((.cse1 (select (select (let ((.cse2 (store (store .cse3 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base| (store .cse4 |c_~#value~0.offset| .cse5)))) (store .cse2 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23| (store (select .cse2 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ .cse0 (* (div .cse1 4294967296) 4294967296)) (+ .cse1 (* (div .cse0 4294967296) 4294967296)))) (not (= (select (store .cse6 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23| v_ArrVal_815) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20|) 0)) (not (= .cse7 (mod (select .cse4 |c_~#value~0.offset|) 4294967296))) (< .cse7 (+ .cse8 1)) (not (= (select .cse6 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23|) 0))))))))) (or (forall ((|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse12 (select (select (let ((.cse13 (store |c_#memory_int| |c_~#value~0.base| (store .cse14 |c_~#value~0.offset| |c_thr1Thread2of3ForFork0_~vn~0#1|)))) (store .cse13 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse13 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ |c_thr1Thread3of3ForFork0_~v~0#1| (* (div .cse12 4294967296) 4294967296)) (+ (* (div |c_thr1Thread3of3ForFork0_~v~0#1| 4294967296) 4294967296) .cse12)))) (not (= .cse15 .cse8))) (or (forall ((v_DerPreprocessor_30 (Array Int Int)) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_23| Int) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| Int) (v_ArrVal_815 Int) (v_ArrVal_814 Int) (v_DerPreprocessor_29 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse20 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_30))) (let ((.cse25 (select .cse20 |c_~#value~0.base|))) (let ((.cse18 (select .cse25 |c_~#value~0.offset|))) (let ((.cse22 (+ .cse18 1))) (let ((.cse21 (select (store (store .cse20 |c_~#value~0.base| (store .cse25 |c_~#value~0.offset| .cse22)) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base|)) (.cse16 (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_814)) (.cse23 (mod .cse18 4294967296))) (or (not (= (select (store .cse16 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23| v_ArrVal_815) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20|) 0)) (let ((.cse17 (select (select (let ((.cse19 (store (store .cse20 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base| (store .cse21 |c_~#value~0.offset| .cse22)))) (store .cse19 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23| (store (select .cse19 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* 4294967296 (div .cse17 4294967296)) .cse18) (+ .cse17 (* (div .cse18 4294967296) 4294967296)))) (not (= .cse23 (mod (select .cse21 |c_~#value~0.offset|) 4294967296))) (not (= (select .cse16 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23|) 0)) (< .cse23 .cse24)))))))) .cse26) (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| Int) (v_DerPreprocessor_29 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse27 (select (store .cse11 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base|))) (or (not (= (mod (select .cse27 |c_~#value~0.offset|) 4294967296) .cse15)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20|) 0)) (let ((.cse28 (select (select (let ((.cse31 (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base| (store .cse27 |c_~#value~0.offset| (+ |c_thr1Thread2of3ForFork0_~v~0#1| 1))))) (store .cse31 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse31 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* 4294967296 (div .cse28 4294967296)) .cse29) (+ .cse28 .cse30)))))) (or (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_23| Int) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| Int) (v_ArrVal_815 Int) (v_ArrVal_814 Int) (v_DerPreprocessor_29 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse42 (store |c_#memory_int| |c_~#value~0.base| (store .cse14 |c_~#value~0.offset| |c_thr1Thread1of3ForFork0_~vn~0#1|)))) (let ((.cse41 (store (select .cse42 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse40 (select (store .cse42 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse41) |c_~#value~0.base|))) (let ((.cse34 (select .cse40 |c_~#value~0.offset|))) (let ((.cse37 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse41)) (.cse38 (+ .cse34 1))) (let ((.cse33 (select (store (store .cse37 |c_~#value~0.base| (store .cse40 |c_~#value~0.offset| .cse38)) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base|)) (.cse39 (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_814)) (.cse32 (mod .cse34 4294967296))) (or (not (= .cse32 (mod (select .cse33 |c_~#value~0.offset|) 4294967296))) (let ((.cse35 (select (select (let ((.cse36 (store (store .cse37 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base| (store .cse33 |c_~#value~0.offset| .cse38)))) (store .cse36 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23| (store (select .cse36 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ .cse34 (* (div .cse35 4294967296) 4294967296)) (+ .cse35 (* (div .cse34 4294967296) 4294967296)))) (not (= (select (store .cse39 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23| v_ArrVal_815) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20|) 0)) (not (= (select .cse39 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23|) 0)) (< .cse32 .cse24))))))))) .cse43) (or (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_23| Int) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| Int) (v_ArrVal_815 Int) (v_ArrVal_814 Int) (v_DerPreprocessor_29 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse48 (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_814)) (.cse46 (select (store .cse11 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base|))) (or (let ((.cse44 (select (select (let ((.cse45 (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base| (store .cse46 |c_~#value~0.offset| .cse47)))) (store .cse45 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23| (store (select .cse45 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* (div .cse44 4294967296) 4294967296) .cse29) (+ .cse44 .cse30))) (not (= (select (store .cse48 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23| v_ArrVal_815) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20|) 0)) (not (= (select .cse48 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23|) 0)) (not (= (mod (select .cse46 |c_~#value~0.offset|) 4294967296) .cse8))))) (< .cse8 .cse24)) (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| Int)) (or (forall ((v_DerPreprocessor_29 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse51 (select (store .cse11 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base|))) (or (let ((.cse49 (select (select (let ((.cse50 (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base| (store .cse51 |c_~#value~0.offset| |c_thr1Thread2of3ForFork0_~vn~0#1|)))) (store .cse50 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse50 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* (div .cse49 4294967296) 4294967296) .cse29) (+ .cse30 .cse49))) (not (= (mod (select .cse51 |c_~#value~0.offset|) 4294967296) .cse15))))) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20|) 0)))) (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_23| Int) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| Int) (v_ArrVal_815 Int) (v_DerPreprocessor_29 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse54 (select (store .cse11 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base|))) (or (let ((.cse52 (select (select (let ((.cse53 (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base| (store .cse54 |c_~#value~0.offset| .cse47)))) (store .cse53 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23| (store (select .cse53 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* (div .cse52 4294967296) 4294967296) .cse29) (+ .cse52 .cse30))) (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23|) 0)) (not (= (mod (select .cse54 |c_~#value~0.offset|) 4294967296) .cse8)) (not (= (select (store |c_#valid| |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23| v_ArrVal_815) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20|) 0))))) (forall ((|v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| Int) (v_DerPreprocessor_29 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse55 (select (store .cse11 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base|))) (or (not (= (mod (select .cse55 |c_~#value~0.offset|) 4294967296) .cse8)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20|) 0)) (let ((.cse56 (select (select (let ((.cse57 (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base| (store .cse55 |c_~#value~0.offset| .cse47)))) (store .cse57 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse57 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ (* 4294967296 (div .cse56 4294967296)) .cse29) (+ .cse56 .cse30)))))) (or (forall ((|v_thr1Thread2of3ForFork0_~#casret~0#1.base_23| Int) (|v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| Int) (v_ArrVal_815 Int) (v_ArrVal_814 Int) (v_DerPreprocessor_29 (Array Int Int)) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse68 (store |c_#memory_int| |c_~#value~0.base| (store .cse14 |c_~#value~0.offset| (+ |c_thr1Thread1of3ForFork0_~v~0#1| 1))))) (let ((.cse67 (store (select .cse68 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse66 (select (store .cse68 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse67) |c_~#value~0.base|))) (let ((.cse61 (select .cse66 |c_~#value~0.offset|))) (let ((.cse64 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse67)) (.cse65 (+ .cse61 1))) (let ((.cse59 (mod .cse61 4294967296)) (.cse58 (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_814)) (.cse60 (select (store (store .cse64 |c_~#value~0.base| (store .cse66 |c_~#value~0.offset| .cse65)) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base|))) (or (not (= (select (store .cse58 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23| v_ArrVal_815) |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20|) 0)) (< .cse59 .cse24) (not (= (mod (select .cse60 |c_~#value~0.offset|) 4294967296) .cse59)) (not (= (select .cse58 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23|) 0)) (let ((.cse62 (select (select (let ((.cse63 (store (store .cse64 |v_thr1Thread3of3ForFork0_~#casret~0#1.base_20| v_DerPreprocessor_29) |c_~#value~0.base| (store .cse60 |c_~#value~0.offset| .cse65)))) (store .cse63 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23| (store (select .cse63 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_23|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|))) (< (+ .cse61 (* (div .cse62 4294967296) 4294967296)) (+ .cse62 (* 4294967296 (div .cse61 4294967296))))))))))))) .cse43))))))) is different from false [2024-10-17 06:43:42,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-17 06:43:44,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-17 06:43:46,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:43:48,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:43:50,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:43:52,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-17 06:43:55,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:43:57,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:43:59,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:44:01,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-17 06:44:03,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-17 06:44:08,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:44:10,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:44:12,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:44:14,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-17 06:44:16,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-17 06:44:21,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:44:23,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:44:25,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:44:27,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:44:30,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-17 06:44:31,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:44:33,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:44:35,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:44:38,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-17 06:44:40,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-17 06:44:44,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-17 06:44:47,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-17 06:44:50,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-17 06:44:53,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:44:55,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:44:59,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-17 06:45:06,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-17 06:45:13,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-17 06:45:51,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:45:53,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:45:55,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:45:58,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:46:00,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:46:03,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:46:05,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:46:07,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:46:09,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:46:11,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:46:38,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-17 06:46:40,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-17 06:46:44,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-17 06:46:46,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-17 06:46:48,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-17 06:47:03,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:48:20,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:48:23,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:48:23,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:48:23,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2024-10-17 06:48:23,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-17 06:48:23,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-17 06:48:23,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-10-17 06:48:23,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-17 06:48:23,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 06:48:23,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:48:23,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2024-10-17 06:48:23,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-10-17 06:48:23,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2024-10-17 06:48:23,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-17 06:48:23,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-17 06:48:23,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,SelfDestructingSolverStorable33,SelfDestructingSolverStorable34 [2024-10-17 06:48:23,771 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 06:48:23,872 INFO L85 PathProgramCache]: Analyzing trace with hash -281027821, now seen corresponding path program 1 times [2024-10-17 06:48:23,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:48:23,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:48:23,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:48:24,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 06:48:24,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:48:24,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:48:24,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:48:24,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 06:48:24,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-17 06:48:24,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-17 06:48:24,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1018, Invalid=18442, Unknown=0, NotChecked=0, Total=19460 [2024-10-17 06:48:24,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:48:24,532 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 06:48:24,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 06:48:24,532 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:48:24,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:48:24,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 101 states. [2024-10-17 06:48:24,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-17 06:48:24,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2024-10-17 06:48:24,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-10-17 06:48:24,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-17 06:48:24,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 06:48:24,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:48:24,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 115 states. [2024-10-17 06:48:24,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2024-10-17 06:48:24,533 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 114 states. [2024-10-17 06:48:24,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2024-10-17 06:48:24,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-17 06:48:24,534 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:48:53,295 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse1 (select .cse12 |c_~#value~0.offset|))) (let ((.cse14 (mod .cse1 4294967296)) (.cse31 (mod |c_thr1Thread1of3ForFork0_~v~0#1| 4294967296))) (let ((.cse23 (mod |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296)) (.cse16 (= .cse14 .cse31))) (let ((.cse2 (div .cse1 4294967296)) (.cse15 (store |c_#memory_int| |c_~#value~0.base| (store .cse12 |c_~#value~0.offset| (+ 1 .cse1)))) (.cse4 (= (select |c_#valid| |c_~#value~0.base|) 1)) (.cse10 (+ 1 .cse31)) (.cse13 (not .cse16)) (.cse22 (= .cse23 .cse14)) (.cse0 (+ |c_thr1Thread2of3ForFork0_~v~0#1| 1)) (.cse3 (div |c_thr1Thread2of3ForFork0_~v~0#1| 4294967296))) (and (or (and (<= .cse0 .cse1) (<= .cse2 .cse3)) .cse4) (or (forall ((v_ArrVal_232 Int) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| Int) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse11 (store |c_#memory_int| |c_~#value~0.base| (store .cse12 |c_~#value~0.offset| (+ |c_thr1Thread1of3ForFork0_~v~0#1| 1))))) (let ((.cse7 (store (select .cse11 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse8 (select (store .cse11 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse7) |c_~#value~0.base|))) (let ((.cse9 (select .cse8 |c_~#value~0.offset|))) (let ((.cse5 (mod .cse9 4294967296))) (or (< .cse5 (mod (select (select (let ((.cse6 (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse7) |c_~#value~0.base| (store .cse8 |c_~#value~0.offset| (+ .cse9 1))))) (store .cse6 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (store (select .cse6 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (< .cse5 .cse10) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_232) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0))))))))) .cse13) (<= .cse1 (+ 4294967294 (* .cse2 4294967296))) (forall ((v_ArrVal_232 Int) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| Int) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (or (< .cse14 (mod (select (select (store .cse15 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (store (select .cse15 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_232) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0)))) (forall ((|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (< .cse14 (mod (select (select (store .cse15 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse15 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1)) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) (or .cse16 (forall ((v_DerPreprocessor_10 (Array Int Int)) (v_ArrVal_232 Int) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| Int) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse19 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_10))) (let ((.cse20 (select .cse19 |c_~#value~0.base|))) (let ((.cse21 (select .cse20 |c_~#value~0.offset|))) (let ((.cse17 (mod .cse21 4294967296))) (or (< .cse17 (mod (select (select (let ((.cse18 (store .cse19 |c_~#value~0.base| (store .cse20 |c_~#value~0.offset| (+ .cse21 1))))) (store .cse18 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (store (select .cse18 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (< .cse17 .cse10) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_232) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0))))))))) .cse4 (or .cse22 (forall ((v_DerPreprocessor_9 (Array Int Int))) (< .cse23 (mod (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_9) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (or (forall ((v_ArrVal_232 Int) (|v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| Int) (|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int) (|thr1Thread1of3ForFork0_~#casret~0#1.offset| Int)) (let ((.cse29 (store |c_#memory_int| |c_~#value~0.base| (store .cse12 |c_~#value~0.offset| |c_thr1Thread1of3ForFork0_~vn~0#1|)))) (let ((.cse26 (store (select .cse29 |c_thr1Thread1of3ForFork0_~#casret~0#1.base|) |thr1Thread1of3ForFork0_~#casret~0#1.offset| 1))) (let ((.cse27 (select (store .cse29 |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse26) |c_~#value~0.base|))) (let ((.cse28 (select .cse27 |c_~#value~0.offset|))) (let ((.cse24 (mod .cse28 4294967296))) (or (< .cse24 (mod (select (select (let ((.cse25 (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| .cse26) |c_~#value~0.base| (store .cse27 |c_~#value~0.offset| (+ .cse28 1))))) (store .cse25 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13| (store (select .cse25 |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)) (< .cse24 .cse10) (not (= (select (store |c_#valid| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_ArrVal_232) |v_thr1Thread2of3ForFork0_~#casret~0#1.base_13|) 0))))))))) .cse13) (or (not .cse22) (forall ((|thr1Thread2of3ForFork0_~#casret~0#1.offset| Int)) (< .cse23 (mod (select (select (let ((.cse30 (store |c_#memory_int| |c_~#value~0.base| (store .cse12 |c_~#value~0.offset| .cse0)))) (store .cse30 |c_thr1Thread2of3ForFork0_~#casret~0#1.base| (store (select .cse30 |c_thr1Thread2of3ForFork0_~#casret~0#1.base|) |thr1Thread2of3ForFork0_~#casret~0#1.offset| 1))) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (<= |c_thr1Thread2of3ForFork0_~v~0#1| (+ 4294967294 (* 4294967296 .cse3))))))))) is different from false [2024-10-17 06:50:06,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:50:08,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:50:10,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:50:13,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:50:15,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:50:17,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:50:19,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:50:21,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:50:23,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:50:24,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:50:26,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:50:28,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:50:30,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-17 06:50:31,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:50:31,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:50:31,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2024-10-17 06:50:31,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-17 06:50:31,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-10-17 06:50:31,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-10-17 06:50:31,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-17 06:50:31,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-17 06:50:31,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:50:31,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2024-10-17 06:50:31,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-10-17 06:50:31,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2024-10-17 06:50:31,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-10-17 06:50:31,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-17 06:50:31,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 06:50:31,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,SelfDestructingSolverStorable36 [2024-10-17 06:50:31,572 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 06:50:31,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 06:50:31,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1778908015, now seen corresponding path program 1 times [2024-10-17 06:50:31,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 06:50:31,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489271991] [2024-10-17 06:50:31,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:50:31,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 06:50:31,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:50:32,461 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 06:50:32,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 06:50:32,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489271991] [2024-10-17 06:50:32,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489271991] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 06:50:32,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581187773] [2024-10-17 06:50:32,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 06:50:32,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 06:50:32,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 06:50:32,464 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 06:50:32,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-17 06:50:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 06:50:32,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-17 06:50:32,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 06:50:32,696 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 06:50:32,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-17 06:50:32,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-17 06:50:32,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 65 [2024-10-17 06:50:32,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2024-10-17 06:50:32,887 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 31 treesize of output 14 [2024-10-17 06:50:33,657 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2024-10-17 06:50:33,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-10-17 06:50:33,755 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-17 06:50:33,755 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 06:50:34,233 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#value~0.base|)) (.cse1 (mod |c_thr1Thread1of3ForFork0_~v~0#1| 4294967296))) (let ((.cse0 (= (mod (select .cse2 |c_~#value~0.offset|) 4294967296) .cse1))) (and (or (not .cse0) (forall ((v_DerPreprocessor_55 (Array Int Int))) (< .cse1 (mod (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse2 |c_~#value~0.offset| |c_thr1Thread1of3ForFork0_~vn~0#1|)) |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_55) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296)))) (or (forall ((v_DerPreprocessor_54 (Array Int Int))) (< .cse1 (mod (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_~#casret~0#1.base| v_DerPreprocessor_54) |c_~#value~0.base|) |c_~#value~0.offset|) 4294967296))) .cse0)))) is different from false [2024-10-17 06:50:35,433 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 4 refuted. 3 times theorem prover too weak. 0 trivial. 1 not checked. [2024-10-17 06:50:35,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581187773] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 06:50:35,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 06:50:35,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 11] total 32 [2024-10-17 06:50:35,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574636419] [2024-10-17 06:50:35,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 06:50:35,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-17 06:50:35,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 06:50:35,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-17 06:50:35,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=847, Unknown=26, NotChecked=60, Total=1056 [2024-10-17 06:50:35,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:50:35,435 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 06:50:35,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.606060606060606) internal successors, (86), 32 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 06:50:35,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:50:35,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:50:35,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 113 states. [2024-10-17 06:50:35,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-10-17 06:50:35,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-10-17 06:50:35,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-10-17 06:50:35,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-10-17 06:50:35,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-17 06:50:35,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-10-17 06:50:35,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 120 states. [2024-10-17 06:50:35,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2024-10-17 06:50:35,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 123 states. [2024-10-17 06:50:35,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-10-17 06:50:35,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-17 06:50:35,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 06:50:35,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 06:51:02,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-17 06:51:04,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-17 06:51:07,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-17 06:51:09,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] Killed by 15