./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking LOOP --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/popl20-mult-4.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 b81cf2d80bc77dedaac253250be737ceaa09f6e691f026864fe6fd5cb48c2489 --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking LOOP --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 10:07:22,517 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-19 10:07:22,580 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-19 10:07:22,585 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-19 10:07:22,587 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-19 10:07:22,611 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-19 10:07:22,612 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-19 10:07:22,612 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-19 10:07:22,613 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-19 10:07:22,616 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-19 10:07:22,616 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-19 10:07:22,616 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-19 10:07:22,616 INFO L153 SettingsManager]: * Use SBE=true [2024-10-19 10:07:22,617 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-19 10:07:22,617 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-19 10:07:22,617 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-19 10:07:22,617 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-19 10:07:22,617 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-19 10:07:22,618 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-19 10:07:22,618 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-19 10:07:22,619 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-19 10:07:22,619 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-19 10:07:22,619 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-19 10:07:22,619 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-19 10:07:22,620 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-19 10:07:22,620 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-19 10:07:22,620 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-19 10:07:22,620 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-19 10:07:22,620 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-19 10:07:22,621 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-19 10:07:22,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-19 10:07:22,621 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-19 10:07:22,621 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-19 10:07:22,621 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-19 10:07:22,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-19 10:07:22,622 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-19 10:07:22,622 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-19 10:07:22,622 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-19 10:07:22,624 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-19 10:07:22,624 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-19 10:07:22,624 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-19 10:07:22,625 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 -> b81cf2d80bc77dedaac253250be737ceaa09f6e691f026864fe6fd5cb48c2489 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 -> LOOP 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 10:07:22,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-19 10:07:22,857 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-19 10:07:22,859 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-19 10:07:22,861 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-19 10:07:22,862 INFO L274 PluginConnector]: CDTParser initialized [2024-10-19 10:07:22,863 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c [2024-10-19 10:07:24,074 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-19 10:07:24,256 INFO L384 CDTParser]: Found 1 translation units. [2024-10-19 10:07:24,256 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-mult-4.wvr.c [2024-10-19 10:07:24,263 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/b9edd8241/4fcd7d1839354de2b4392148eca55695/FLAG1733823a1 [2024-10-19 10:07:24,668 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/b9edd8241/4fcd7d1839354de2b4392148eca55695 [2024-10-19 10:07:24,672 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-19 10:07:24,673 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-19 10:07:24,674 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-19 10:07:24,674 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-19 10:07:24,679 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-19 10:07:24,679 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 10:07:24" (1/1) ... [2024-10-19 10:07:24,680 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71e7d977 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 10:07:24, skipping insertion in model container [2024-10-19 10:07:24,680 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 10:07:24" (1/1) ... [2024-10-19 10:07:24,700 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-19 10:07:24,878 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/popl20-mult-4.wvr.c[2664,2677] [2024-10-19 10:07:24,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-19 10:07:24,889 INFO L200 MainTranslator]: Completed pre-run [2024-10-19 10:07:24,904 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/popl20-mult-4.wvr.c[2664,2677] [2024-10-19 10:07:24,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-19 10:07:24,919 INFO L204 MainTranslator]: Completed translation [2024-10-19 10:07:24,920 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 10:07:24 WrapperNode [2024-10-19 10:07:24,920 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-19 10:07:24,921 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-19 10:07:24,921 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-19 10:07:24,921 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-19 10:07:24,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 10:07:24" (1/1) ... [2024-10-19 10:07:24,932 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 10:07:24" (1/1) ... [2024-10-19 10:07:24,950 INFO L138 Inliner]: procedures = 22, calls = 22, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 98 [2024-10-19 10:07:24,951 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-19 10:07:24,951 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-19 10:07:24,951 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-19 10:07:24,952 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-19 10:07:24,961 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 10:07:24" (1/1) ... [2024-10-19 10:07:24,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 10:07:24" (1/1) ... [2024-10-19 10:07:24,963 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 10:07:24" (1/1) ... [2024-10-19 10:07:24,963 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 10:07:24" (1/1) ... [2024-10-19 10:07:24,966 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 10:07:24" (1/1) ... [2024-10-19 10:07:24,969 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 10:07:24" (1/1) ... [2024-10-19 10:07:24,971 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 10:07:24" (1/1) ... [2024-10-19 10:07:24,971 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 10:07:24" (1/1) ... [2024-10-19 10:07:24,973 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-19 10:07:24,974 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-19 10:07:24,974 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-19 10:07:24,974 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-19 10:07:24,975 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 10:07:24" (1/1) ... [2024-10-19 10:07:24,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-19 10:07:24,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 10:07:24,998 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 10:07:25,000 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 10:07:25,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-19 10:07:25,036 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-19 10:07:25,036 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-19 10:07:25,036 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-19 10:07:25,036 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-19 10:07:25,037 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-19 10:07:25,037 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-19 10:07:25,037 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-10-19 10:07:25,037 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-10-19 10:07:25,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-19 10:07:25,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-19 10:07:25,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-19 10:07:25,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-19 10:07:25,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-19 10:07:25,038 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 10:07:25,111 INFO L238 CfgBuilder]: Building ICFG [2024-10-19 10:07:25,112 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-19 10:07:25,261 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-19 10:07:25,261 INFO L287 CfgBuilder]: Performing block encoding [2024-10-19 10:07:25,384 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-19 10:07:25,384 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-19 10:07:25,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 10:07:25 BoogieIcfgContainer [2024-10-19 10:07:25,385 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-19 10:07:25,388 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-19 10:07:25,389 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-19 10:07:25,392 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-19 10:07:25,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.10 10:07:24" (1/3) ... [2024-10-19 10:07:25,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d244532 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 10:07:25, skipping insertion in model container [2024-10-19 10:07:25,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 10:07:24" (2/3) ... [2024-10-19 10:07:25,394 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d244532 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.10 10:07:25, skipping insertion in model container [2024-10-19 10:07:25,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 10:07:25" (3/3) ... [2024-10-19 10:07:25,398 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-mult-4.wvr.c [2024-10-19 10:07:25,412 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-19 10:07:25,413 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-19 10:07:25,413 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-19 10:07:25,481 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-19 10:07:25,522 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-19 10:07:25,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-19 10:07:25,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 10:07:25,525 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 10:07:25,526 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 10:07:25,606 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-19 10:07:25,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 10:07:25,627 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-19 10:07:25,633 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;@52e90262, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=LOOP, mConComCheckerTraceCheckMode=GENERATOR, mConComCheckerLimitedChecksCriterion=true, mConComCheckerCriterionLimit=5, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-19 10:07:25,633 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-19 10:07:26,546 INFO L85 PathProgramCache]: Analyzing trace with hash -297348609, now seen corresponding path program 1 times [2024-10-19 10:07:26,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:07:26,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 10:07:26,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 10:07:26,669 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 10:07:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 10:07:26,773 INFO L85 PathProgramCache]: Analyzing trace with hash -535005413, now seen corresponding path program 1 times [2024-10-19 10:07:26,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:07:26,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 10:07:26,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 10:07:27,138 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 10:07:27,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:07:27,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 10:07:27,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 10:07:27,334 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 10:07:27,390 INFO L85 PathProgramCache]: Analyzing trace with hash 594699487, now seen corresponding path program 1 times [2024-10-19 10:07:27,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:07:27,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 10:07:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 10:07:27,419 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 10:07:27,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 10:07:27,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1255813051, now seen corresponding path program 1 times [2024-10-19 10:07:27,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:07:27,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 10:07:27,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 10:07:27,781 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 10:07:27,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:07:27,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 10:07:27,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 10:07:28,005 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 10:07:28,046 INFO L85 PathProgramCache]: Analyzing trace with hash -338209895, now seen corresponding path program 1 times [2024-10-19 10:07:28,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:07:28,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 10:07:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 10:07:28,221 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 10:07:28,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:07:28,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 10:07:28,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 10:07:28,375 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 10:07:28,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1894573672, now seen corresponding path program 1 times [2024-10-19 10:07:28,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:07:28,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 10:07:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 10:07:28,575 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 10:07:28,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:07:28,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 10:07:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 10:07:28,714 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 10:07:28,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1397756825, now seen corresponding path program 1 times [2024-10-19 10:07:28,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:07:28,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 10:07:28,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 10:07:28,768 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 10:07:28,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 10:07:28,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1013534283, now seen corresponding path program 1 times [2024-10-19 10:07:28,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:07:28,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 10:07:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 10:07:29,003 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 10:07:29,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:07:29,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 10:07:29,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 10:07:29,160 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 10:07:29,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1354789937, now seen corresponding path program 1 times [2024-10-19 10:07:29,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:07:29,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 10:07:29,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 10:07:29,397 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 10:07:29,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:07:29,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 10:07:29,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 10:07:29,553 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 10:07:29,581 INFO L85 PathProgramCache]: Analyzing trace with hash -951186645, now seen corresponding path program 1 times [2024-10-19 10:07:29,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:07:29,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 10:07:29,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 10:07:29,878 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 10:07:29,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:07:29,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 10:07:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 10:07:30,119 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 10:07:30,160 INFO L85 PathProgramCache]: Analyzing trace with hash 170531337, now seen corresponding path program 1 times [2024-10-19 10:07:30,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:07:30,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 10:07:30,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 10:07:30,175 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 10:07:30,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 10:07:30,229 INFO L85 PathProgramCache]: Analyzing trace with hash 991502142, now seen corresponding path program 1 times [2024-10-19 10:07:30,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:07:30,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 10:07:30,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 10:07:30,404 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 10:07:30,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:07:30,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 10:07:30,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 10:07:30,578 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 10:07:30,618 INFO L85 PathProgramCache]: Analyzing trace with hash 671793353, now seen corresponding path program 1 times [2024-10-19 10:07:30,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:07:30,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 10:07:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 10:07:30,633 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 10:07:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 10:07:30,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1153961981, now seen corresponding path program 1 times [2024-10-19 10:07:30,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:07:30,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 10:07:30,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 10:07:30,925 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 10:07:30,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:07:30,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 10:07:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 10:07:31,108 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 10:07:31,135 INFO L85 PathProgramCache]: Analyzing trace with hash -733212888, now seen corresponding path program 1 times [2024-10-19 10:07:31,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:07:31,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 10:07:31,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 10:07:31,373 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 10:07:31,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:07:31,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 10:07:31,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 10:07:31,584 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 10:07:31,612 INFO L85 PathProgramCache]: Analyzing trace with hash 2054558111, now seen corresponding path program 1 times [2024-10-19 10:07:31,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:07:31,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 10:07:31,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 10:07:32,071 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 10:07:32,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:07:32,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 10:07:32,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 10:07:32,514 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 10:07:32,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1413085140, now seen corresponding path program 1 times [2024-10-19 10:07:32,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:07:32,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 10:07:32,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 10:07:32,778 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 10:07:32,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:07:32,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 10:07:32,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 10:07:32,958 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-19 10:07:33,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1153781247, now seen corresponding path program 1 times [2024-10-19 10:07:33,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:07:33,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 10:07:33,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 10:07:33,047 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 10:07:33,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 10:07:33,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1153781463, now seen corresponding path program 1 times [2024-10-19 10:07:33,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:07:33,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 10:07:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 10:07:33,108 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-19 10:07:33,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-19 10:07:33,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1336305715, now seen corresponding path program 1 times [2024-10-19 10:07:33,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:07:33,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 10:07:33,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 10:07:33,327 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-19 10:07:33,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:07:33,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 10:07:33,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 10:07:33,468 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-19 10:07:33,510 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-19 10:07:33,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 10:07:33,515 INFO L85 PathProgramCache]: Analyzing trace with hash -73013975, now seen corresponding path program 1 times [2024-10-19 10:07:33,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 10:07:33,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533764585] [2024-10-19 10:07:33,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:07:33,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 10:07:33,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 10:07:33,827 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 90 proven. 107 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-19 10:07:33,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 10:07:33,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533764585] [2024-10-19 10:07:33,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533764585] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 10:07:33,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983558665] [2024-10-19 10:07:33,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:07:33,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 10:07:33,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 10:07:33,841 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 10:07:33,843 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 10:07:33,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 10:07:33,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-19 10:07:33,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 10:07:34,231 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 90 proven. 113 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-19 10:07:34,231 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 10:07:34,623 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 90 proven. 113 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-19 10:07:34,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983558665] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 10:07:34,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 10:07:34,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 28 [2024-10-19 10:07:34,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332867312] [2024-10-19 10:07:34,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 10:07:34,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-19 10:07:34,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 10:07:34,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-19 10:07:34,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2024-10-19 10:07:34,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 10:07:34,655 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 10:07:34,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.428571428571429) internal successors, (180), 28 states have internal predecessors, (180), 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 10:07:34,656 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 10:07:35,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-19 10:07:35,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-19 10:07:36,049 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,SelfDestructingSolverStorable33 [2024-10-19 10:07:36,050 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-19 10:07:36,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 10:07:36,050 INFO L85 PathProgramCache]: Analyzing trace with hash 2096618437, now seen corresponding path program 2 times [2024-10-19 10:07:36,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 10:07:36,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257637707] [2024-10-19 10:07:36,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:07:36,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 10:07:36,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 10:07:36,692 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 240 proven. 366 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2024-10-19 10:07:36,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 10:07:36,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257637707] [2024-10-19 10:07:36,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257637707] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 10:07:36,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714212725] [2024-10-19 10:07:36,693 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-19 10:07:36,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 10:07:36,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 10:07:36,695 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 10:07:36,696 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 10:07:36,804 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-19 10:07:36,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-19 10:07:36,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-19 10:07:36,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 10:07:37,438 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 240 proven. 492 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-19 10:07:37,438 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 10:07:38,402 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 240 proven. 492 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-19 10:07:38,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714212725] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 10:07:38,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 10:07:38,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 21, 21] total 47 [2024-10-19 10:07:38,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961836674] [2024-10-19 10:07:38,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 10:07:38,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-10-19 10:07:38,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 10:07:38,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-10-19 10:07:38,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=1875, Unknown=0, NotChecked=0, Total=2162 [2024-10-19 10:07:38,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 10:07:38,410 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 10:07:38,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 6.617021276595745) internal successors, (311), 47 states have internal predecessors, (311), 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 10:07:38,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-19 10:07:38,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 10:07:55,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-19 10:07:55,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2024-10-19 10:07:55,805 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 10:07:55,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-10-19 10:07:55,995 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-19 10:07:55,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 10:07:55,997 INFO L85 PathProgramCache]: Analyzing trace with hash -453510420, now seen corresponding path program 3 times [2024-10-19 10:07:55,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 10:07:55,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111422932] [2024-10-19 10:07:55,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:07:55,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 10:07:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 10:07:57,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2558 backedges. 460 proven. 553 refuted. 0 times theorem prover too weak. 1545 trivial. 0 not checked. [2024-10-19 10:07:57,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 10:07:57,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111422932] [2024-10-19 10:07:57,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111422932] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 10:07:57,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693832698] [2024-10-19 10:07:57,267 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-19 10:07:57,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 10:07:57,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 10:07:57,269 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 10:07:57,270 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 10:07:57,795 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2024-10-19 10:07:57,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-19 10:07:57,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-10-19 10:07:57,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 10:07:58,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2558 backedges. 460 proven. 2073 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-19 10:07:58,894 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 10:08:00,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2558 backedges. 460 proven. 2073 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-19 10:08:00,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693832698] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 10:08:00,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 10:08:00,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 41, 41] total 83 [2024-10-19 10:08:00,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134354550] [2024-10-19 10:08:00,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 10:08:00,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2024-10-19 10:08:00,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 10:08:00,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2024-10-19 10:08:00,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1249, Invalid=5557, Unknown=0, NotChecked=0, Total=6806 [2024-10-19 10:08:00,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 10:08:00,618 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 10:08:00,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 6.204819277108434) internal successors, (515), 83 states have internal predecessors, (515), 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 10:08:00,618 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-19 10:08:00,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 129 states. [2024-10-19 10:08:00,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 10:08:14,978 WARN L286 SmtUtils]: Spent 6.30s on a formula simplification. DAG size of input: 149 DAG size of output: 149 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-19 10:08:21,871 WARN L286 SmtUtils]: Spent 5.06s on a formula simplification. DAG size of input: 155 DAG size of output: 148 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-19 10:08:28,774 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 10:08:30,789 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 10:08:32,862 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 10:08:32,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-19 10:08:32,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2024-10-19 10:08:32,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2024-10-19 10:08:32,986 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 10:08:33,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 10:08:33,173 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-19 10:08:33,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-19 10:08:33,173 INFO L85 PathProgramCache]: Analyzing trace with hash -684919156, now seen corresponding path program 4 times [2024-10-19 10:08:33,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-19 10:08:33,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512274813] [2024-10-19 10:08:33,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-19 10:08:33,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-19 10:08:33,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-19 10:08:36,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 873 proven. 3210 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-19 10:08:36,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-19 10:08:36,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512274813] [2024-10-19 10:08:36,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512274813] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-19 10:08:36,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616242434] [2024-10-19 10:08:36,405 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-19 10:08:36,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-19 10:08:36,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-19 10:08:36,406 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 10:08:36,407 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 10:08:36,536 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-19 10:08:36,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-19 10:08:36,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 738 conjuncts, 118 conjuncts are in the unsatisfiable core [2024-10-19 10:08:36,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-19 10:08:40,121 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 237 proven. 3900 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-19 10:08:40,121 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-19 10:08:47,938 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 237 proven. 3900 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-19 10:08:47,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616242434] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-19 10:08:47,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-19 10:08:47,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 61, 61] total 168 [2024-10-19 10:08:47,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971994952] [2024-10-19 10:08:47,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-19 10:08:47,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 168 states [2024-10-19 10:08:47,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-19 10:08:47,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2024-10-19 10:08:47,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2751, Invalid=25305, Unknown=0, NotChecked=0, Total=28056 [2024-10-19 10:08:47,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-19 10:08:47,948 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-19 10:08:47,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 168 states, 168 states have (on average 5.684523809523809) internal successors, (955), 168 states have internal predecessors, (955), 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 10:08:47,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-19 10:08:47,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 132 states. [2024-10-19 10:08:47,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 88 states. [2024-10-19 10:08:47,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-19 10:09:13,186 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (+ 19 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse1 (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 20) 4294967296) 1)) (.cse10 (mod (+ 14 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse6 (mod (+ c_thread1Thread1of1ForFork0_~i~0 13) 4294967296)) (.cse13 (+ (mod (+ 14 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (.cse11 (+ (mod (+ 15 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (.cse5 (+ (mod (+ 23 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (.cse14 (mod (+ 15 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse20 (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 1) 4294967296) 1)) (.cse16 (+ (mod (+ 9 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (.cse3 (+ (mod (+ 19 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (.cse29 (mod (+ c_thread1Thread1of1ForFork0_~i~0 18) 4294967296)) (.cse22 (+ (mod (+ 16 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (.cse25 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse15 (mod (+ 9 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse31 (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 12) 4294967296) 1)) (.cse26 (mod (+ 8 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse38 (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 26) 4294967296) 1)) (.cse21 (mod (+ 23 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse28 (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 24) 4294967296) 1)) (.cse9 (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 4) 4294967296) 1)) (.cse36 (+ (mod (+ 8 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (.cse35 (mod (+ c_thread1Thread1of1ForFork0_~i~0 12) 4294967296)) (.cse7 (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 13) 4294967296) 1)) (.cse45 (mod (+ c_thread1Thread1of1ForFork0_~i~0 10) 4294967296)) (.cse34 (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 10) 4294967296) 1)) (.cse33 (mod (+ 16 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse48 (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 17) 4294967296) 1)) (.cse0 (mod (+ c_thread1Thread1of1ForFork0_~i~0 20) 4294967296)) (.cse8 (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296)) (.cse44 (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse30 (mod (+ c_thread1Thread1of1ForFork0_~i~0 11) 4294967296)) (.cse46 (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 11) 4294967296) 1)) (.cse51 (+ (mod (+ 7 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (.cse4 (mod (+ 22 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse24 (+ (mod (+ 22 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (.cse41 (mod (+ 5 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse50 (+ (mod (+ 5 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (.cse37 (mod (+ c_thread1Thread1of1ForFork0_~i~0 25) 4294967296)) (.cse19 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse52 (mod (+ 6 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse42 (+ (mod (+ 6 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (.cse40 (mod (+ 2 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse43 (+ (mod (+ 3 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (.cse47 (mod (+ c_thread1Thread1of1ForFork0_~i~0 17) 4294967296)) (.cse32 (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 18) 4294967296) 1)) (.cse23 (mod (+ 21 c_thread1Thread1of1ForFork0_~i~0) 4294967296)) (.cse49 (+ (mod (+ 21 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (.cse17 (mod (+ c_thread1Thread1of1ForFork0_~i~0 27) 4294967296)) (.cse12 (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 28) 4294967296) 1)) (.cse39 (mod (+ c_thread1Thread1of1ForFork0_~i~0 26) 4294967296)) (.cse18 (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 27) 4294967296) 1)) (.cse27 (mod (+ c_thread1Thread1of1ForFork0_~i~0 24) 4294967296)) (.cse53 (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 25) 4294967296) 1))) (and (< .cse0 .cse1) (< .cse2 .cse3) (< .cse4 .cse5) (< .cse6 .cse7) (< .cse8 .cse9) (< .cse2 .cse1) (< .cse10 .cse11) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 28) 4294967296) .cse12) (< .cse10 .cse13) (< .cse6 .cse13) (< (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296) .cse9) (< .cse14 .cse11) (< .cse15 .cse16) (< .cse17 .cse18) (< .cse19 .cse20) (< .cse21 .cse5) (< .cse14 .cse22) (< .cse23 .cse24) (< .cse25 .cse20) (< .cse26 .cse16) (< .cse27 .cse28) (< .cse29 .cse3) (< .cse30 .cse31) (< .cse29 .cse32) (< .cse33 .cse22) (< .cse25 (+ (mod |c_thread2Thread1of1ForFork2_~i~1#1| 4294967296) 1)) (< .cse15 .cse34) (< .cse35 .cse31) (< .cse26 .cse36) (< .cse37 .cse38) (< .cse39 .cse38) (< .cse21 .cse28) (< .cse40 .cse9) (< .cse41 .cse42) (< .cse19 .cse43) (< .cse44 .cse36) (< .cse35 .cse7) (< .cse45 .cse46) (< .cse47 .cse48) (< .cse45 .cse34) (< .cse33 .cse48) (< .cse0 .cse49) (< .cse8 .cse50) (< .cse44 .cse51) (< .cse30 .cse46) (< .cse52 .cse51) (< .cse4 .cse24) (< .cse41 .cse50) (< .cse37 .cse53) (< .cse19 (+ (mod (+ 2 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (< .cse52 .cse42) (< .cse40 .cse43) (< .cse47 .cse32) (< .cse23 .cse49) (< .cse17 .cse12) (< .cse39 .cse18) (< .cse27 .cse53))) is different from false [2024-10-19 10:10:24,300 WARN L286 SmtUtils]: Spent 28.59s on a formula simplification. DAG size of input: 152 DAG size of output: 130 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-19 10:13:04,886 WARN L286 SmtUtils]: Spent 1.17m on a formula simplification. DAG size of input: 194 DAG size of output: 168 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-19 10:13:06,897 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296))) (and (< (mod (+ 22 c_thread1Thread1of1ForFork0_~i~0) 4294967296) (+ (mod (+ 23 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (< (mod (+ 19 c_thread1Thread1of1ForFork0_~i~0) 4294967296) (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 20) 4294967296) 1)) (< (mod (+ 14 c_thread1Thread1of1ForFork0_~i~0) 4294967296) (+ (mod (+ 15 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 13) 4294967296) (+ (mod (+ 14 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (< (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296) (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 4) 4294967296) 1)) (< .cse0 (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 1) 4294967296) 1)) (< (mod (+ 15 c_thread1Thread1of1ForFork0_~i~0) 4294967296) (+ (mod (+ 16 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (< (mod (+ 21 c_thread1Thread1of1ForFork0_~i~0) 4294967296) (+ (mod (+ 22 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (< (mod (+ 8 c_thread1Thread1of1ForFork0_~i~0) 4294967296) (+ (mod (+ 9 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 18) 4294967296) (+ (mod (+ 19 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 11) 4294967296) (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 12) 4294967296) 1)) (< (mod (+ 9 c_thread1Thread1of1ForFork0_~i~0) 4294967296) (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 10) 4294967296) 1)) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 25) 4294967296) (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 26) 4294967296) 1)) (< (mod (+ 23 c_thread1Thread1of1ForFork0_~i~0) 4294967296) (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 24) 4294967296) 1)) (< (mod (+ 5 c_thread1Thread1of1ForFork0_~i~0) 4294967296) (+ (mod (+ 6 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (< .cse0 (+ (mod (+ 3 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (< (mod (+ 7 c_thread1Thread1of1ForFork0_~i~0) 4294967296) (+ (mod (+ 8 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 12) 4294967296) (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 13) 4294967296) 1)) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 10) 4294967296) (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 11) 4294967296) 1)) (< (mod (+ 16 c_thread1Thread1of1ForFork0_~i~0) 4294967296) (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 17) 4294967296) 1)) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 20) 4294967296) (+ (mod (+ 21 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 4) 4294967296) (+ (mod (+ 5 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (< (mod (+ 6 c_thread1Thread1of1ForFork0_~i~0) 4294967296) (+ (mod (+ 7 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (< .cse0 (+ (mod (+ 2 |c_thread2Thread1of1ForFork2_~i~1#1|) 4294967296) 1)) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 17) 4294967296) (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 18) 4294967296) 1)) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 27) 4294967296) (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 28) 4294967296) 1)) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 26) 4294967296) (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 27) 4294967296) 1)) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 24) 4294967296) (+ (mod (+ |c_thread2Thread1of1ForFork2_~i~1#1| 25) 4294967296) 1)))) is different from false [2024-10-19 10:15:25,451 WARN L286 SmtUtils]: Spent 57.66s on a formula simplification. DAG size of input: 184 DAG size of output: 158 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-19 10:15:27,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:15:29,149 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 10:15:31,151 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 10:15:33,157 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 10:15:34,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:15:36,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:15:39,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:15:41,231 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 10:15:42,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:15:44,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:15:46,946 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 10:15:49,536 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 10:15:52,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:15:55,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:15:57,910 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 10:15:59,912 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 10:16:04,041 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 10:16:06,043 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 10:18:28,093 WARN L286 SmtUtils]: Spent 1.04m on a formula simplification. DAG size of input: 186 DAG size of output: 160 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-19 10:18:30,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:18:33,003 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 10:18:35,329 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 10:18:37,758 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 10:18:39,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:18:40,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:18:42,706 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 10:18:44,932 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 10:18:46,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:18:48,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:18:53,218 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 10:18:54,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:18:57,621 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 10:19:00,547 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 10:19:02,553 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 10:19:03,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:19:05,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:19:08,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:19:12,182 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 10:19:13,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:19:16,686 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 10:19:18,981 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 10:19:20,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:19:24,234 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 10:19:25,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:19:27,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:19:30,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:19:32,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:19:33,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:19:36,168 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 10:19:38,174 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 10:19:39,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:19:41,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:19:43,326 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 10:19:45,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:19:47,760 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 10:19:48,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:19:51,536 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 10:19:54,162 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 10:19:56,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:19:58,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:19:59,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:20:01,834 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 10:20:04,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:20:08,504 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 10:20:11,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:20:12,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:20:13,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:20:15,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:20:19,205 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 10:20:21,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:20:23,502 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 10:20:26,114 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 10:20:28,577 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 10:20:29,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:20:32,396 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 10:20:34,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:20:35,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:20:38,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:20:40,311 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 10:20:42,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:20:44,955 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 10:20:46,958 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 10:20:48,959 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 10:20:51,674 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 10:20:53,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:20:55,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:20:57,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:20:58,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:21:00,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:21:02,104 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 10:21:03,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:21:05,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:21:07,894 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 10:21:09,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:21:12,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:21:16,411 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 10:21:18,899 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 10:21:21,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:21:22,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:21:24,582 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 10:21:27,947 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 10:21:30,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:21:31,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:21:33,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:21:34,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:21:36,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:21:38,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:21:39,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:21:41,255 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 10:21:42,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:21:44,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-19 10:21:46,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Killed by 15