./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/unroll-cond-2.wvr.c --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 5 -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/weaver/unroll-cond-2.wvr.c -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 4f5c6e2b4939ff0e3b5a44ab7f8c3e5d18f7e9fd12beb8fad487ea501e8fa48b --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking SLEEP_SET --traceabstraction.use.limited.checks.recommended.for.dfs true --traceabstraction.limit.for.limited.checks 5 -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-19 05:20:17,582 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-19 05:20:17,650 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-19 05:20:17,656 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-19 05:20:17,657 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-19 05:20:17,680 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-19 05:20:17,681 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-19 05:20:17,681 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-19 05:20:17,682 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-19 05:20:17,683 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-19 05:20:17,684 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-19 05:20:17,684 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-19 05:20:17,685 INFO L153 SettingsManager]: * Use SBE=true [2024-10-19 05:20:17,685 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-19 05:20:17,687 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-19 05:20:17,687 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-19 05:20:17,688 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-19 05:20:17,688 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-19 05:20:17,688 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-19 05:20:17,688 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-19 05:20:17,689 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-19 05:20:17,692 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-19 05:20:17,692 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-19 05:20:17,693 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-19 05:20:17,693 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-19 05:20:17,693 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-19 05:20:17,693 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-19 05:20:17,694 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-19 05:20:17,694 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-19 05:20:17,694 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-19 05:20:17,694 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-19 05:20:17,695 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-19 05:20:17,695 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-19 05:20:17,695 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-19 05:20:17,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-19 05:20:17,696 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-19 05:20:17,696 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-19 05:20:17,697 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-19 05:20:17,697 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-19 05:20:17,697 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-19 05:20:17,697 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-19 05:20:17,698 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 -> 4f5c6e2b4939ff0e3b5a44ab7f8c3e5d18f7e9fd12beb8fad487ea501e8fa48b 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 -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> SLEEP_SET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use limited checks (recommended for DFS) -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Limit for limited checks -> 5 [2024-10-19 05:20:17,990 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-19 05:20:18,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-19 05:20:18,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-19 05:20:18,015 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-19 05:20:18,016 INFO L274 PluginConnector]: CDTParser initialized [2024-10-19 05:20:18,017 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/unroll-cond-2.wvr.c [2024-10-19 05:20:19,395 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-19 05:20:19,615 INFO L384 CDTParser]: Found 1 translation units. [2024-10-19 05:20:19,616 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-2.wvr.c [2024-10-19 05:20:19,625 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5a1017fa2/cc66528c2b7845f2b72fea2a24b6d098/FLAGf64361943 [2024-10-19 05:20:19,638 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5a1017fa2/cc66528c2b7845f2b72fea2a24b6d098 [2024-10-19 05:20:19,640 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-19 05:20:19,641 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-19 05:20:19,642 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-19 05:20:19,643 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-19 05:20:19,651 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-19 05:20:19,652 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 05:20:19" (1/1) ... [2024-10-19 05:20:19,653 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6467bf8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:20:19, skipping insertion in model container [2024-10-19 05:20:19,653 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 05:20:19" (1/1) ... [2024-10-19 05:20:19,679 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-19 05:20:19,870 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-2.wvr.c[2500,2513] [2024-10-19 05:20:19,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-19 05:20:19,895 INFO L200 MainTranslator]: Completed pre-run [2024-10-19 05:20:19,918 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-2.wvr.c[2500,2513] [2024-10-19 05:20:19,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-19 05:20:19,943 INFO L204 MainTranslator]: Completed translation [2024-10-19 05:20:19,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:20:19 WrapperNode [2024-10-19 05:20:19,944 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-19 05:20:19,945 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-19 05:20:19,945 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-19 05:20:19,946 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-19 05:20:19,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:20:19" (1/1) ... [2024-10-19 05:20:19,965 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:20:19" (1/1) ... [2024-10-19 05:20:19,992 INFO L138 Inliner]: procedures = 23, calls = 23, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 134 [2024-10-19 05:20:19,993 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-19 05:20:19,994 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-19 05:20:19,994 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-19 05:20:19,994 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-19 05:20:20,004 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:20:19" (1/1) ... [2024-10-19 05:20:20,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:20:19" (1/1) ... [2024-10-19 05:20:20,008 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:20:19" (1/1) ... [2024-10-19 05:20:20,008 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:20:19" (1/1) ... [2024-10-19 05:20:20,014 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:20:19" (1/1) ... [2024-10-19 05:20:20,017 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:20:19" (1/1) ... [2024-10-19 05:20:20,019 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:20:19" (1/1) ... [2024-10-19 05:20:20,020 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:20:19" (1/1) ... [2024-10-19 05:20:20,022 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-19 05:20:20,023 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-19 05:20:20,023 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-19 05:20:20,023 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-19 05:20:20,028 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:20:19" (1/1) ... [2024-10-19 05:20:20,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-19 05:20:20,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 05:20:20,062 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-19 05:20:20,066 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-19 05:20:20,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-19 05:20:20,113 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-19 05:20:20,113 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-19 05:20:20,113 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-19 05:20:20,114 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-19 05:20:20,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-19 05:20:20,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-19 05:20:20,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-19 05:20:20,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-19 05:20:20,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-19 05:20:20,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-19 05:20:20,118 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-19 05:20:20,244 INFO L238 CfgBuilder]: Building ICFG [2024-10-19 05:20:20,248 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-19 05:20:20,545 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-19 05:20:20,546 INFO L287 CfgBuilder]: Performing block encoding [2024-10-19 05:20:20,807 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-19 05:20:20,811 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-19 05:20:20,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 05:20:20 BoogieIcfgContainer [2024-10-19 05:20:20,812 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-19 05:20:20,814 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-19 05:20:20,814 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-19 05:20:20,817 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-19 05:20:20,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.10 05:20:19" (1/3) ... [2024-10-19 05:20:20,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7be2b0d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 05:20:20, skipping insertion in model container [2024-10-19 05:20:20,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 05:20:19" (2/3) ... [2024-10-19 05:20:20,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7be2b0d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 05:20:20, skipping insertion in model container [2024-10-19 05:20:20,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 05:20:20" (3/3) ... [2024-10-19 05:20:20,821 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-cond-2.wvr.c [2024-10-19 05:20:20,834 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-19 05:20:20,834 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-19 05:20:20,834 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-19 05:20:20,893 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-19 05:20:20,934 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 05:20:20,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 05:20:20,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 05:20:20,937 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-19 05:20:20,939 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-19 05:20:21,030 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 05:20:21,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 05:20:21,050 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-19 05:20:21,057 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;@4003663d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=SLEEP_SET, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 05:20:21,058 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-10-19 05:20:21,423 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-19 05:20:21,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 05:20:21,425 INFO L85 PathProgramCache]: Analyzing trace with hash 176020635, now seen corresponding path program 1 times [2024-10-19 05:20:21,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 05:20:21,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096602111] [2024-10-19 05:20:21,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:20:21,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 05:20:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 05:20:21,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 05:20:21,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 05:20:21,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096602111] [2024-10-19 05:20:21,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096602111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-19 05:20:21,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-19 05:20:21,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-19 05:20:21,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913803713] [2024-10-19 05:20:21,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-19 05:20:21,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-19 05:20:21,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 05:20:21,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-19 05:20:21,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-19 05:20:21,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 05:20:21,835 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 05:20:21,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-19 05:20:21,836 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 05:20:21,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 05:20:21,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-19 05:20:21,886 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-19 05:20:21,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 05:20:21,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1103723602, now seen corresponding path program 1 times [2024-10-19 05:20:21,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 05:20:21,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145712498] [2024-10-19 05:20:21,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:20:21,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 05:20:21,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 05:20:22,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 05:20:22,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 05:20:22,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145712498] [2024-10-19 05:20:22,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145712498] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 05:20:22,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670592571] [2024-10-19 05:20:22,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:20:22,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 05:20:22,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 05:20:22,526 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-19 05:20:22,528 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-19 05:20:22,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 05:20:22,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-19 05:20:22,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 05:20:22,801 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-19 05:20:22,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 05:20:22,810 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 05:20:23,010 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-19 05:20:23,011 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 52 treesize of output 37 [2024-10-19 05:20:23,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 05:20:23,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670592571] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 05:20:23,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 05:20:23,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2024-10-19 05:20:23,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882665572] [2024-10-19 05:20:23,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 05:20:23,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-19 05:20:23,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 05:20:23,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-19 05:20:23,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-10-19 05:20:23,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 05:20:23,190 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 05:20:23,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 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-19 05:20:23,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-19 05:20:23,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 05:20:23,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 05:20:23,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-19 05:20:23,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-19 05:20:23,672 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,SelfDestructingSolverStorable1 [2024-10-19 05:20:23,673 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-19 05:20:23,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 05:20:23,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1692399723, now seen corresponding path program 1 times [2024-10-19 05:20:23,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 05:20:23,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999736790] [2024-10-19 05:20:23,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:20:23,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 05:20:23,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 05:20:24,787 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 05:20:24,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 05:20:24,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999736790] [2024-10-19 05:20:24,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999736790] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 05:20:24,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154825243] [2024-10-19 05:20:24,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:20:24,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 05:20:24,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 05:20:24,793 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-19 05:20:24,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-19 05:20:24,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 05:20:24,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-19 05:20:24,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 05:20:24,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-19 05:20:25,369 INFO L349 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2024-10-19 05:20:25,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 61 [2024-10-19 05:20:25,449 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 05:20:25,450 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 05:20:26,217 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 102 treesize of output 90 [2024-10-19 05:20:26,361 INFO L349 Elim1Store]: treesize reduction 5, result has 95.2 percent of original size [2024-10-19 05:20:26,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 406 treesize of output 335 [2024-10-19 05:20:29,624 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-19 05:20:29,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154825243] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 05:20:29,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 05:20:29,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2024-10-19 05:20:29,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979640846] [2024-10-19 05:20:29,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 05:20:29,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-19 05:20:29,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 05:20:29,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-19 05:20:29,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=738, Unknown=0, NotChecked=0, Total=930 [2024-10-19 05:20:29,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 05:20:29,630 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 05:20:29,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 30 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-19 05:20:29,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-19 05:20:29,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-19 05:20:29,631 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 05:20:30,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 05:20:30,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-19 05:20:30,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-19 05:20:30,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-19 05:20:30,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 05:20:30,444 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-19 05:20:30,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 05:20:30,444 INFO L85 PathProgramCache]: Analyzing trace with hash 196277, now seen corresponding path program 2 times [2024-10-19 05:20:30,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 05:20:30,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072793561] [2024-10-19 05:20:30,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:20:30,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 05:20:30,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 05:20:30,781 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-19 05:20:30,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 05:20:30,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072793561] [2024-10-19 05:20:30,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072793561] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 05:20:30,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71265072] [2024-10-19 05:20:30,782 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-19 05:20:30,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 05:20:30,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 05:20:30,785 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-19 05:20:30,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-19 05:20:30,922 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-19 05:20:30,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-19 05:20:30,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-19 05:20:30,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 05:20:31,052 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-19 05:20:31,052 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 05:20:31,340 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-19 05:20:31,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71265072] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 05:20:31,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 05:20:31,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21 [2024-10-19 05:20:31,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169744326] [2024-10-19 05:20:31,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 05:20:31,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-19 05:20:31,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 05:20:31,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-19 05:20:31,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2024-10-19 05:20:31,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 05:20:31,342 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 05:20:31,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 21 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-19 05:20:31,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-19 05:20:31,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-19 05:20:31,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-19 05:20:31,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 05:20:35,328 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 [] [2024-10-19 05:20:37,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 [] [2024-10-19 05:20:39,475 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 [] [2024-10-19 05:20:40,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-19 05:20:40,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-19 05:20:40,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-19 05:20:40,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-19 05:20:40,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-19 05:20:40,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-19 05:20:40,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 05:20:40,884 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-19 05:20:40,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 05:20:40,885 INFO L85 PathProgramCache]: Analyzing trace with hash -511996649, now seen corresponding path program 3 times [2024-10-19 05:20:40,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 05:20:40,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707555712] [2024-10-19 05:20:40,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 05:20:40,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 05:20:40,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 05:20:42,711 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-19 05:20:42,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 05:20:42,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707555712] [2024-10-19 05:20:42,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707555712] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 05:20:42,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082526290] [2024-10-19 05:20:42,714 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-19 05:20:42,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 05:20:42,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 05:20:42,716 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-19 05:20:42,718 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-19 05:20:42,913 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-10-19 05:20:42,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-19 05:20:42,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-19 05:20:42,921 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 05:20:43,403 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 7 proven. 49 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-19 05:20:43,404 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 05:20:45,901 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-19 05:20:45,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082526290] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 05:20:45,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 05:20:45,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 19] total 50 [2024-10-19 05:20:45,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798028474] [2024-10-19 05:20:45,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 05:20:45,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-19 05:20:45,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 05:20:45,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-19 05:20:45,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=2062, Unknown=0, NotChecked=0, Total=2450 [2024-10-19 05:20:45,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 05:20:45,905 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 05:20:45,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-19 05:20:45,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-19 05:20:45,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-10-19 05:20:45,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-10-19 05:20:45,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-19 05:20:45,906 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 05:23:34,039 WARN L286 SmtUtils]: Spent 2.11m on a formula simplification. DAG size of input: 92 DAG size of output: 93 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-19 05:23:36,135 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 12) 4294967296)) (.cse15 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 2) 4294967296)) (.cse12 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 4) 4294967296)) (.cse2 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 8) 4294967296)) (.cse19 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 6) 4294967296)) (.cse8 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 10) 4294967296))) (let ((.cse5 (+ .cse8 2)) (.cse1 (+ 2 .cse19)) (.cse0 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 4) 4294967296)) (.cse9 (+ 2 .cse2)) (.cse3 (mod (+ 3 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse18 (+ 2 .cse12)) (.cse10 (mod (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse20 (mod (+ 7 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse11 (+ .cse15 2)) (.cse21 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 14) 4294967296)) (.cse4 (mod (+ 5 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse7 (mod (+ 6 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse22 (+ .cse6 2)) (.cse13 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) 4294967296)) (.cse17 (mod |c_thread2Thread1of1ForFork0_~i~1#1| 4294967296)) (.cse14 (mod |c_thread1Thread1of1ForFork1_~i~0#1| 4294967296))) (and (or (< .cse0 .cse1) (< .cse2 .cse3)) (or (< .cse4 .cse5) (< .cse6 .cse0)) (or (< .cse6 .cse4) (< .cse7 .cse5)) (or (< .cse8 .cse0) (< .cse4 .cse9)) (or (< .cse10 .cse11) (< .cse12 .cse13)) (let ((.cse16 (mod (+ 4294967295 c_~n~0) 4294967296))) (or (< .cse14 (mod c_~n~0 4294967296)) (< .cse15 .cse16) (< .cse16 (+ .cse17 1)))) (or (< .cse2 .cse10) (< .cse3 .cse1)) (or (< .cse10 .cse18) (< .cse19 .cse13)) (or (< .cse0 .cse9) (< .cse8 .cse3)) (or (< .cse3 .cse18) (< .cse19 .cse10)) (or (< .cse20 14) (< 14 .cse7)) (or (< .cse21 .cse7) (< .cse20 .cse22)) (or (< .cse12 .cse14) (< .cse13 .cse11)) (or (< .cse21 .cse4) (< .cse7 .cse22)) (or (< .cse13 (+ 2 .cse17)) (< .cse15 .cse14))))) is different from false [2024-10-19 05:23:43,173 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 12) 4294967296)) (.cse15 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 2) 4294967296)) (.cse12 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 4) 4294967296)) (.cse2 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 8) 4294967296)) (.cse18 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 6) 4294967296)) (.cse8 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 10) 4294967296))) (let ((.cse5 (+ .cse8 2)) (.cse1 (+ 2 .cse18)) (.cse0 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 4) 4294967296)) (.cse9 (+ 2 .cse2)) (.cse3 (mod (+ 3 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse17 (+ 2 .cse12)) (.cse10 (mod (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse19 (mod (+ 7 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse14 (mod |c_thread1Thread1of1ForFork1_~i~0#1| 4294967296)) (.cse13 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) 4294967296)) (.cse11 (+ .cse15 2)) (.cse20 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 14) 4294967296)) (.cse4 (mod (+ 5 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse7 (mod (+ 6 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse21 (+ .cse6 2))) (and (or (< .cse0 .cse1) (< .cse2 .cse3)) (or (< .cse4 .cse5) (< .cse6 .cse0)) (or (< .cse6 .cse4) (< .cse7 .cse5)) (or (< .cse8 .cse0) (< .cse4 .cse9)) (or (< .cse10 .cse11) (< .cse12 .cse13)) (let ((.cse16 (mod (+ 4294967295 c_~n~0) 4294967296))) (or (< .cse14 (mod c_~n~0 4294967296)) (< .cse15 .cse16) (< .cse16 (+ (mod |c_thread2Thread1of1ForFork0_~i~1#1| 4294967296) 1)))) (or (< .cse2 .cse10) (< .cse3 .cse1)) (or (< .cse10 .cse17) (< .cse18 .cse13)) (or (< .cse0 .cse9) (< .cse8 .cse3)) (or (< .cse3 .cse17) (< .cse18 .cse10)) (or (< .cse19 14) (< 14 .cse7)) (or (< .cse20 .cse7) (< .cse19 .cse21)) (or (< .cse12 .cse14) (< .cse13 .cse11)) (or (< .cse20 .cse4) (< .cse7 .cse21))))) is different from false [2024-10-19 05:24:09,149 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 [] [2024-10-19 05:24:31,426 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 [] [2024-10-19 05:24:33,433 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 [] [2024-10-19 05:24:45,726 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 [] [2024-10-19 05:24:47,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 [] [2024-10-19 05:25:10,971 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 [] [2024-10-19 05:25:13,071 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 [] [2024-10-19 05:25:38,419 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 [] [2024-10-19 05:25:40,436 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 [] [2024-10-19 05:25:42,442 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 [] [2024-10-19 05:25:43,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-19 05:26:13,838 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 [] [2024-10-19 05:28:47,204 WARN L286 SmtUtils]: Spent 22.29s on a formula simplification. DAG size of input: 89 DAG size of output: 79 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-19 05:31:57,769 WARN L286 SmtUtils]: Spent 2.22m on a formula simplification that was a NOOP. DAG size: 106 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-19 05:31:59,978 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (* (- 1) |c_thread2Thread1of1ForFork0_~i~1#1|)) (.cse14 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 2) 4294967296)) (.cse8 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 4) 4294967296))) (let ((.cse4 (mod (+ 3 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse10 (+ 2 .cse8)) (.cse3 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 6) 4294967296)) (.cse6 (mod (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse7 (+ .cse14 2)) (.cse1 (* 4294967296 (div (+ 7 .cse5 c_~n~0) 4294967296))) (.cse2 (* 4294967296 (div (+ (- 2) |c_thread2Thread1of1ForFork0_~i~1#1|) 4294967296))) (.cse0 (+ (* 4294967296 (div c_~n~0 4294967296)) |c_thread1Thread1of1ForFork1_~i~0#1| (* 4294967296 (div (+ 4294967295 c_~n~0) 4294967296)))) (.cse11 (* (div (+ |c_thread2Thread1of1ForFork0_~i~1#1| (- 4)) 4294967296) 4294967296)) (.cse12 (* (div (+ 9 .cse5 c_~n~0) 4294967296) 4294967296)) (.cse9 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) 4294967296)) (.cse13 (mod |c_thread1Thread1of1ForFork1_~i~0#1| 4294967296))) (and (<= .cse0 (+ c_~n~0 .cse1 4294967293 .cse2)) (<= 6 |c_thread1Thread1of1ForFork1_~i~0#1|) (or (< (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 4) 4294967296) (+ 2 .cse3)) (< (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 8) 4294967296) .cse4)) (<= 5 |c_thread1Thread1of1ForFork1_~i~0#1|) (<= .cse0 (+ (* (div (+ .cse5 c_~n~0 11) 4294967296) 4294967296) 4294967294 c_~n~0 (* (div (+ |c_thread2Thread1of1ForFork0_~i~1#1| (- 6)) 4294967296) 4294967296))) (or (< .cse6 .cse7) (< .cse8 .cse9)) (or (< .cse6 .cse10) (< .cse3 .cse9)) (<= .cse0 (+ .cse11 4294967294 c_~n~0 .cse12)) (or (< .cse4 .cse10) (< .cse3 .cse6)) (or (< .cse8 .cse13) (< .cse9 .cse7)) (<= .cse0 (+ 4294967292 c_~n~0 .cse1 .cse2)) (<= .cse0 (+ .cse11 c_~n~0 .cse12 4294967293)) (or (< .cse9 (+ 2 (mod |c_thread2Thread1of1ForFork0_~i~1#1| 4294967296))) (< .cse14 .cse13)) (<= 4 |c_thread1Thread1of1ForFork1_~i~0#1|)))) is different from false [2024-10-19 05:32:17,138 WARN L286 SmtUtils]: Spent 6.87s on a formula simplification. DAG size of input: 116 DAG size of output: 81 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-19 05:33:11,957 WARN L286 SmtUtils]: Spent 32.01s on a formula simplification. DAG size of input: 88 DAG size of output: 84 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-19 05:33:29,304 WARN L286 SmtUtils]: Spent 6.85s on a formula simplification. DAG size of input: 61 DAG size of output: 59 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-19 05:33:31,438 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 [] [2024-10-19 05:33:32,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-19 05:33:34,483 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 [] [2024-10-19 05:33:36,497 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 [] [2024-10-19 05:33:38,855 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 [] [2024-10-19 05:33:40,857 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 [] [2024-10-19 05:33:45,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:33:48,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:33:50,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 05:34:49,309 WARN L286 SmtUtils]: Spent 22.43s on a formula simplification. DAG size of input: 98 DAG size of output: 86 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-19 05:34:50,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-19 05:34:52,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] Killed by 15