./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a340643f 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-exp3x3-opt.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 df63a9317cd159d15f0c87211084d5e90c66afa781f3187352107d14a3f61024 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 15:14:54,772 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 15:14:54,854 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 15:14:54,860 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 15:14:54,861 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 15:14:54,907 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 15:14:54,908 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 15:14:54,908 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 15:14:54,909 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 15:14:54,913 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 15:14:54,913 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 15:14:54,913 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 15:14:54,914 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 15:14:54,915 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 15:14:54,915 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 15:14:54,916 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 15:14:54,916 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 15:14:54,916 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 15:14:54,917 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 15:14:54,917 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 15:14:54,917 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 15:14:54,917 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 15:14:54,918 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 15:14:54,918 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 15:14:54,918 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 15:14:54,918 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 15:14:54,919 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 15:14:54,919 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 15:14:54,920 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 15:14:54,920 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 15:14:54,921 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 15:14:54,921 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 15:14:54,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:14:54,921 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 15:14:54,922 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 15:14:54,922 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 15:14:54,922 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 15:14:54,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 15:14:54,922 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 15:14:54,923 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 15:14:54,923 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 15:14:54,923 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 15:14:54,923 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 15:14:54,923 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 -> df63a9317cd159d15f0c87211084d5e90c66afa781f3187352107d14a3f61024 [2024-01-27 15:14:55,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 15:14:55,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 15:14:55,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 15:14:55,294 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 15:14:55,295 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 15:14:55,296 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c [2024-01-27 15:14:56,490 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 15:14:56,705 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 15:14:56,706 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c [2024-01-27 15:14:56,714 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91b8b9f75/531e39fc41ed49ca8b315fec6b116cd4/FLAGd2f2572d3 [2024-01-27 15:14:56,725 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91b8b9f75/531e39fc41ed49ca8b315fec6b116cd4 [2024-01-27 15:14:56,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 15:14:56,729 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 15:14:56,730 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 15:14:56,731 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 15:14:56,737 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 15:14:56,738 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:14:56" (1/1) ... [2024-01-27 15:14:56,739 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cbffb94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:14:56, skipping insertion in model container [2024-01-27 15:14:56,739 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:14:56" (1/1) ... [2024-01-27 15:14:56,760 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 15:14:56,943 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-exp3x3-opt.wvr.c[2904,2917] [2024-01-27 15:14:56,959 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:14:56,974 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 15:14:57,017 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-exp3x3-opt.wvr.c[2904,2917] [2024-01-27 15:14:57,018 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:14:57,032 INFO L206 MainTranslator]: Completed translation [2024-01-27 15:14:57,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:14:57 WrapperNode [2024-01-27 15:14:57,034 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 15:14:57,035 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 15:14:57,036 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 15:14:57,036 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 15:14:57,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:14:57" (1/1) ... [2024-01-27 15:14:57,067 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:14:57" (1/1) ... [2024-01-27 15:14:57,102 INFO L138 Inliner]: procedures = 25, calls = 44, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 131 [2024-01-27 15:14:57,103 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 15:14:57,103 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 15:14:57,103 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 15:14:57,103 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 15:14:57,114 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:14:57" (1/1) ... [2024-01-27 15:14:57,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:14:57" (1/1) ... [2024-01-27 15:14:57,129 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:14:57" (1/1) ... [2024-01-27 15:14:57,155 INFO L175 MemorySlicer]: Split 14 memory accesses to 7 slices as follows [2, 2, 2, 2, 2, 2, 2]. 14 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0, 0]. The 6 writes are split as follows [0, 1, 1, 1, 1, 1, 1]. [2024-01-27 15:14:57,155 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:14:57" (1/1) ... [2024-01-27 15:14:57,155 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:14:57" (1/1) ... [2024-01-27 15:14:57,161 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:14:57" (1/1) ... [2024-01-27 15:14:57,165 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:14:57" (1/1) ... [2024-01-27 15:14:57,168 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:14:57" (1/1) ... [2024-01-27 15:14:57,170 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:14:57" (1/1) ... [2024-01-27 15:14:57,173 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 15:14:57,174 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 15:14:57,174 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 15:14:57,174 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 15:14:57,175 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:14:57" (1/1) ... [2024-01-27 15:14:57,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:14:57,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:14:57,213 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-01-27 15:14:57,251 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-01-27 15:14:57,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 15:14:57,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 15:14:57,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 15:14:57,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 15:14:57,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 15:14:57,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-01-27 15:14:57,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-01-27 15:14:57,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-01-27 15:14:57,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-01-27 15:14:57,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 15:14:57,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 15:14:57,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 15:14:57,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-01-27 15:14:57,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-01-27 15:14:57,285 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-01-27 15:14:57,286 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-01-27 15:14:57,286 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 15:14:57,286 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 15:14:57,286 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 15:14:57,287 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 15:14:57,287 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-01-27 15:14:57,287 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-01-27 15:14:57,288 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-01-27 15:14:57,288 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-01-27 15:14:57,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 15:14:57,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 15:14:57,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 15:14:57,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-01-27 15:14:57,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-01-27 15:14:57,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-01-27 15:14:57,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-01-27 15:14:57,290 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2024-01-27 15:14:57,290 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2024-01-27 15:14:57,290 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2024-01-27 15:14:57,291 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2024-01-27 15:14:57,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 15:14:57,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 15:14:57,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 15:14:57,293 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 15:14:57,474 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 15:14:57,476 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 15:14:57,717 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 15:14:57,718 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 15:14:57,946 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 15:14:57,947 INFO L320 CfgBuilder]: Removed 6 assume(true) statements. [2024-01-27 15:14:57,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:14:57 BoogieIcfgContainer [2024-01-27 15:14:57,947 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 15:14:57,949 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 15:14:57,949 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 15:14:57,952 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 15:14:57,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 03:14:56" (1/3) ... [2024-01-27 15:14:57,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c777709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:14:57, skipping insertion in model container [2024-01-27 15:14:57,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:14:57" (2/3) ... [2024-01-27 15:14:57,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c777709 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:14:57, skipping insertion in model container [2024-01-27 15:14:57,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:14:57" (3/3) ... [2024-01-27 15:14:57,956 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp3x3-opt.wvr.c [2024-01-27 15:14:57,964 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 15:14:57,972 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 15:14:57,972 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-27 15:14:57,972 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 15:14:58,060 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2024-01-27 15:14:58,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 51 transitions, 144 flow [2024-01-27 15:14:58,178 INFO L124 PetriNetUnfolderBase]: 6/45 cut-off events. [2024-01-27 15:14:58,179 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-01-27 15:14:58,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 45 events. 6/45 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 33 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2024-01-27 15:14:58,185 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 51 transitions, 144 flow [2024-01-27 15:14:58,189 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 44 transitions, 124 flow [2024-01-27 15:14:58,220 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 15:14:58,226 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@66b954b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 15:14:58,226 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-01-27 15:14:58,243 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 15:14:58,243 INFO L124 PetriNetUnfolderBase]: 6/43 cut-off events. [2024-01-27 15:14:58,243 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-01-27 15:14:58,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:14:58,244 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:14:58,245 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 15:14:58,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:14:58,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1009835643, now seen corresponding path program 1 times [2024-01-27 15:14:58,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:14:58,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646389737] [2024-01-27 15:14:58,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:14:58,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:14:58,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:14:58,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:14:58,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:14:58,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646389737] [2024-01-27 15:14:58,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646389737] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:14:58,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:14:58,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 15:14:58,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521001893] [2024-01-27 15:14:58,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:14:58,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:14:58,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:14:58,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:14:58,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:14:58,917 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-01-27 15:14:58,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-01-27 15:14:58,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:14:58,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-01-27 15:14:58,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:15:01,412 INFO L124 PetriNetUnfolderBase]: 24533/28583 cut-off events. [2024-01-27 15:15:01,412 INFO L125 PetriNetUnfolderBase]: For 1331/1331 co-relation queries the response was YES. [2024-01-27 15:15:01,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58276 conditions, 28583 events. 24533/28583 cut-off events. For 1331/1331 co-relation queries the response was YES. Maximal size of possible extension queue 940. Compared 101035 event pairs, 4426 based on Foata normal form. 1/15580 useless extension candidates. Maximal degree in co-relation 44796. Up to 18741 conditions per place. [2024-01-27 15:15:01,674 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 59 selfloop transitions, 3 changer transitions 1/70 dead transitions. [2024-01-27 15:15:01,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 70 transitions, 323 flow [2024-01-27 15:15:01,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:15:01,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:15:01,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2024-01-27 15:15:01,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.673202614379085 [2024-01-27 15:15:01,692 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 124 flow. Second operand 3 states and 103 transitions. [2024-01-27 15:15:01,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 70 transitions, 323 flow [2024-01-27 15:15:01,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 70 transitions, 285 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-01-27 15:15:01,740 INFO L231 Difference]: Finished difference. Result has 48 places, 46 transitions, 119 flow [2024-01-27 15:15:01,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=48, PETRI_TRANSITIONS=46} [2024-01-27 15:15:01,747 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, -9 predicate places. [2024-01-27 15:15:01,748 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 46 transitions, 119 flow [2024-01-27 15:15:01,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-01-27 15:15:01,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:15:01,749 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:15:01,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 15:15:01,750 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 15:15:01,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:15:01,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1685349170, now seen corresponding path program 1 times [2024-01-27 15:15:01,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:15:01,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975143477] [2024-01-27 15:15:01,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:15:01,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:15:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:15:01,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:15:01,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:15:01,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975143477] [2024-01-27 15:15:01,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975143477] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:15:01,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:15:01,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 15:15:01,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279772417] [2024-01-27 15:15:01,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:15:01,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:15:01,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:15:01,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:15:01,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:15:01,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-01-27 15:15:01,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 46 transitions, 119 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:15:01,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:15:01,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-01-27 15:15:01,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:15:04,580 INFO L124 PetriNetUnfolderBase]: 33457/39075 cut-off events. [2024-01-27 15:15:04,580 INFO L125 PetriNetUnfolderBase]: For 5276/5276 co-relation queries the response was YES. [2024-01-27 15:15:04,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85625 conditions, 39075 events. 33457/39075 cut-off events. For 5276/5276 co-relation queries the response was YES. Maximal size of possible extension queue 1254. Compared 148216 event pairs, 5731 based on Foata normal form. 1/26720 useless extension candidates. Maximal degree in co-relation 26650. Up to 27052 conditions per place. [2024-01-27 15:15:04,858 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 63 selfloop transitions, 3 changer transitions 9/82 dead transitions. [2024-01-27 15:15:04,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 82 transitions, 362 flow [2024-01-27 15:15:04,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:15:04,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:15:04,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2024-01-27 15:15:04,863 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7254901960784313 [2024-01-27 15:15:04,863 INFO L175 Difference]: Start difference. First operand has 48 places, 46 transitions, 119 flow. Second operand 3 states and 111 transitions. [2024-01-27 15:15:04,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 82 transitions, 362 flow [2024-01-27 15:15:04,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 82 transitions, 357 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 15:15:04,873 INFO L231 Difference]: Finished difference. Result has 50 places, 48 transitions, 135 flow [2024-01-27 15:15:04,873 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=50, PETRI_TRANSITIONS=48} [2024-01-27 15:15:04,874 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, -7 predicate places. [2024-01-27 15:15:04,874 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 48 transitions, 135 flow [2024-01-27 15:15:04,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:15:04,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:15:04,875 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:15:04,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 15:15:04,875 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 15:15:04,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:15:04,876 INFO L85 PathProgramCache]: Analyzing trace with hash 2075634054, now seen corresponding path program 1 times [2024-01-27 15:15:04,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:15:04,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064910063] [2024-01-27 15:15:04,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:15:04,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:15:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:15:05,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:15:05,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:15:05,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064910063] [2024-01-27 15:15:05,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064910063] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:15:05,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:15:05,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 15:15:05,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405821744] [2024-01-27 15:15:05,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:15:05,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:15:05,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:15:05,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:15:05,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:15:05,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-01-27 15:15:05,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 48 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 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-01-27 15:15:05,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:15:05,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-01-27 15:15:05,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:15:08,018 INFO L124 PetriNetUnfolderBase]: 42571/50180 cut-off events. [2024-01-27 15:15:08,019 INFO L125 PetriNetUnfolderBase]: For 14213/14213 co-relation queries the response was YES. [2024-01-27 15:15:08,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116808 conditions, 50180 events. 42571/50180 cut-off events. For 14213/14213 co-relation queries the response was YES. Maximal size of possible extension queue 1681. Compared 201565 event pairs, 6874 based on Foata normal form. 1/41482 useless extension candidates. Maximal degree in co-relation 48426. Up to 36442 conditions per place. [2024-01-27 15:15:08,278 INFO L140 encePairwiseOnDemand]: 47/51 looper letters, 67 selfloop transitions, 3 changer transitions 5/82 dead transitions. [2024-01-27 15:15:08,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 82 transitions, 380 flow [2024-01-27 15:15:08,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:15:08,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:15:08,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2024-01-27 15:15:08,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6993464052287581 [2024-01-27 15:15:08,281 INFO L175 Difference]: Start difference. First operand has 50 places, 48 transitions, 135 flow. Second operand 3 states and 107 transitions. [2024-01-27 15:15:08,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 82 transitions, 380 flow [2024-01-27 15:15:08,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 82 transitions, 375 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 15:15:08,285 INFO L231 Difference]: Finished difference. Result has 52 places, 50 transitions, 151 flow [2024-01-27 15:15:08,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=151, PETRI_PLACES=52, PETRI_TRANSITIONS=50} [2024-01-27 15:15:08,286 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, -5 predicate places. [2024-01-27 15:15:08,286 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 50 transitions, 151 flow [2024-01-27 15:15:08,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 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-01-27 15:15:08,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:15:08,287 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:15:08,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 15:15:08,288 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 15:15:08,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:15:08,288 INFO L85 PathProgramCache]: Analyzing trace with hash -909273287, now seen corresponding path program 1 times [2024-01-27 15:15:08,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:15:08,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279847537] [2024-01-27 15:15:08,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:15:08,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:15:08,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:15:08,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:15:08,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:15:08,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279847537] [2024-01-27 15:15:08,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279847537] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:15:08,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414935437] [2024-01-27 15:15:08,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:15:08,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:15:08,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:15:08,464 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-01-27 15:15:08,476 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-01-27 15:15:08,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:15:08,605 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 3 conjunts are in the unsatisfiable core [2024-01-27 15:15:08,611 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:15:08,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:15:08,729 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:15:08,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:15:08,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414935437] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:15:08,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:15:08,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2024-01-27 15:15:08,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477757864] [2024-01-27 15:15:08,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:15:08,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:15:08,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:15:08,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:15:08,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-01-27 15:15:08,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-01-27 15:15:08,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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-01-27 15:15:08,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:15:08,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-01-27 15:15:08,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:15:12,073 INFO L124 PetriNetUnfolderBase]: 48377/57563 cut-off events. [2024-01-27 15:15:12,073 INFO L125 PetriNetUnfolderBase]: For 22080/22080 co-relation queries the response was YES. [2024-01-27 15:15:12,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144391 conditions, 57563 events. 48377/57563 cut-off events. For 22080/22080 co-relation queries the response was YES. Maximal size of possible extension queue 1926. Compared 247996 event pairs, 7315 based on Foata normal form. 1125/58288 useless extension candidates. Maximal degree in co-relation 46330. Up to 26288 conditions per place. [2024-01-27 15:15:12,362 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 113 selfloop transitions, 6 changer transitions 19/145 dead transitions. [2024-01-27 15:15:12,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 145 transitions, 703 flow [2024-01-27 15:15:12,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:15:12,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:15:12,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 190 transitions. [2024-01-27 15:15:12,365 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7450980392156863 [2024-01-27 15:15:12,365 INFO L175 Difference]: Start difference. First operand has 52 places, 50 transitions, 151 flow. Second operand 5 states and 190 transitions. [2024-01-27 15:15:12,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 145 transitions, 703 flow [2024-01-27 15:15:12,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 145 transitions, 694 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 15:15:12,372 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 185 flow [2024-01-27 15:15:12,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=185, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2024-01-27 15:15:12,374 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 0 predicate places. [2024-01-27 15:15:12,375 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 185 flow [2024-01-27 15:15:12,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 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-01-27 15:15:12,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:15:12,376 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:15:12,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-01-27 15:15:12,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:15:12,593 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 15:15:12,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:15:12,593 INFO L85 PathProgramCache]: Analyzing trace with hash -2023366673, now seen corresponding path program 1 times [2024-01-27 15:15:12,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:15:12,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448247383] [2024-01-27 15:15:12,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:15:12,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:15:12,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:15:12,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:15:12,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:15:12,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448247383] [2024-01-27 15:15:12,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448247383] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:15:12,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:15:12,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:15:12,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526736084] [2024-01-27 15:15:12,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:15:12,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:15:12,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:15:12,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:15:12,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:15:12,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-01-27 15:15:12,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 185 flow. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:15:12,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:15:12,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-01-27 15:15:12,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:15:16,387 INFO L124 PetriNetUnfolderBase]: 48167/57238 cut-off events. [2024-01-27 15:15:16,388 INFO L125 PetriNetUnfolderBase]: For 35731/35731 co-relation queries the response was YES. [2024-01-27 15:15:16,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155080 conditions, 57238 events. 48167/57238 cut-off events. For 35731/35731 co-relation queries the response was YES. Maximal size of possible extension queue 1888. Compared 244346 event pairs, 1126 based on Foata normal form. 706/57844 useless extension candidates. Maximal degree in co-relation 56050. Up to 22511 conditions per place. [2024-01-27 15:15:16,612 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 90 selfloop transitions, 4 changer transitions 40/141 dead transitions. [2024-01-27 15:15:16,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 141 transitions, 723 flow [2024-01-27 15:15:16,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:15:16,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:15:16,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 180 transitions. [2024-01-27 15:15:16,614 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7058823529411765 [2024-01-27 15:15:16,614 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 185 flow. Second operand 5 states and 180 transitions. [2024-01-27 15:15:16,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 141 transitions, 723 flow [2024-01-27 15:15:16,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 141 transitions, 717 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-01-27 15:15:16,862 INFO L231 Difference]: Finished difference. Result has 61 places, 53 transitions, 193 flow [2024-01-27 15:15:16,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=193, PETRI_PLACES=61, PETRI_TRANSITIONS=53} [2024-01-27 15:15:16,863 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 4 predicate places. [2024-01-27 15:15:16,863 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 53 transitions, 193 flow [2024-01-27 15:15:16,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:15:16,864 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:15:16,864 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:15:16,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 15:15:16,864 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 15:15:16,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:15:16,865 INFO L85 PathProgramCache]: Analyzing trace with hash -43282031, now seen corresponding path program 2 times [2024-01-27 15:15:16,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:15:16,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690286155] [2024-01-27 15:15:16,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:15:16,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:15:16,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:15:16,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:15:16,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:15:16,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690286155] [2024-01-27 15:15:16,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690286155] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:15:16,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:15:16,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:15:16,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869755794] [2024-01-27 15:15:16,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:15:16,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:15:16,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:15:16,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:15:16,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:15:16,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-01-27 15:15:16,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 53 transitions, 193 flow. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:15:16,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:15:16,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-01-27 15:15:16,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:15:18,978 INFO L124 PetriNetUnfolderBase]: 32115/38228 cut-off events. [2024-01-27 15:15:18,978 INFO L125 PetriNetUnfolderBase]: For 41162/41166 co-relation queries the response was YES. [2024-01-27 15:15:19,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111974 conditions, 38228 events. 32115/38228 cut-off events. For 41162/41166 co-relation queries the response was YES. Maximal size of possible extension queue 1294. Compared 156003 event pairs, 4379 based on Foata normal form. 830/38684 useless extension candidates. Maximal degree in co-relation 54571. Up to 18656 conditions per place. [2024-01-27 15:15:19,168 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 125 selfloop transitions, 6 changer transitions 11/149 dead transitions. [2024-01-27 15:15:19,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 149 transitions, 844 flow [2024-01-27 15:15:19,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:15:19,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:15:19,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 182 transitions. [2024-01-27 15:15:19,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7137254901960784 [2024-01-27 15:15:19,170 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 193 flow. Second operand 5 states and 182 transitions. [2024-01-27 15:15:19,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 149 transitions, 844 flow [2024-01-27 15:15:19,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 149 transitions, 831 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-01-27 15:15:19,184 INFO L231 Difference]: Finished difference. Result has 65 places, 56 transitions, 223 flow [2024-01-27 15:15:19,184 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=223, PETRI_PLACES=65, PETRI_TRANSITIONS=56} [2024-01-27 15:15:19,185 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 8 predicate places. [2024-01-27 15:15:19,185 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 56 transitions, 223 flow [2024-01-27 15:15:19,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:15:19,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:15:19,186 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:15:19,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-27 15:15:19,186 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 15:15:19,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:15:19,187 INFO L85 PathProgramCache]: Analyzing trace with hash 520398830, now seen corresponding path program 1 times [2024-01-27 15:15:19,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:15:19,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967075257] [2024-01-27 15:15:19,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:15:19,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:15:19,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:15:19,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:15:19,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:15:19,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967075257] [2024-01-27 15:15:19,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967075257] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:15:19,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017423910] [2024-01-27 15:15:19,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:15:19,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:15:19,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:15:19,573 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-01-27 15:15:19,596 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-01-27 15:15:19,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:15:19,718 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 3 conjunts are in the unsatisfiable core [2024-01-27 15:15:19,722 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:15:19,807 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:15:19,807 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:15:19,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:15:19,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017423910] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:15:19,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:15:19,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-01-27 15:15:19,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645694273] [2024-01-27 15:15:19,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:15:19,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-27 15:15:19,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:15:19,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-27 15:15:19,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-01-27 15:15:19,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-01-27 15:15:19,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 223 flow. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 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-01-27 15:15:19,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:15:19,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-01-27 15:15:19,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:15:22,722 INFO L124 PetriNetUnfolderBase]: 31003/36989 cut-off events. [2024-01-27 15:15:22,722 INFO L125 PetriNetUnfolderBase]: For 47205/47205 co-relation queries the response was YES. [2024-01-27 15:15:22,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119853 conditions, 36989 events. 31003/36989 cut-off events. For 47205/47205 co-relation queries the response was YES. Maximal size of possible extension queue 1238. Compared 149514 event pairs, 105 based on Foata normal form. 1398/38375 useless extension candidates. Maximal degree in co-relation 51711. Up to 11319 conditions per place. [2024-01-27 15:15:22,875 INFO L140 encePairwiseOnDemand]: 42/51 looper letters, 239 selfloop transitions, 28 changer transitions 100/374 dead transitions. [2024-01-27 15:15:22,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 374 transitions, 2147 flow [2024-01-27 15:15:22,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-01-27 15:15:22,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-01-27 15:15:22,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 540 transitions. [2024-01-27 15:15:22,878 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6228373702422145 [2024-01-27 15:15:22,878 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 223 flow. Second operand 17 states and 540 transitions. [2024-01-27 15:15:22,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 374 transitions, 2147 flow [2024-01-27 15:15:23,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 374 transitions, 2126 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-01-27 15:15:23,115 INFO L231 Difference]: Finished difference. Result has 90 places, 80 transitions, 486 flow [2024-01-27 15:15:23,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=486, PETRI_PLACES=90, PETRI_TRANSITIONS=80} [2024-01-27 15:15:23,116 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 33 predicate places. [2024-01-27 15:15:23,116 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 80 transitions, 486 flow [2024-01-27 15:15:23,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 7 states have internal predecessors, (157), 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-01-27 15:15:23,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:15:23,116 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:15:23,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-01-27 15:15:23,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-01-27 15:15:23,318 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 15:15:23,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:15:23,318 INFO L85 PathProgramCache]: Analyzing trace with hash 689076605, now seen corresponding path program 1 times [2024-01-27 15:15:23,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:15:23,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558716020] [2024-01-27 15:15:23,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:15:23,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:15:23,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:15:23,422 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:15:23,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:15:23,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558716020] [2024-01-27 15:15:23,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558716020] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:15:23,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:15:23,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:15:23,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407926313] [2024-01-27 15:15:23,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:15:23,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:15:23,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:15:23,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:15:23,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:15:23,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-01-27 15:15:23,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 80 transitions, 486 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-01-27 15:15:23,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:15:23,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-01-27 15:15:23,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:15:25,719 INFO L124 PetriNetUnfolderBase]: 22581/27055 cut-off events. [2024-01-27 15:15:25,719 INFO L125 PetriNetUnfolderBase]: For 137539/137549 co-relation queries the response was YES. [2024-01-27 15:15:25,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112661 conditions, 27055 events. 22581/27055 cut-off events. For 137539/137549 co-relation queries the response was YES. Maximal size of possible extension queue 877. Compared 105783 event pairs, 3291 based on Foata normal form. 489/27129 useless extension candidates. Maximal degree in co-relation 104237. Up to 10761 conditions per place. [2024-01-27 15:15:25,922 INFO L140 encePairwiseOnDemand]: 45/51 looper letters, 233 selfloop transitions, 6 changer transitions 3/249 dead transitions. [2024-01-27 15:15:25,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 249 transitions, 2193 flow [2024-01-27 15:15:25,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:15:25,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:15:25,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 174 transitions. [2024-01-27 15:15:25,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6823529411764706 [2024-01-27 15:15:25,924 INFO L175 Difference]: Start difference. First operand has 90 places, 80 transitions, 486 flow. Second operand 5 states and 174 transitions. [2024-01-27 15:15:25,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 249 transitions, 2193 flow [2024-01-27 15:15:26,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 249 transitions, 2035 flow, removed 50 selfloop flow, removed 4 redundant places. [2024-01-27 15:15:26,048 INFO L231 Difference]: Finished difference. Result has 88 places, 83 transitions, 479 flow [2024-01-27 15:15:26,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=479, PETRI_PLACES=88, PETRI_TRANSITIONS=83} [2024-01-27 15:15:26,049 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 31 predicate places. [2024-01-27 15:15:26,050 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 83 transitions, 479 flow [2024-01-27 15:15:26,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-01-27 15:15:26,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:15:26,050 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:15:26,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 15:15:26,051 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 15:15:26,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:15:26,051 INFO L85 PathProgramCache]: Analyzing trace with hash 443461006, now seen corresponding path program 1 times [2024-01-27 15:15:26,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:15:26,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749862824] [2024-01-27 15:15:26,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:15:26,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:15:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:15:26,179 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:15:26,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:15:26,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749862824] [2024-01-27 15:15:26,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749862824] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:15:26,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300942459] [2024-01-27 15:15:26,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:15:26,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:15:26,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:15:26,182 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-01-27 15:15:26,187 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-01-27 15:15:26,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:15:26,316 INFO L262 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 3 conjunts are in the unsatisfiable core [2024-01-27 15:15:26,318 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:15:26,396 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:15:26,397 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:15:26,473 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:15:26,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300942459] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:15:26,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:15:26,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-01-27 15:15:26,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405449338] [2024-01-27 15:15:26,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:15:26,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-01-27 15:15:26,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:15:26,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-01-27 15:15:26,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-01-27 15:15:26,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-01-27 15:15:26,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 83 transitions, 479 flow. Second operand has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 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-01-27 15:15:26,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:15:26,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-01-27 15:15:26,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:15:29,134 INFO L124 PetriNetUnfolderBase]: 21429/25756 cut-off events. [2024-01-27 15:15:29,134 INFO L125 PetriNetUnfolderBase]: For 113585/113595 co-relation queries the response was YES. [2024-01-27 15:15:29,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109945 conditions, 25756 events. 21429/25756 cut-off events. For 113585/113595 co-relation queries the response was YES. Maximal size of possible extension queue 835. Compared 97542 event pairs, 86 based on Foata normal form. 1154/26867 useless extension candidates. Maximal degree in co-relation 99885. Up to 7443 conditions per place. [2024-01-27 15:15:29,296 INFO L140 encePairwiseOnDemand]: 42/51 looper letters, 338 selfloop transitions, 55 changer transitions 138/538 dead transitions. [2024-01-27 15:15:29,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 538 transitions, 4385 flow [2024-01-27 15:15:29,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-01-27 15:15:29,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-01-27 15:15:29,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 536 transitions. [2024-01-27 15:15:29,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6182237600922722 [2024-01-27 15:15:29,298 INFO L175 Difference]: Start difference. First operand has 88 places, 83 transitions, 479 flow. Second operand 17 states and 536 transitions. [2024-01-27 15:15:29,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 538 transitions, 4385 flow [2024-01-27 15:15:29,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 538 transitions, 4364 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-01-27 15:15:29,555 INFO L231 Difference]: Finished difference. Result has 113 places, 128 transitions, 1038 flow [2024-01-27 15:15:29,555 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1038, PETRI_PLACES=113, PETRI_TRANSITIONS=128} [2024-01-27 15:15:29,556 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 56 predicate places. [2024-01-27 15:15:29,556 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 128 transitions, 1038 flow [2024-01-27 15:15:29,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 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-01-27 15:15:29,556 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:15:29,557 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:15:29,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-01-27 15:15:29,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:15:29,773 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 15:15:29,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:15:29,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1636830619, now seen corresponding path program 1 times [2024-01-27 15:15:29,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:15:29,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126525062] [2024-01-27 15:15:29,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:15:29,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:15:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:15:29,888 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-01-27 15:15:29,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:15:29,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126525062] [2024-01-27 15:15:29,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126525062] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:15:29,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:15:29,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:15:29,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185862702] [2024-01-27 15:15:29,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:15:29,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:15:29,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:15:29,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:15:29,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:15:29,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-01-27 15:15:29,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 128 transitions, 1038 flow. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:15:29,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:15:29,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-01-27 15:15:29,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:15:31,744 INFO L124 PetriNetUnfolderBase]: 14584/17618 cut-off events. [2024-01-27 15:15:31,745 INFO L125 PetriNetUnfolderBase]: For 142681/142718 co-relation queries the response was YES. [2024-01-27 15:15:31,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90282 conditions, 17618 events. 14584/17618 cut-off events. For 142681/142718 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 64950 event pairs, 856 based on Foata normal form. 487/17995 useless extension candidates. Maximal degree in co-relation 82668. Up to 11829 conditions per place. [2024-01-27 15:15:31,901 INFO L140 encePairwiseOnDemand]: 46/51 looper letters, 271 selfloop transitions, 15 changer transitions 0/293 dead transitions. [2024-01-27 15:15:31,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 293 transitions, 2982 flow [2024-01-27 15:15:31,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:15:31,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:15:31,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 163 transitions. [2024-01-27 15:15:31,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6392156862745098 [2024-01-27 15:15:31,903 INFO L175 Difference]: Start difference. First operand has 113 places, 128 transitions, 1038 flow. Second operand 5 states and 163 transitions. [2024-01-27 15:15:31,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 293 transitions, 2982 flow [2024-01-27 15:15:32,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 293 transitions, 2831 flow, removed 71 selfloop flow, removed 3 redundant places. [2024-01-27 15:15:32,227 INFO L231 Difference]: Finished difference. Result has 112 places, 134 transitions, 1061 flow [2024-01-27 15:15:32,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=959, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1061, PETRI_PLACES=112, PETRI_TRANSITIONS=134} [2024-01-27 15:15:32,229 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 55 predicate places. [2024-01-27 15:15:32,229 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 134 transitions, 1061 flow [2024-01-27 15:15:32,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:15:32,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:15:32,230 INFO L208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:15:32,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-27 15:15:32,230 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-01-27 15:15:32,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:15:32,230 INFO L85 PathProgramCache]: Analyzing trace with hash -660782776, now seen corresponding path program 1 times [2024-01-27 15:15:32,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:15:32,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290140781] [2024-01-27 15:15:32,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:15:32,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:15:32,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:15:32,893 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:15:32,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:15:32,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290140781] [2024-01-27 15:15:32,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290140781] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:15:32,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227621908] [2024-01-27 15:15:32,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:15:32,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:15:32,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:15:32,896 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-01-27 15:15:32,900 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-01-27 15:15:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:15:33,421 INFO L262 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 9 conjunts are in the unsatisfiable core [2024-01-27 15:15:33,424 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:15:37,057 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:15:37,057 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:15:38,310 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:15:38,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227621908] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:15:38,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:15:38,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2024-01-27 15:15:38,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431122776] [2024-01-27 15:15:38,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:15:38,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-01-27 15:15:38,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:15:38,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-01-27 15:15:38,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2024-01-27 15:15:38,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 51 [2024-01-27 15:15:38,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 134 transitions, 1061 flow. Second operand has 18 states, 18 states have (on average 19.166666666666668) internal successors, (345), 18 states have internal predecessors, (345), 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-01-27 15:15:38,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:15:38,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 51 [2024-01-27 15:15:38,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:15:44,984 WARN L293 SmtUtils]: Spent 6.42s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-27 15:15:46,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:16:03,970 WARN L293 SmtUtils]: Spent 13.05s on a formula simplification. DAG size of input: 50 DAG size of output: 45 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-27 15:16:44,238 WARN L293 SmtUtils]: Spent 8.32s on a formula simplification. DAG size of input: 49 DAG size of output: 41 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-27 15:16:48,918 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-01-27 15:16:52,925 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-01-27 15:16:56,929 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-01-27 15:17:00,932 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-01-27 15:17:04,935 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-01-27 15:17:08,946 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (div c_~x5~0 4294967296)) (.cse8 (div c_~x6~0 4294967296))) (let ((.cse0 (mod c_~x2~0 4294967296)) (.cse1 (mod c_~x1~0 4294967296)) (.cse2 (div c_~n~0 4294967296)) (.cse5 (* c_~x5~0 2)) (.cse6 (* 8589934592 .cse8)) (.cse3 (* 2 c_~x6~0)) (.cse4 (* 8589934592 .cse7))) (and (= (mod (* 4294967295 (div (* (- 1) c_~x1~0) 2)) 4294967296) .cse0) (= .cse1 .cse0) (<= (mod c_~n~0 4294967296) .cse1) (<= (+ 2 (* 4294967296 .cse2) .cse3 .cse4) (+ .cse5 c_~n~0 .cse6)) (= (mod c_~x1~0 2) 0) (<= (+ (* 8589934592 .cse2) c_~x1~0 2 .cse5 .cse6) (+ (* 4294967296 (div c_~x1~0 4294967296)) .cse3 (* 2 c_~n~0) .cse4)) (= (+ c_~x6~0 (* .cse7 4294967296)) (+ (* .cse8 4294967296) c_~x5~0))))) is different from false [2024-01-27 15:17:29,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:19:05,935 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-01-27 15:19:10,030 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-01-27 15:19:14,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-01-27 15:19:18,035 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-01-27 15:19:22,039 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-01-27 15:19:26,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-01-27 15:19:30,045 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-01-27 15:19:34,047 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-01-27 15:19:38,053 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_~x2~0 4294967296)) (.cse0 (* 4294967296 (div c_~n~0 4294967296))) (.cse1 (* 2 c_~x6~0)) (.cse2 (* (- 1) c_~x5~0)) (.cse4 (mod c_~x1~0 4294967296))) (and (<= (+ 2 .cse0 .cse1) (+ (* (div (+ .cse1 .cse2) 4294967296) 4294967296) c_~x5~0 c_~n~0)) (= (mod (* 4294967295 (div (* (- 1) c_~x1~0) 2)) 4294967296) .cse3) (= .cse4 .cse3) (<= (+ .cse0 .cse1) (+ (* 4294967296 (div (+ (- 2) .cse1 c_~n~0 .cse2) 4294967296)) c_~x5~0)) (<= (mod c_~n~0 4294967296) .cse4) (= (mod c_~x1~0 2) 0))) is different from false [2024-01-27 15:19:40,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.75s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:20:17,949 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-01-27 15:20:21,952 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-01-27 15:20:25,955 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-01-27 15:20:29,966 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-01-27 15:20:33,969 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-01-27 15:20:37,973 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-01-27 15:20:41,977 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-01-27 15:20:45,985 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (* (- 1) c_~x5~0)) (.cse0 (* 4294967296 (div c_~n~0 4294967296))) (.cse1 (* 2 c_~x6~0))) (let ((.cse3 (mod c_~x2~0 4294967296)) (.cse4 (mod c_~x1~0 4294967296)) (.cse5 (+ .cse0 .cse1)) (.cse2 (* (div (+ .cse1 .cse6) 4294967296) 4294967296)) (.cse7 (* (div c_~x5~0 4294967296) 4294967296))) (and (<= (+ 2 .cse0 .cse1) (+ .cse2 c_~x5~0 c_~n~0)) (= (mod (* 4294967295 (div (* (- 1) c_~x1~0) 2)) 4294967296) .cse3) (= .cse4 .cse3) (<= .cse5 (+ (* 4294967296 (div (+ (- 2) .cse1 c_~n~0 .cse6) 4294967296)) c_~x5~0)) (<= (mod c_~n~0 4294967296) .cse4) (<= (+ .cse1 .cse7) (+ (* (div (+ (- 1) c_~x6~0) 2147483648) 4294967296) c_~x5~0)) (= (mod c_~x1~0 2) 0) (<= .cse5 (+ .cse2 c_~n~0 4294967293 .cse7))))) is different from false [2024-01-27 15:20:54,594 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-01-27 15:20:58,596 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-01-27 15:21:02,599 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-01-27 15:21:06,603 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-01-27 15:21:10,605 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-01-27 15:21:14,608 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-01-27 15:21:18,613 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-01-27 15:21:22,616 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-01-27 15:21:26,618 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-01-27 15:21:30,622 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-01-27 15:21:34,625 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-01-27 15:21:38,629 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-01-27 15:21:42,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.65s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:21:46,284 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-01-27 15:21:50,288 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-01-27 15:21:54,293 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-01-27 15:21:58,297 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-01-27 15:22:02,300 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-01-27 15:23:39,956 WARN L293 SmtUtils]: Spent 27.70s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-27 15:23:43,959 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-01-27 15:23:47,962 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-01-27 15:23:51,966 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-01-27 15:23:55,969 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-01-27 15:23:59,972 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-01-27 15:24:04,009 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-01-27 15:24:08,012 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-01-27 15:24:09,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:24:13,155 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (* 4294967295 (div (* (- 1) c_~x1~0) 2)) 4294967296)) (.cse1 (mod c_~n~0 4294967296))) (and (= (mod c_~x2~0 2) 0) (= .cse0 (mod c_~x2~0 4294967296)) (<= .cse1 (mod c_~x1~0 4294967296)) (= (mod (div c_~x2~0 2) 4294967296) .cse0) (= (mod c_~x1~0 2) 0) (= (+ c_~x6~0 (* (div c_~x5~0 4294967296) 4294967296)) (+ (* (div c_~x6~0 4294967296) 4294967296) c_~x5~0)) (<= 1 .cse1))) is different from false [2024-01-27 15:24:17,173 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-01-27 15:24:21,181 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-01-27 15:25:12,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:25:16,400 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-01-27 15:25:20,407 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-01-27 15:25:24,410 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-01-27 15:25:28,414 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-01-27 15:25:32,417 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-01-27 15:25:36,421 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-01-27 15:25:40,426 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-01-27 15:25:44,429 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-01-27 15:25:48,434 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-01-27 15:25:52,436 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-01-27 15:25:56,440 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-01-27 15:26:00,443 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-01-27 15:26:04,446 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-01-27 15:26:08,449 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-01-27 15:26:12,452 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-01-27 15:26:16,456 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-01-27 15:26:20,461 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-01-27 15:26:24,464 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-01-27 15:26:28,466 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-01-27 15:26:32,472 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-01-27 15:26:36,478 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-01-27 15:26:40,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-27 15:26:42,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-27 15:26:46,755 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-01-27 15:26:50,758 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-01-27 15:26:54,760 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-01-27 15:26:58,763 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-01-27 15:27:02,768 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-01-27 15:27:06,771 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-01-27 15:27:10,773 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-01-27 15:27:12,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:27:16,537 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-01-27 15:27:20,539 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-01-27 15:27:24,542 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-01-27 15:27:27,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:28:15,195 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-01-27 15:28:20,135 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-01-27 15:28:24,138 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-01-27 15:28:28,148 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-01-27 15:28:32,153 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-01-27 15:28:34,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:28:54,796 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-01-27 15:28:56,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-27 15:29:00,057 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-01-27 15:29:04,059 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-01-27 15:29:08,063 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-01-27 15:29:12,066 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 [] Killed by 15