./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 448d4d75 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ebb6bba6491ab996b2a2d1f88baf86906cd5ba5ce7e0ad4dc20017ded9089a97 --traceabstraction.positions.where.we.compute.the.hoare.annotation All --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.owicki-witnesses-448d4d7-m [2024-02-20 11:38:18,317 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-20 11:38:18,393 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-20 11:38:18,398 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-20 11:38:18,399 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-20 11:38:18,473 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-20 11:38:18,474 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-20 11:38:18,474 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-20 11:38:18,475 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-20 11:38:18,475 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-20 11:38:18,476 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-20 11:38:18,476 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-20 11:38:18,476 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-20 11:38:18,477 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-20 11:38:18,477 INFO L153 SettingsManager]: * Use SBE=true [2024-02-20 11:38:18,477 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-20 11:38:18,478 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-20 11:38:18,478 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-20 11:38:18,478 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-20 11:38:18,479 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-20 11:38:18,479 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-20 11:38:18,481 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-20 11:38:18,481 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-20 11:38:18,481 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-20 11:38:18,481 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-20 11:38:18,482 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-20 11:38:18,482 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-20 11:38:18,482 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-20 11:38:18,483 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-20 11:38:18,483 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-20 11:38:18,484 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-20 11:38:18,484 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-20 11:38:18,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 11:38:18,485 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-20 11:38:18,485 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-20 11:38:18,486 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-20 11:38:18,486 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-20 11:38:18,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-20 11:38:18,486 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-20 11:38:18,487 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-20 11:38:18,487 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-20 11:38:18,487 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-20 11:38:18,487 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-20 11:38:18,488 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ebb6bba6491ab996b2a2d1f88baf86906cd5ba5ce7e0ad4dc20017ded9089a97 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-20 11:38:18,747 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-20 11:38:18,772 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-20 11:38:18,774 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-20 11:38:18,775 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-20 11:38:18,776 INFO L274 PluginConnector]: CDTParser initialized [2024-02-20 11:38:18,777 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2024-02-20 11:38:19,906 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-20 11:38:20,126 INFO L384 CDTParser]: Found 1 translation units. [2024-02-20 11:38:20,127 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2024-02-20 11:38:20,138 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abc907862/4ea04a6add18416c9ca872f5cf314909/FLAGce57595f4 [2024-02-20 11:38:20,154 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abc907862/4ea04a6add18416c9ca872f5cf314909 [2024-02-20 11:38:20,157 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-20 11:38:20,158 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-20 11:38:20,159 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-20 11:38:20,160 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-20 11:38:20,165 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-20 11:38:20,166 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:38:20" (1/1) ... [2024-02-20 11:38:20,166 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2400eb39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:38:20, skipping insertion in model container [2024-02-20 11:38:20,167 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:38:20" (1/1) ... [2024-02-20 11:38:20,189 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-20 11:38:20,374 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c[2237,2250] [2024-02-20 11:38:20,379 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 11:38:20,388 INFO L202 MainTranslator]: Completed pre-run [2024-02-20 11:38:20,413 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c[2237,2250] [2024-02-20 11:38:20,414 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 11:38:20,431 INFO L206 MainTranslator]: Completed translation [2024-02-20 11:38:20,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:38:20 WrapperNode [2024-02-20 11:38:20,432 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-20 11:38:20,433 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-20 11:38:20,433 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-20 11:38:20,434 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-20 11:38:20,439 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:38:20" (1/1) ... [2024-02-20 11:38:20,447 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:38:20" (1/1) ... [2024-02-20 11:38:20,479 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2024-02-20 11:38:20,479 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-20 11:38:20,480 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-20 11:38:20,480 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-20 11:38:20,480 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-20 11:38:20,521 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:38:20" (1/1) ... [2024-02-20 11:38:20,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:38:20" (1/1) ... [2024-02-20 11:38:20,526 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:38:20" (1/1) ... [2024-02-20 11:38:20,554 INFO L175 MemorySlicer]: Split 10 memory accesses to 5 slices as follows [2, 2, 2, 2, 2]. 20 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2024-02-20 11:38:20,558 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:38:20" (1/1) ... [2024-02-20 11:38:20,559 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:38:20" (1/1) ... [2024-02-20 11:38:20,565 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:38:20" (1/1) ... [2024-02-20 11:38:20,577 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:38:20" (1/1) ... [2024-02-20 11:38:20,579 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:38:20" (1/1) ... [2024-02-20 11:38:20,586 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:38:20" (1/1) ... [2024-02-20 11:38:20,589 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-20 11:38:20,589 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-20 11:38:20,590 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-20 11:38:20,590 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-20 11:38:20,596 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:38:20" (1/1) ... [2024-02-20 11:38:20,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 11:38:20,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:38:20,626 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-02-20 11:38:20,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-02-20 11:38:20,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-20 11:38:20,686 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-20 11:38:20,686 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-20 11:38:20,687 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-20 11:38:20,687 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-20 11:38:20,687 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-20 11:38:20,687 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-20 11:38:20,689 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-02-20 11:38:20,689 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-02-20 11:38:20,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-20 11:38:20,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-20 11:38:20,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-20 11:38:20,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-20 11:38:20,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-20 11:38:20,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-20 11:38:20,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-20 11:38:20,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-20 11:38:20,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-20 11:38:20,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-20 11:38:20,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-20 11:38:20,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-20 11:38:20,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-20 11:38:20,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-20 11:38:20,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-20 11:38:20,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-20 11:38:20,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-20 11:38:20,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-20 11:38:20,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-20 11:38:20,697 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-20 11:38:20,807 INFO L244 CfgBuilder]: Building ICFG [2024-02-20 11:38:20,809 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-20 11:38:20,989 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-20 11:38:20,989 INFO L293 CfgBuilder]: Performing block encoding [2024-02-20 11:38:21,193 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-20 11:38:21,196 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-02-20 11:38:21,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:38:21 BoogieIcfgContainer [2024-02-20 11:38:21,197 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-20 11:38:21,200 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-20 11:38:21,200 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-20 11:38:21,203 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-20 11:38:21,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:38:20" (1/3) ... [2024-02-20 11:38:21,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44e6b8cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:38:21, skipping insertion in model container [2024-02-20 11:38:21,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:38:20" (2/3) ... [2024-02-20 11:38:21,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44e6b8cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:38:21, skipping insertion in model container [2024-02-20 11:38:21,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:38:21" (3/3) ... [2024-02-20 11:38:21,209 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x3.wvr.c [2024-02-20 11:38:21,225 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-20 11:38:21,225 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-20 11:38:21,225 INFO L635 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-20 11:38:21,276 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-02-20 11:38:21,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 31 transitions, 90 flow [2024-02-20 11:38:21,344 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2024-02-20 11:38:21,345 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-02-20 11:38:21,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 27 events. 4/27 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 10 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2024-02-20 11:38:21,348 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 31 transitions, 90 flow [2024-02-20 11:38:21,351 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 26 transitions, 76 flow [2024-02-20 11:38:21,362 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-20 11:38:21,369 INFO L369 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@57fc4116, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-20 11:38:21,369 INFO L370 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-02-20 11:38:21,392 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-20 11:38:21,393 INFO L124 PetriNetUnfolderBase]: 4/25 cut-off events. [2024-02-20 11:38:21,393 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-02-20 11:38:21,393 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:38:21,394 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:38:21,396 INFO L432 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-02-20 11:38:21,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:38:21,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1123761867, now seen corresponding path program 1 times [2024-02-20 11:38:21,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:38:21,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691171420] [2024-02-20 11:38:21,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:38:21,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:38:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:38:21,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:38:21,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:38:21,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691171420] [2024-02-20 11:38:21,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691171420] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:38:21,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:38:21,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-20 11:38:21,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105102545] [2024-02-20 11:38:21,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:38:21,970 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 11:38:21,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:38:22,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 11:38:22,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 11:38:22,008 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-20 11:38:22,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:38:22,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:38:22,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-20 11:38:22,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:38:22,231 INFO L124 PetriNetUnfolderBase]: 497/678 cut-off events. [2024-02-20 11:38:22,231 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2024-02-20 11:38:22,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1449 conditions, 678 events. 497/678 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1778 event pairs, 117 based on Foata normal form. 1/415 useless extension candidates. Maximal degree in co-relation 1016. Up to 471 conditions per place. [2024-02-20 11:38:22,242 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 41 selfloop transitions, 5 changer transitions 1/48 dead transitions. [2024-02-20 11:38:22,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 48 transitions, 235 flow [2024-02-20 11:38:22,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 11:38:22,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 11:38:22,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2024-02-20 11:38:22,256 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6774193548387096 [2024-02-20 11:38:22,261 INFO L308 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2024-02-20 11:38:22,261 INFO L507 AbstractCegarLoop]: Abstraction has has 37 places, 48 transitions, 235 flow [2024-02-20 11:38:22,262 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:38:22,262 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:38:22,262 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:38:22,262 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-20 11:38:22,263 INFO L432 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-02-20 11:38:22,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:38:22,264 INFO L85 PathProgramCache]: Analyzing trace with hash -347116667, now seen corresponding path program 1 times [2024-02-20 11:38:22,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:38:22,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267395577] [2024-02-20 11:38:22,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:38:22,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:38:22,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:38:22,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:38:22,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:38:22,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267395577] [2024-02-20 11:38:22,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267395577] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:38:22,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:38:22,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 11:38:22,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125511716] [2024-02-20 11:38:22,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:38:22,451 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:38:22,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:38:22,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:38:22,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:38:22,453 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-20 11:38:22,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 48 transitions, 235 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-02-20 11:38:22,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:38:22,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-20 11:38:22,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:38:22,760 INFO L124 PetriNetUnfolderBase]: 699/959 cut-off events. [2024-02-20 11:38:22,761 INFO L125 PetriNetUnfolderBase]: For 113/113 co-relation queries the response was YES. [2024-02-20 11:38:22,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2999 conditions, 959 events. 699/959 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2927 event pairs, 15 based on Foata normal form. 0/599 useless extension candidates. Maximal degree in co-relation 2676. Up to 751 conditions per place. [2024-02-20 11:38:22,772 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 90 selfloop transitions, 12 changer transitions 1/104 dead transitions. [2024-02-20 11:38:22,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 104 transitions, 701 flow [2024-02-20 11:38:22,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:38:22,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:38:22,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2024-02-20 11:38:22,776 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6516129032258065 [2024-02-20 11:38:22,777 INFO L308 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2024-02-20 11:38:22,777 INFO L507 AbstractCegarLoop]: Abstraction has has 41 places, 104 transitions, 701 flow [2024-02-20 11:38:22,777 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-02-20 11:38:22,777 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:38:22,777 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:38:22,778 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-20 11:38:22,778 INFO L432 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-02-20 11:38:22,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:38:22,783 INFO L85 PathProgramCache]: Analyzing trace with hash 875344663, now seen corresponding path program 2 times [2024-02-20 11:38:22,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:38:22,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583646686] [2024-02-20 11:38:22,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:38:22,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:38:22,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:38:22,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:38:22,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:38:22,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583646686] [2024-02-20 11:38:22,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583646686] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:38:22,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:38:22,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 11:38:22,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353814380] [2024-02-20 11:38:22,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:38:22,930 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:38:22,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:38:22,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:38:22,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:38:22,932 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-20 11:38:22,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 104 transitions, 701 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-02-20 11:38:22,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:38:22,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-20 11:38:22,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:38:23,168 INFO L124 PetriNetUnfolderBase]: 811/1107 cut-off events. [2024-02-20 11:38:23,169 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2024-02-20 11:38:23,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4565 conditions, 1107 events. 811/1107 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3567 event pairs, 15 based on Foata normal form. 0/705 useless extension candidates. Maximal degree in co-relation 4096. Up to 899 conditions per place. [2024-02-20 11:38:23,177 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 116 selfloop transitions, 10 changer transitions 1/128 dead transitions. [2024-02-20 11:38:23,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 128 transitions, 1114 flow [2024-02-20 11:38:23,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:38:23,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:38:23,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2024-02-20 11:38:23,179 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6516129032258065 [2024-02-20 11:38:23,180 INFO L308 CegarLoopForPetriNet]: 35 programPoint places, 10 predicate places. [2024-02-20 11:38:23,180 INFO L507 AbstractCegarLoop]: Abstraction has has 45 places, 128 transitions, 1114 flow [2024-02-20 11:38:23,180 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-02-20 11:38:23,181 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:38:23,181 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:38:23,181 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-20 11:38:23,181 INFO L432 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-02-20 11:38:23,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:38:23,182 INFO L85 PathProgramCache]: Analyzing trace with hash 2128030273, now seen corresponding path program 1 times [2024-02-20 11:38:23,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:38:23,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510395714] [2024-02-20 11:38:23,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:38:23,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:38:23,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:38:23,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:38:23,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:38:23,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510395714] [2024-02-20 11:38:23,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510395714] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:38:23,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:38:23,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 11:38:23,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855408765] [2024-02-20 11:38:23,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:38:23,300 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:38:23,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:38:23,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:38:23,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:38:23,301 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-20 11:38:23,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 128 transitions, 1114 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-02-20 11:38:23,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:38:23,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-20 11:38:23,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:38:23,527 INFO L124 PetriNetUnfolderBase]: 769/1065 cut-off events. [2024-02-20 11:38:23,528 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2024-02-20 11:38:23,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5461 conditions, 1065 events. 769/1065 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3488 event pairs, 15 based on Foata normal form. 0/705 useless extension candidates. Maximal degree in co-relation 4896. Up to 857 conditions per place. [2024-02-20 11:38:23,536 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 135 selfloop transitions, 11 changer transitions 1/148 dead transitions. [2024-02-20 11:38:23,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 148 transitions, 1583 flow [2024-02-20 11:38:23,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:38:23,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:38:23,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2024-02-20 11:38:23,539 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6451612903225806 [2024-02-20 11:38:23,541 INFO L308 CegarLoopForPetriNet]: 35 programPoint places, 14 predicate places. [2024-02-20 11:38:23,542 INFO L507 AbstractCegarLoop]: Abstraction has has 49 places, 148 transitions, 1583 flow [2024-02-20 11:38:23,542 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-02-20 11:38:23,542 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:38:23,542 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:38:23,542 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-20 11:38:23,543 INFO L432 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-20 11:38:23,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:38:23,543 INFO L85 PathProgramCache]: Analyzing trace with hash -890474439, now seen corresponding path program 1 times [2024-02-20 11:38:23,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:38:23,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98908894] [2024-02-20 11:38:23,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:38:23,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:38:23,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:38:23,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:38:23,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:38:23,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98908894] [2024-02-20 11:38:23,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98908894] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:38:23,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:38:23,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 11:38:23,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299425534] [2024-02-20 11:38:23,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:38:23,637 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:38:23,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:38:23,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:38:23,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:38:23,639 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-20 11:38:23,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 148 transitions, 1583 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-02-20 11:38:23,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:38:23,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-20 11:38:23,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:38:23,880 INFO L124 PetriNetUnfolderBase]: 1063/1470 cut-off events. [2024-02-20 11:38:23,880 INFO L125 PetriNetUnfolderBase]: For 227/227 co-relation queries the response was YES. [2024-02-20 11:38:23,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8993 conditions, 1470 events. 1063/1470 cut-off events. For 227/227 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5007 event pairs, 6 based on Foata normal form. 0/986 useless extension candidates. Maximal degree in co-relation 8284. Up to 1261 conditions per place. [2024-02-20 11:38:23,924 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 293 selfloop transitions, 48 changer transitions 8/350 dead transitions. [2024-02-20 11:38:23,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 350 transitions, 4403 flow [2024-02-20 11:38:23,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:38:23,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:38:23,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2024-02-20 11:38:23,928 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6258064516129033 [2024-02-20 11:38:23,931 INFO L308 CegarLoopForPetriNet]: 35 programPoint places, 18 predicate places. [2024-02-20 11:38:23,931 INFO L507 AbstractCegarLoop]: Abstraction has has 53 places, 350 transitions, 4403 flow [2024-02-20 11:38:23,931 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-02-20 11:38:23,932 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:38:23,932 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:38:23,932 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-20 11:38:23,932 INFO L432 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-20 11:38:23,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:38:23,933 INFO L85 PathProgramCache]: Analyzing trace with hash 33243461, now seen corresponding path program 1 times [2024-02-20 11:38:23,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:38:23,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399692724] [2024-02-20 11:38:23,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:38:23,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:38:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:38:24,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:38:24,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:38:24,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399692724] [2024-02-20 11:38:24,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399692724] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:38:24,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885669300] [2024-02-20 11:38:24,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:38:24,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:38:24,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:38:24,056 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-20 11:38:24,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-02-20 11:38:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:38:24,149 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 3 conjunts are in the unsatisfiable core [2024-02-20 11:38:24,156 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:38:24,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:38:24,353 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:38:24,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:38:24,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885669300] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:38:24,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:38:24,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-02-20 11:38:24,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134116818] [2024-02-20 11:38:24,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:38:24,434 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-20 11:38:24,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:38:24,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-20 11:38:24,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-02-20 11:38:24,435 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-20 11:38:24,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 350 transitions, 4403 flow. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:38:24,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:38:24,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-20 11:38:24,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:38:24,796 INFO L124 PetriNetUnfolderBase]: 1407/1964 cut-off events. [2024-02-20 11:38:24,796 INFO L125 PetriNetUnfolderBase]: For 319/319 co-relation queries the response was YES. [2024-02-20 11:38:24,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13941 conditions, 1964 events. 1407/1964 cut-off events. For 319/319 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7268 event pairs, 6 based on Foata normal form. 0/1348 useless extension candidates. Maximal degree in co-relation 13002. Up to 1753 conditions per place. [2024-02-20 11:38:24,821 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 512 selfloop transitions, 57 changer transitions 8/578 dead transitions. [2024-02-20 11:38:24,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 578 transitions, 8407 flow [2024-02-20 11:38:24,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:38:24,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:38:24,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2024-02-20 11:38:24,823 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6387096774193548 [2024-02-20 11:38:24,824 INFO L308 CegarLoopForPetriNet]: 35 programPoint places, 22 predicate places. [2024-02-20 11:38:24,824 INFO L507 AbstractCegarLoop]: Abstraction has has 57 places, 578 transitions, 8407 flow [2024-02-20 11:38:24,824 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:38:24,825 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:38:24,825 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:38:24,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-02-20 11:38:25,047 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-02-20 11:38:25,048 INFO L432 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-20 11:38:25,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:38:25,049 INFO L85 PathProgramCache]: Analyzing trace with hash -776103165, now seen corresponding path program 2 times [2024-02-20 11:38:25,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:38:25,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080427891] [2024-02-20 11:38:25,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:38:25,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:38:25,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:38:25,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:38:25,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:38:25,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080427891] [2024-02-20 11:38:25,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080427891] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:38:25,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:38:25,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 11:38:25,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385666078] [2024-02-20 11:38:25,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:38:25,132 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:38:25,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:38:25,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:38:25,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:38:25,134 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-20 11:38:25,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 578 transitions, 8407 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-02-20 11:38:25,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:38:25,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-20 11:38:25,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:38:25,547 INFO L124 PetriNetUnfolderBase]: 1611/2236 cut-off events. [2024-02-20 11:38:25,547 INFO L125 PetriNetUnfolderBase]: For 363/363 co-relation queries the response was YES. [2024-02-20 11:38:25,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18091 conditions, 2236 events. 1611/2236 cut-off events. For 363/363 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8343 event pairs, 6 based on Foata normal form. 0/1554 useless extension candidates. Maximal degree in co-relation 17026. Up to 2025 conditions per place. [2024-02-20 11:38:25,580 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 628 selfloop transitions, 49 changer transitions 8/686 dead transitions. [2024-02-20 11:38:25,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 686 transitions, 11325 flow [2024-02-20 11:38:25,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:38:25,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:38:25,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2024-02-20 11:38:25,582 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-02-20 11:38:25,583 INFO L308 CegarLoopForPetriNet]: 35 programPoint places, 26 predicate places. [2024-02-20 11:38:25,583 INFO L507 AbstractCegarLoop]: Abstraction has has 61 places, 686 transitions, 11325 flow [2024-02-20 11:38:25,583 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-02-20 11:38:25,583 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:38:25,584 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:38:25,584 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-20 11:38:25,584 INFO L432 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-20 11:38:25,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:38:25,585 INFO L85 PathProgramCache]: Analyzing trace with hash -267623333, now seen corresponding path program 2 times [2024-02-20 11:38:25,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:38:25,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326697746] [2024-02-20 11:38:25,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:38:25,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:38:25,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:38:25,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:38:25,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:38:25,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326697746] [2024-02-20 11:38:25,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326697746] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:38:25,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:38:25,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 11:38:25,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993648065] [2024-02-20 11:38:25,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:38:25,675 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:38:25,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:38:25,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:38:25,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:38:25,676 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-20 11:38:25,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 686 transitions, 11325 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-02-20 11:38:25,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:38:25,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-20 11:38:25,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:38:26,084 INFO L124 PetriNetUnfolderBase]: 1441/1988 cut-off events. [2024-02-20 11:38:26,084 INFO L125 PetriNetUnfolderBase]: For 319/319 co-relation queries the response was YES. [2024-02-20 11:38:26,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18089 conditions, 1988 events. 1441/1988 cut-off events. For 319/319 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7140 event pairs, 6 based on Foata normal form. 0/1406 useless extension candidates. Maximal degree in co-relation 16976. Up to 1779 conditions per place. [2024-02-20 11:38:26,108 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 596 selfloop transitions, 55 changer transitions 18/670 dead transitions. [2024-02-20 11:38:26,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 670 transitions, 12395 flow [2024-02-20 11:38:26,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:38:26,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:38:26,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2024-02-20 11:38:26,110 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6193548387096774 [2024-02-20 11:38:26,110 INFO L308 CegarLoopForPetriNet]: 35 programPoint places, 30 predicate places. [2024-02-20 11:38:26,110 INFO L507 AbstractCegarLoop]: Abstraction has has 65 places, 670 transitions, 12395 flow [2024-02-20 11:38:26,111 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-02-20 11:38:26,111 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:38:26,111 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:38:26,111 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-20 11:38:26,111 INFO L432 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-20 11:38:26,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:38:26,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1558531671, now seen corresponding path program 2 times [2024-02-20 11:38:26,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:38:26,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827742902] [2024-02-20 11:38:26,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:38:26,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:38:26,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:38:26,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:38:26,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:38:26,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827742902] [2024-02-20 11:38:26,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827742902] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:38:26,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:38:26,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 11:38:26,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369620559] [2024-02-20 11:38:26,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:38:26,178 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:38:26,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:38:26,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:38:26,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:38:26,179 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-20 11:38:26,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 670 transitions, 12395 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-02-20 11:38:26,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:38:26,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-20 11:38:26,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:38:26,630 INFO L124 PetriNetUnfolderBase]: 1657/2272 cut-off events. [2024-02-20 11:38:26,630 INFO L125 PetriNetUnfolderBase]: For 331/331 co-relation queries the response was YES. [2024-02-20 11:38:26,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22935 conditions, 2272 events. 1657/2272 cut-off events. For 331/331 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8281 event pairs, 6 based on Foata normal form. 0/1616 useless extension candidates. Maximal degree in co-relation 21580. Up to 2063 conditions per place. [2024-02-20 11:38:26,655 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 724 selfloop transitions, 51 changer transitions 18/794 dead transitions. [2024-02-20 11:38:26,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 794 transitions, 16243 flow [2024-02-20 11:38:26,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:38:26,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:38:26,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2024-02-20 11:38:26,657 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6258064516129033 [2024-02-20 11:38:26,658 INFO L308 CegarLoopForPetriNet]: 35 programPoint places, 34 predicate places. [2024-02-20 11:38:26,658 INFO L507 AbstractCegarLoop]: Abstraction has has 69 places, 794 transitions, 16243 flow [2024-02-20 11:38:26,658 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-02-20 11:38:26,658 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:38:26,659 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:38:26,659 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-20 11:38:26,659 INFO L432 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-20 11:38:26,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:38:26,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1110767683, now seen corresponding path program 1 times [2024-02-20 11:38:26,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:38:26,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131428448] [2024-02-20 11:38:26,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:38:26,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:38:26,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:38:27,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:38:27,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:38:27,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131428448] [2024-02-20 11:38:27,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131428448] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:38:27,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442135149] [2024-02-20 11:38:27,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:38:27,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:38:27,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:38:27,124 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-20 11:38:27,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-02-20 11:38:27,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:38:27,262 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-20 11:38:27,264 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:39:56,381 WARN L293 SmtUtils]: Spent 13.03s on a formula simplification. DAG size of input: 34 DAG size of output: 33 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-20 11:41:00,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:41:00,700 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:41:30,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:41:30,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442135149] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:41:30,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:41:30,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2024-02-20 11:41:30,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599017917] [2024-02-20 11:41:30,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:41:30,437 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-02-20 11:41:30,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:41:30,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-02-20 11:41:30,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=167, Unknown=17, NotChecked=0, Total=240 [2024-02-20 11:41:30,438 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-20 11:41:30,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 794 transitions, 16243 flow. Second operand has 16 states, 16 states have (on average 8.8125) internal successors, (141), 16 states have internal predecessors, (141), 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-02-20 11:41:30,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:41:30,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-20 11:41:30,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:41:37,691 WARN L293 SmtUtils]: Spent 6.33s on a formula simplification. DAG size of input: 71 DAG size of output: 42 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-20 11:41:40,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:41:57,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:41:59,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:42:03,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:42:07,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:42:11,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:42:21,806 WARN L293 SmtUtils]: Spent 10.23s on a formula simplification. DAG size of input: 52 DAG size of output: 39 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-20 11:42:26,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:42:42,518 WARN L293 SmtUtils]: Spent 12.07s on a formula simplification. DAG size of input: 40 DAG size of output: 35 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-20 11:42:46,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 11:42:47,655 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-02-20 11:42:51,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:42:58,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:43:02,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:43:07,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 11:43:11,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:43:15,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:43:17,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:43:20,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 11:43:25,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:43:36,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 11:43:39,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.93s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:43:43,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:43:48,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 11:43:50,542 INFO L124 PetriNetUnfolderBase]: 3446/4798 cut-off events. [2024-02-20 11:43:50,542 INFO L125 PetriNetUnfolderBase]: For 732/732 co-relation queries the response was YES. [2024-02-20 11:43:50,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53283 conditions, 4798 events. 3446/4798 cut-off events. For 732/732 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 20794 event pairs, 18 based on Foata normal form. 3/3435 useless extension candidates. Maximal degree in co-relation 49330. Up to 4586 conditions per place. [2024-02-20 11:43:50,598 INFO L140 encePairwiseOnDemand]: 14/31 looper letters, 1293 selfloop transitions, 226 changer transitions 96/1616 dead transitions. [2024-02-20 11:43:50,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 1616 transitions, 36456 flow [2024-02-20 11:43:50,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-02-20 11:43:50,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-02-20 11:43:50,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 357 transitions. [2024-02-20 11:43:50,601 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6774193548387096 [2024-02-20 11:43:50,601 INFO L308 CegarLoopForPetriNet]: 35 programPoint places, 50 predicate places. [2024-02-20 11:43:50,602 INFO L507 AbstractCegarLoop]: Abstraction has has 85 places, 1616 transitions, 36456 flow [2024-02-20 11:43:50,602 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.8125) internal successors, (141), 16 states have internal predecessors, (141), 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-02-20 11:43:50,602 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:43:50,602 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:43:50,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-02-20 11:43:50,812 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-02-20 11:43:50,812 INFO L432 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-20 11:43:50,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:43:50,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1029290883, now seen corresponding path program 1 times [2024-02-20 11:43:50,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:43:50,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268469387] [2024-02-20 11:43:50,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:43:50,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:43:50,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:43:51,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:43:51,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:43:51,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268469387] [2024-02-20 11:43:51,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268469387] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:43:51,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733022798] [2024-02-20 11:43:51,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:43:51,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:43:51,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:43:51,401 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-20 11:43:51,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-02-20 11:43:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:43:51,759 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-20 11:43:51,761 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:43:57,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:43:57,898 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:43:58,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:43:58,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733022798] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:43:58,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:43:58,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2024-02-20 11:43:58,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052801846] [2024-02-20 11:43:58,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:43:58,622 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-02-20 11:43:58,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:43:58,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-02-20 11:43:58,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-02-20 11:43:58,623 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-20 11:43:58,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 1616 transitions, 36456 flow. Second operand has 16 states, 16 states have (on average 9.1875) internal successors, (147), 16 states have internal predecessors, (147), 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-02-20 11:43:58,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:43:58,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-20 11:43:58,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:44:04,041 INFO L124 PetriNetUnfolderBase]: 4914/6842 cut-off events. [2024-02-20 11:44:04,041 INFO L125 PetriNetUnfolderBase]: For 1056/1056 co-relation queries the response was YES. [2024-02-20 11:44:04,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82743 conditions, 6842 events. 4914/6842 cut-off events. For 1056/1056 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 31602 event pairs, 18 based on Foata normal form. 3/4899 useless extension candidates. Maximal degree in co-relation 77713. Up to 6627 conditions per place. [2024-02-20 11:44:04,103 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 1923 selfloop transitions, 247 changer transitions 164/2335 dead transitions. [2024-02-20 11:44:04,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 2335 transitions, 57272 flow [2024-02-20 11:44:04,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-02-20 11:44:04,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-02-20 11:44:04,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 318 transitions. [2024-02-20 11:44:04,106 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6411290322580645 [2024-02-20 11:44:04,106 INFO L308 CegarLoopForPetriNet]: 35 programPoint places, 65 predicate places. [2024-02-20 11:44:04,106 INFO L507 AbstractCegarLoop]: Abstraction has has 100 places, 2335 transitions, 57272 flow [2024-02-20 11:44:04,106 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.1875) internal successors, (147), 16 states have internal predecessors, (147), 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-02-20 11:44:04,107 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:44:04,107 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:44:04,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-02-20 11:44:04,320 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:44:04,321 INFO L432 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-20 11:44:04,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:44:04,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1799866051, now seen corresponding path program 2 times [2024-02-20 11:44:04,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:44:04,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528188089] [2024-02-20 11:44:04,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:44:04,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:44:04,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:44:04,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:44:04,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:44:04,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528188089] [2024-02-20 11:44:04,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528188089] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:44:04,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732997498] [2024-02-20 11:44:04,761 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-20 11:44:04,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:44:04,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:44:04,764 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-20 11:44:04,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-02-20 11:44:04,981 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-20 11:44:04,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:44:04,982 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-20 11:44:04,983 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:45:21,771 WARN L293 SmtUtils]: Spent 12.08s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-20 11:46:10,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:46:10,950 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:46:48,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:46:48,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732997498] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:46:48,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:46:48,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2024-02-20 11:46:48,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787753335] [2024-02-20 11:46:48,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:46:48,544 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-02-20 11:46:48,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:46:48,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-02-20 11:46:48,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=171, Unknown=20, NotChecked=0, Total=240 [2024-02-20 11:46:48,545 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-20 11:46:48,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 2335 transitions, 57272 flow. Second operand has 16 states, 16 states have (on average 9.0625) internal successors, (145), 16 states have internal predecessors, (145), 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-02-20 11:46:48,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:46:48,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-20 11:46:48,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:47:08,920 WARN L293 SmtUtils]: Spent 7.22s on a formula simplification. DAG size of input: 75 DAG size of output: 34 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-20 11:47:15,159 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (* 4294967296 (div c_~n~0 4294967296))) (.cse5 (* (div c_~x4~0 4294967296) 4294967296)) (.cse9 (* c_~x3~0 2)) (.cse3 (* (- 1) c_~x4~0))) (let ((.cse1 (mod c_~n~0 4294967296)) (.cse0 (mod c_~x1~0 4294967296)) (.cse8 (* (div (+ .cse9 .cse3) 4294967296) 4294967296)) (.cse2 (mod c_~x4~0 4294967296)) (.cse11 (+ .cse9 .cse5)) (.cse6 (= (+ c_~x1~0 (* (div c_~x2~0 4294967296) 4294967296)) (+ (* 4294967296 (div c_~x1~0 4294967296)) c_~x2~0))) (.cse4 (mod c_~x3~0 4294967296)) (.cse7 (+ .cse9 .cse10))) (and (= .cse0 (mod c_~x2~0 4294967296)) (<= .cse1 .cse2) (= (mod (* (div .cse3 2) 4294967295) 4294967296) .cse4) (or (and (= (+ (* 4294967296 (div c_~x3~0 4294967296)) c_~x4~0) (+ c_~x3~0 .cse5)) .cse6) (< .cse4 .cse1)) (<= 1 .cse0) (<= .cse7 (+ c_~n~0 .cse8 .cse5 4294967293)) .cse6 (<= (+ .cse9 2 .cse10) (+ c_~n~0 .cse8 c_~x4~0)) (<= .cse11 (+ (* (div (+ (- 1) c_~x3~0 (* (div (+ (- 1) c_~x3~0) 2147483648) 2147483648)) 4294967296) 4294967296) c_~x4~0)) (<= 1 .cse4) (= (mod c_~x4~0 2) 0) (let ((.cse12 (+ .cse4 1))) (or (< .cse2 .cse12) (< (* 2 (mod c_~x3~0 2147483648)) .cse12) (and (= (+ (* 4294967296 (div c_~x3~0 2147483648)) c_~x4~0) .cse11) .cse6))) (<= .cse7 (+ (* 4294967296 (div (+ (- 1) c_~x3~0 (* (div (+ (- 1) c_~x3~0 .cse3 c_~n~0) 2147483648) 2147483648)) 4294967296)) c_~x4~0))))) is different from false [2024-02-20 11:47:19,896 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (* 4294967296 (div c_~x3~0 4294967296)))) (let ((.cse1 (mod c_~n~0 4294967296)) (.cse0 (mod c_~x1~0 4294967296)) (.cse2 (mod (* 4294967295 (div (* (- 1) c_~x3~0) 2)) 4294967296)) (.cse5 (+ c_~x3~0 (* (div c_~x4~0 4294967296) 4294967296))) (.cse4 (+ .cse3 c_~x4~0))) (and (= .cse0 (mod c_~x2~0 4294967296)) (<= .cse1 (mod c_~x4~0 4294967296)) (<= (+ .cse2 1) .cse1) (<= 1 .cse0) (= (+ c_~x1~0 (* (div c_~x2~0 4294967296) 4294967296)) (+ (* 4294967296 (div c_~x1~0 4294967296)) c_~x2~0)) (or (< (+ c_~x3~0 2 (* 4294967296 (div c_~n~0 4294967296))) (+ .cse3 c_~n~0)) (= .cse4 .cse5)) (= .cse2 (mod (* (div (* (- 1) c_~x4~0) 2) 4294967295) 4294967296)) (= (mod c_~x4~0 2) 0) (<= 1 .cse2) (<= .cse5 .cse4) (= (mod c_~x3~0 2) 0)))) is different from false [2024-02-20 11:47:24,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:47:32,906 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification. DAG size of input: 64 DAG size of output: 46 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-20 11:47:37,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 11:47:43,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 11:47:44,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:47:46,497 INFO L124 PetriNetUnfolderBase]: 7000/9937 cut-off events. [2024-02-20 11:47:46,497 INFO L125 PetriNetUnfolderBase]: For 1553/1553 co-relation queries the response was YES. [2024-02-20 11:47:46,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129994 conditions, 9937 events. 7000/9937 cut-off events. For 1553/1553 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 50892 event pairs, 18 based on Foata normal form. 3/7110 useless extension candidates. Maximal degree in co-relation 122770. Up to 9712 conditions per place. [2024-02-20 11:47:46,662 INFO L140 encePairwiseOnDemand]: 16/31 looper letters, 2640 selfloop transitions, 571 changer transitions 265/3477 dead transitions. [2024-02-20 11:47:46,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 3477 transitions, 92223 flow [2024-02-20 11:47:46,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-02-20 11:47:46,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-02-20 11:47:46,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 376 transitions. [2024-02-20 11:47:46,665 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6383701188455009 [2024-02-20 11:47:46,666 INFO L308 CegarLoopForPetriNet]: 35 programPoint places, 83 predicate places. [2024-02-20 11:47:46,666 INFO L507 AbstractCegarLoop]: Abstraction has has 118 places, 3477 transitions, 92223 flow [2024-02-20 11:47:46,666 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.0625) internal successors, (145), 16 states have internal predecessors, (145), 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-02-20 11:47:46,666 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:47:46,667 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:47:46,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-02-20 11:47:46,880 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:47:46,881 INFO L432 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-20 11:47:46,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:47:46,881 INFO L85 PathProgramCache]: Analyzing trace with hash 546245105, now seen corresponding path program 3 times [2024-02-20 11:47:46,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:47:46,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786435632] [2024-02-20 11:47:46,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:47:46,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:47:46,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:47:47,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:47:47,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:47:47,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786435632] [2024-02-20 11:47:47,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786435632] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:47:47,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565523960] [2024-02-20 11:47:47,345 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-20 11:47:47,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:47:47,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:47:47,348 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-20 11:47:47,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-02-20 11:47:47,483 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-02-20 11:47:47,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:47:47,485 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-20 11:47:47,486 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:49:04,867 WARN L293 SmtUtils]: Spent 12.18s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-20 11:49:47,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:49:47,211 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:50:31,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:50:31,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565523960] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:50:31,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:50:31,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2024-02-20 11:50:31,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573836854] [2024-02-20 11:50:31,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:50:31,860 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-02-20 11:50:31,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:50:31,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-02-20 11:50:31,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=172, Unknown=20, NotChecked=0, Total=240 [2024-02-20 11:50:31,861 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-20 11:50:31,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 3477 transitions, 92223 flow. Second operand has 16 states, 16 states have (on average 9.0625) internal successors, (145), 16 states have internal predecessors, (145), 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-02-20 11:50:31,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:50:31,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-20 11:50:31,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:51:26,381 WARN L293 SmtUtils]: Spent 52.19s on a formula simplification. DAG size of input: 78 DAG size of output: 45 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-20 11:51:31,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:51:36,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:51:40,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:51:44,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 11:51:48,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.58s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:51:56,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:52:17,906 WARN L293 SmtUtils]: Spent 9.30s on a formula simplification. DAG size of input: 87 DAG size of output: 39 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-20 11:52:27,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:52:32,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:52:33,492 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-02-20 11:52:38,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:52:41,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:52:43,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Killed by 15