./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/unroll-cond-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version dfe144c0 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 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-dfe144c-m [2024-07-20 20:01:27,527 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-07-20 20:01:27,587 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-07-20 20:01:27,591 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-07-20 20:01:27,592 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-07-20 20:01:27,613 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-07-20 20:01:27,614 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-07-20 20:01:27,614 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-07-20 20:01:27,615 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-07-20 20:01:27,616 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-07-20 20:01:27,616 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-07-20 20:01:27,616 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-07-20 20:01:27,617 INFO L153 SettingsManager]: * Use SBE=true [2024-07-20 20:01:27,618 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-07-20 20:01:27,618 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-07-20 20:01:27,619 INFO L153 SettingsManager]: * sizeof long=4 [2024-07-20 20:01:27,619 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-07-20 20:01:27,622 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-07-20 20:01:27,622 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-07-20 20:01:27,622 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-07-20 20:01:27,622 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-07-20 20:01:27,623 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-07-20 20:01:27,623 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-07-20 20:01:27,623 INFO L153 SettingsManager]: * sizeof long double=12 [2024-07-20 20:01:27,623 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-07-20 20:01:27,623 INFO L153 SettingsManager]: * Use constant arrays=true [2024-07-20 20:01:27,623 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-07-20 20:01:27,624 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-07-20 20:01:27,624 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-07-20 20:01:27,624 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-07-20 20:01:27,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-07-20 20:01:27,625 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-07-20 20:01:27,625 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-07-20 20:01:27,626 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-07-20 20:01:27,626 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-07-20 20:01:27,626 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-07-20 20:01:27,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-07-20 20:01:27,626 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-07-20 20:01:27,626 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-07-20 20:01:27,627 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-07-20 20:01:27,627 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-07-20 20:01:27,627 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-07-20 20:01:27,627 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 [2024-07-20 20:01:27,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-07-20 20:01:27,830 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-07-20 20:01:27,832 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-07-20 20:01:27,832 INFO L270 PluginConnector]: Initializing CDTParser... [2024-07-20 20:01:27,834 INFO L274 PluginConnector]: CDTParser initialized [2024-07-20 20:01:27,835 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-07-20 20:01:28,839 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-07-20 20:01:29,009 INFO L384 CDTParser]: Found 1 translation units. [2024-07-20 20:01:29,010 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-2.wvr.c [2024-07-20 20:01:29,019 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/bef2876bc/2ce182b9d65e4ed585ab5865c0101f3c/FLAG39d3cddcc [2024-07-20 20:01:29,031 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/bef2876bc/2ce182b9d65e4ed585ab5865c0101f3c [2024-07-20 20:01:29,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-07-20 20:01:29,035 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-07-20 20:01:29,037 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-07-20 20:01:29,037 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-07-20 20:01:29,041 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-07-20 20:01:29,043 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 08:01:29" (1/1) ... [2024-07-20 20:01:29,044 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e003de3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 08:01:29, skipping insertion in model container [2024-07-20 20:01:29,044 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 08:01:29" (1/1) ... [2024-07-20 20:01:29,062 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-07-20 20:01:29,214 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-07-20 20:01:29,220 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-07-20 20:01:29,227 INFO L202 MainTranslator]: Completed pre-run [2024-07-20 20:01:29,240 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-07-20 20:01:29,242 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-07-20 20:01:29,253 INFO L206 MainTranslator]: Completed translation [2024-07-20 20:01:29,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 08:01:29 WrapperNode [2024-07-20 20:01:29,254 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-07-20 20:01:29,255 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-07-20 20:01:29,255 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-07-20 20:01:29,255 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-07-20 20:01:29,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 08:01:29" (1/1) ... [2024-07-20 20:01:29,265 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 08:01:29" (1/1) ... [2024-07-20 20:01:29,281 INFO L138 Inliner]: procedures = 23, calls = 23, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 134 [2024-07-20 20:01:29,282 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-07-20 20:01:29,282 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-07-20 20:01:29,282 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-07-20 20:01:29,283 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-07-20 20:01:29,289 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 08:01:29" (1/1) ... [2024-07-20 20:01:29,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 08:01:29" (1/1) ... [2024-07-20 20:01:29,291 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 08:01:29" (1/1) ... [2024-07-20 20:01:29,291 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 08:01:29" (1/1) ... [2024-07-20 20:01:29,296 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 08:01:29" (1/1) ... [2024-07-20 20:01:29,298 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 08:01:29" (1/1) ... [2024-07-20 20:01:29,299 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 08:01:29" (1/1) ... [2024-07-20 20:01:29,300 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 08:01:29" (1/1) ... [2024-07-20 20:01:29,302 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-07-20 20:01:29,302 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-07-20 20:01:29,302 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-07-20 20:01:29,302 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-07-20 20:01:29,303 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 08:01:29" (1/1) ... [2024-07-20 20:01:29,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-07-20 20:01:29,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-20 20:01:29,335 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-07-20 20:01:29,340 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-07-20 20:01:29,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-07-20 20:01:29,366 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-07-20 20:01:29,367 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-07-20 20:01:29,367 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-07-20 20:01:29,367 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-07-20 20:01:29,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-07-20 20:01:29,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-07-20 20:01:29,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-07-20 20:01:29,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-07-20 20:01:29,368 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-07-20 20:01:29,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-07-20 20:01:29,369 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-07-20 20:01:29,438 INFO L244 CfgBuilder]: Building ICFG [2024-07-20 20:01:29,439 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-07-20 20:01:29,616 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-07-20 20:01:29,617 INFO L293 CfgBuilder]: Performing block encoding [2024-07-20 20:01:29,794 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-07-20 20:01:29,796 INFO L320 CfgBuilder]: Removed 3 assume(true) statements. [2024-07-20 20:01:29,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 08:01:29 BoogieIcfgContainer [2024-07-20 20:01:29,797 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-07-20 20:01:29,810 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-07-20 20:01:29,810 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-07-20 20:01:29,812 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-07-20 20:01:29,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 08:01:29" (1/3) ... [2024-07-20 20:01:29,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ea0b928 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 08:01:29, skipping insertion in model container [2024-07-20 20:01:29,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 08:01:29" (2/3) ... [2024-07-20 20:01:29,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ea0b928 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 08:01:29, skipping insertion in model container [2024-07-20 20:01:29,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 08:01:29" (3/3) ... [2024-07-20 20:01:29,814 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-cond-2.wvr.c [2024-07-20 20:01:29,820 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-07-20 20:01:29,846 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-07-20 20:01:29,847 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-07-20 20:01:29,847 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-07-20 20:01:29,883 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-07-20 20:01:29,919 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-07-20 20:01:29,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-07-20 20:01:29,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-20 20:01:29,921 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-07-20 20:01:29,928 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-07-20 20:01:29,950 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-07-20 20:01:29,961 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-07-20 20:01:29,966 INFO L357 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, mHoare=true, 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;@1ab2f3c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-07-20 20:01:29,966 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-07-20 20:01:30,059 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-07-20 20:01:30,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-20 20:01:30,067 INFO L85 PathProgramCache]: Analyzing trace with hash 176020635, now seen corresponding path program 1 times [2024-07-20 20:01:30,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-20 20:01:30,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249487073] [2024-07-20 20:01:30,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-20 20:01:30,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-20 20:01:30,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-20 20:01:30,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-07-20 20:01:30,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-20 20:01:30,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249487073] [2024-07-20 20:01:30,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249487073] provided 1 perfect and 0 imperfect interpolant sequences [2024-07-20 20:01:30,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-07-20 20:01:30,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-07-20 20:01:30,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367893512] [2024-07-20 20:01:30,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-07-20 20:01:30,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-07-20 20:01:30,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-20 20:01:30,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-07-20 20:01:30,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-07-20 20:01:30,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-20 20:01:30,428 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-20 20:01:30,429 INFO L496 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-07-20 20:01:30,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-20 20:01:30,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-07-20 20:01:30,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-07-20 20:01:30,479 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-07-20 20:01:30,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-20 20:01:30,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1103723602, now seen corresponding path program 1 times [2024-07-20 20:01:30,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-20 20:01:30,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613766628] [2024-07-20 20:01:30,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-20 20:01:30,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-20 20:01:30,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-20 20:01:30,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-07-20 20:01:30,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-20 20:01:30,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613766628] [2024-07-20 20:01:30,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613766628] provided 0 perfect and 1 imperfect interpolant sequences [2024-07-20 20:01:30,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500644843] [2024-07-20 20:01:30,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-20 20:01:30,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-20 20:01:30,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-20 20:01:30,989 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-07-20 20:01:31,009 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-07-20 20:01:31,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-20 20:01:31,068 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 13 conjunts are in the unsatisfiable core [2024-07-20 20:01:31,073 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-07-20 20:01:31,221 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-07-20 20:01:31,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-07-20 20:01:31,230 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-07-20 20:01:31,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-07-20 20:01:31,360 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-07-20 20:01:31,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-07-20 20:01:31,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500644843] provided 0 perfect and 2 imperfect interpolant sequences [2024-07-20 20:01:31,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-07-20 20:01:31,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2024-07-20 20:01:31,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758852467] [2024-07-20 20:01:31,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-07-20 20:01:31,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-07-20 20:01:31,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-20 20:01:31,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-07-20 20:01:31,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-07-20 20:01:31,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-20 20:01:31,473 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-20 20:01:31,474 INFO L496 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-07-20 20:01:31,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-07-20 20:01:31,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-20 20:01:31,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-07-20 20:01:31,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-07-20 20:01:31,683 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-07-20 20:01:31,882 WARN L477 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-07-20 20:01:31,883 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-07-20 20:01:31,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-20 20:01:31,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1692399723, now seen corresponding path program 1 times [2024-07-20 20:01:31,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-20 20:01:31,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395144364] [2024-07-20 20:01:31,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-20 20:01:31,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-20 20:01:31,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-20 20:01:32,676 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-20 20:01:32,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-20 20:01:32,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395144364] [2024-07-20 20:01:32,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395144364] provided 0 perfect and 1 imperfect interpolant sequences [2024-07-20 20:01:32,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981646325] [2024-07-20 20:01:32,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-20 20:01:32,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-20 20:01:32,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-20 20:01:32,686 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-07-20 20:01:32,688 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-07-20 20:01:32,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-20 20:01:32,752 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 42 conjunts are in the unsatisfiable core [2024-07-20 20:01:32,756 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-07-20 20:01:32,794 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-07-20 20:01:33,119 INFO L349 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2024-07-20 20:01:33,119 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-07-20 20:01:33,175 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-20 20:01:33,175 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-07-20 20:01:33,733 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-07-20 20:01:33,835 INFO L349 Elim1Store]: treesize reduction 5, result has 95.2 percent of original size [2024-07-20 20:01:33,836 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-07-20 20:01:36,276 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-07-20 20:01:36,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981646325] provided 0 perfect and 2 imperfect interpolant sequences [2024-07-20 20:01:36,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-07-20 20:01:36,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2024-07-20 20:01:36,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120787316] [2024-07-20 20:01:36,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-07-20 20:01:36,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-07-20 20:01:36,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-20 20:01:36,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-07-20 20:01:36,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=738, Unknown=0, NotChecked=0, Total=930 [2024-07-20 20:01:36,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-20 20:01:36,283 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-20 20:01:36,284 INFO L496 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-07-20 20:01:36,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-07-20 20:01:36,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-07-20 20:01:36,284 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-20 20:01:36,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-07-20 20:01:36,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-07-20 20:01:36,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-07-20 20:01:36,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-07-20 20:01:36,928 WARN L477 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-07-20 20:01:36,929 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-07-20 20:01:36,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-20 20:01:36,929 INFO L85 PathProgramCache]: Analyzing trace with hash 196277, now seen corresponding path program 2 times [2024-07-20 20:01:36,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-20 20:01:36,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913800] [2024-07-20 20:01:36,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-20 20:01:36,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-20 20:01:36,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-20 20:01:37,182 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-07-20 20:01:37,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-20 20:01:37,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913800] [2024-07-20 20:01:37,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913800] provided 0 perfect and 1 imperfect interpolant sequences [2024-07-20 20:01:37,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170614834] [2024-07-20 20:01:37,183 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-07-20 20:01:37,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-20 20:01:37,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-20 20:01:37,185 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-07-20 20:01:37,204 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-07-20 20:01:37,294 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-07-20 20:01:37,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-07-20 20:01:37,295 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 15 conjunts are in the unsatisfiable core [2024-07-20 20:01:37,296 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-07-20 20:01:37,399 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-07-20 20:01:37,399 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-07-20 20:01:37,623 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-07-20 20:01:37,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170614834] provided 0 perfect and 2 imperfect interpolant sequences [2024-07-20 20:01:37,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-07-20 20:01:37,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21 [2024-07-20 20:01:37,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713613052] [2024-07-20 20:01:37,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-07-20 20:01:37,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-07-20 20:01:37,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-20 20:01:37,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-07-20 20:01:37,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2024-07-20 20:01:37,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-20 20:01:37,625 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-20 20:01:37,625 INFO L496 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-07-20 20:01:37,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-07-20 20:01:37,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-07-20 20:01:37,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-07-20 20:01:37,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-20 20:01:41,622 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-07-20 20:01:43,641 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-07-20 20:01:45,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 [] [2024-07-20 20:01:46,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-07-20 20:01:46,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-07-20 20:01:46,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-07-20 20:01:46,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-07-20 20:01:46,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-07-20 20:01:46,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-07-20 20:01:47,172 WARN L477 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-07-20 20:01:47,172 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-07-20 20:01:47,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-07-20 20:01:47,173 INFO L85 PathProgramCache]: Analyzing trace with hash -511996649, now seen corresponding path program 3 times [2024-07-20 20:01:47,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-07-20 20:01:47,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128350305] [2024-07-20 20:01:47,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-07-20 20:01:47,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-07-20 20:01:47,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-07-20 20:01:48,455 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-07-20 20:01:48,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-07-20 20:01:48,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128350305] [2024-07-20 20:01:48,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128350305] provided 0 perfect and 1 imperfect interpolant sequences [2024-07-20 20:01:48,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942818452] [2024-07-20 20:01:48,455 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-07-20 20:01:48,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-07-20 20:01:48,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-07-20 20:01:48,457 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-07-20 20:01:48,484 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-07-20 20:01:48,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-07-20 20:01:48,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-07-20 20:01:48,608 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 36 conjunts are in the unsatisfiable core [2024-07-20 20:01:48,609 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-07-20 20:01:49,056 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 7 proven. 49 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-07-20 20:01:49,056 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-07-20 20:01:51,268 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-07-20 20:01:51,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942818452] provided 0 perfect and 2 imperfect interpolant sequences [2024-07-20 20:01:51,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-07-20 20:01:51,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 19] total 50 [2024-07-20 20:01:51,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468763317] [2024-07-20 20:01:51,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-07-20 20:01:51,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-07-20 20:01:51,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-07-20 20:01:51,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-07-20 20:01:51,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=2062, Unknown=0, NotChecked=0, Total=2450 [2024-07-20 20:01:51,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-07-20 20:01:51,272 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-07-20 20:01:51,272 INFO L496 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-07-20 20:01:51,272 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-07-20 20:01:51,272 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-07-20 20:01:51,272 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-07-20 20:01:51,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-07-20 20:01:51,273 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-07-20 20:02:00,862 WARN L293 SmtUtils]: Spent 6.22s on a formula simplification. DAG size of input: 108 DAG size of output: 53 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-07-20 20:04:52,929 WARN L293 SmtUtils]: Spent 2.19m on a formula simplification. DAG size of input: 92 DAG size of output: 93 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-07-20 20:04:55,019 WARN L854 $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-07-20 20:08:19,831 WARN L293 SmtUtils]: Spent 2.47m on a formula simplification that was a NOOP. DAG size: 100 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-07-20 20:08:47,160 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-07-20 20:09:10,573 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-07-20 20:09:12,577 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-07-20 20:09:14,582 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-07-20 20:09:26,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-07-20 20:09:28,329 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-07-20 20:09:30,334 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-07-20 20:09:40,684 WARN L293 SmtUtils]: Spent 6.24s on a formula simplification. DAG size of input: 156 DAG size of output: 85 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-07-20 20:09:56,539 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-07-20 20:09:58,544 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-07-20 20:10:00,549 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-07-20 20:10:13,631 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-07-20 20:10:15,634 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-07-20 20:10:35,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-07-20 20:10:51,333 WARN L293 SmtUtils]: Spent 8.94s on a formula simplification. DAG size of input: 148 DAG size of output: 68 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-07-20 20:10:59,909 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-07-20 20:12:17,020 WARN L293 SmtUtils]: Spent 6.54s on a formula simplification. DAG size of input: 133 DAG size of output: 66 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-07-20 20:13:20,110 WARN L293 SmtUtils]: Spent 31.96s on a formula simplification. DAG size of input: 89 DAG size of output: 79 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-07-20 20:13:23,983 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse17 (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)) (.cse15 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 6) 4294967296)) (.cse8 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 10) 4294967296))) (let ((.cse5 (+ .cse8 2)) (.cse4 (mod (+ 5 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse1 (+ 2 .cse15)) (.cse0 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 4) 4294967296)) (.cse9 (+ 2 .cse2)) (.cse3 (mod (+ 3 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse14 (+ 2 .cse12)) (.cse10 (mod (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse7 (mod (+ 6 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296)) (.cse6 (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 12) 4294967296)) (.cse11 (+ .cse17 2)) (.cse13 (mod (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) 4294967296)) (.cse16 (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)) (or (< .cse2 .cse10) (< .cse3 .cse1)) (or (< .cse10 .cse14) (< .cse15 .cse13)) (or (< .cse0 .cse9) (< .cse8 .cse3)) (or (< .cse3 .cse14) (< .cse15 .cse10)) (or (< (+ |c_thread2Thread1of1ForFork0_~i~1#1| (* 4294967296 (div (+ 4294967295 c_~n~0) 4294967296))) (+ (* 4294967296 (div |c_thread2Thread1of1ForFork0_~i~1#1| 4294967296)) 14 c_~n~0)) (< (+ (* 4294967296 (div c_~n~0 4294967296)) |c_thread1Thread1of1ForFork1_~i~0#1|) (+ (* 4294967296 (div |c_thread1Thread1of1ForFork1_~i~0#1| 4294967296)) c_~n~0))) (or (< (mod (+ |c_thread2Thread1of1ForFork0_~i~1#1| 14) 4294967296) .cse7) (< (mod (+ 7 |c_thread1Thread1of1ForFork1_~i~0#1|) 4294967296) (+ .cse6 2))) (or (< .cse12 .cse16) (< .cse13 .cse11)) (or (< .cse13 (+ 2 (mod |c_thread2Thread1of1ForFork0_~i~1#1| 4294967296))) (< .cse17 .cse16))))) is different from false [2024-07-20 20:14:53,703 WARN L293 SmtUtils]: Spent 51.87s on a formula simplification. DAG size of input: 101 DAG size of output: 91 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-07-20 20:14:55,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-07-20 20:15:11,234 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-07-20 20:15:12,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-07-20 20:15:14,972 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-07-20 20:15:16,974 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-07-20 20:15:20,002 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 [] Killed by 15