./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87d521f3-ce1f-40f3-82ac-32bcf4a4dfa9/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87d521f3-ce1f-40f3-82ac-32bcf4a4dfa9/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87d521f3-ce1f-40f3-82ac-32bcf4a4dfa9/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87d521f3-ce1f-40f3-82ac-32bcf4a4dfa9/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87d521f3-ce1f-40f3-82ac-32bcf4a4dfa9/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87d521f3-ce1f-40f3-82ac-32bcf4a4dfa9/bin/uautomizer-verify-uTZkv6EMXl --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 a0c922061e4dc1feb6389a43fa3f654e69e326084cac4d5446a529710663ff29 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:25:29,678 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:25:29,801 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87d521f3-ce1f-40f3-82ac-32bcf4a4dfa9/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-12 02:25:29,805 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:25:29,809 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:25:29,847 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:25:29,848 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:25:29,849 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:25:29,850 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:25:29,855 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:25:29,856 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:25:29,856 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:25:29,857 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:25:29,858 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:25:29,859 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:25:29,859 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:25:29,860 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:25:29,860 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:25:29,860 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:25:29,861 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:25:29,861 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:25:29,862 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:25:29,862 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:25:29,863 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:25:29,863 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:25:29,864 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:25:29,864 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:25:29,865 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:25:29,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:25:29,866 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:25:29,867 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:25:29,867 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:25:29,868 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:25:29,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:25:29,868 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:25:29,868 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:25:29,869 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:25:29,869 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:25:29,869 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:25:29,869 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87d521f3-ce1f-40f3-82ac-32bcf4a4dfa9/bin/uautomizer-verify-uTZkv6EMXl/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87d521f3-ce1f-40f3-82ac-32bcf4a4dfa9/bin/uautomizer-verify-uTZkv6EMXl 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 -> a0c922061e4dc1feb6389a43fa3f654e69e326084cac4d5446a529710663ff29 [2023-11-12 02:25:30,176 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:25:30,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:25:30,212 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:25:30,213 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:25:30,214 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:25:30,215 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87d521f3-ce1f-40f3-82ac-32bcf4a4dfa9/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i [2023-11-12 02:25:33,333 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:25:33,667 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:25:33,668 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87d521f3-ce1f-40f3-82ac-32bcf4a4dfa9/sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i [2023-11-12 02:25:33,694 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87d521f3-ce1f-40f3-82ac-32bcf4a4dfa9/bin/uautomizer-verify-uTZkv6EMXl/data/ba10dcaa5/73e2b13a95274586bc7eedabb78e141a/FLAGec1aedc0f [2023-11-12 02:25:33,711 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87d521f3-ce1f-40f3-82ac-32bcf4a4dfa9/bin/uautomizer-verify-uTZkv6EMXl/data/ba10dcaa5/73e2b13a95274586bc7eedabb78e141a [2023-11-12 02:25:33,714 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:25:33,716 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:25:33,717 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:25:33,717 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:25:33,723 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:25:33,724 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:25:33" (1/1) ... [2023-11-12 02:25:33,725 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51e21bc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:33, skipping insertion in model container [2023-11-12 02:25:33,725 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:25:33" (1/1) ... [2023-11-12 02:25:33,779 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:25:33,957 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87d521f3-ce1f-40f3-82ac-32bcf4a4dfa9/sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i[956,969] [2023-11-12 02:25:34,245 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:25:34,260 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:25:34,271 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87d521f3-ce1f-40f3-82ac-32bcf4a4dfa9/sv-benchmarks/c/pthread-wmm/mix026_pso.opt_rmo.opt.i[956,969] [2023-11-12 02:25:34,323 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:25:34,362 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:25:34,363 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:25:34,369 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:25:34,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:34 WrapperNode [2023-11-12 02:25:34,370 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:25:34,371 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:25:34,372 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:25:34,372 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:25:34,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:34" (1/1) ... [2023-11-12 02:25:34,397 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:34" (1/1) ... [2023-11-12 02:25:34,440 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-11-12 02:25:34,441 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:25:34,441 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:25:34,442 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:25:34,442 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:25:34,452 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:34" (1/1) ... [2023-11-12 02:25:34,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:34" (1/1) ... [2023-11-12 02:25:34,458 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:34" (1/1) ... [2023-11-12 02:25:34,458 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:34" (1/1) ... [2023-11-12 02:25:34,469 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:34" (1/1) ... [2023-11-12 02:25:34,471 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:34" (1/1) ... [2023-11-12 02:25:34,474 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:34" (1/1) ... [2023-11-12 02:25:34,477 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:34" (1/1) ... [2023-11-12 02:25:34,481 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:25:34,482 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:25:34,483 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:25:34,483 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:25:34,484 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:34" (1/1) ... [2023-11-12 02:25:34,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:25:34,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87d521f3-ce1f-40f3-82ac-32bcf4a4dfa9/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:25:34,526 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87d521f3-ce1f-40f3-82ac-32bcf4a4dfa9/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:25:34,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87d521f3-ce1f-40f3-82ac-32bcf4a4dfa9/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:25:34,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:25:34,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-12 02:25:34,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:25:34,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 02:25:34,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:25:34,568 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-12 02:25:34,568 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-12 02:25:34,568 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-12 02:25:34,568 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-12 02:25:34,569 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-12 02:25:34,569 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-12 02:25:34,569 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-12 02:25:34,569 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-12 02:25:34,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:25:34,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-12 02:25:34,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:25:34,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:25:34,574 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-12 02:25:34,726 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:25:34,728 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:25:35,116 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:25:35,309 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:25:35,309 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-12 02:25:35,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:25:35 BoogieIcfgContainer [2023-11-12 02:25:35,313 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:25:35,316 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:25:35,317 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:25:35,320 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:25:35,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:25:33" (1/3) ... [2023-11-12 02:25:35,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23e42f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:25:35, skipping insertion in model container [2023-11-12 02:25:35,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:25:34" (2/3) ... [2023-11-12 02:25:35,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23e42f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:25:35, skipping insertion in model container [2023-11-12 02:25:35,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:25:35" (3/3) ... [2023-11-12 02:25:35,327 INFO L112 eAbstractionObserver]: Analyzing ICFG mix026_pso.opt_rmo.opt.i [2023-11-12 02:25:35,336 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-12 02:25:35,363 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:25:35,363 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-12 02:25:35,364 INFO L521 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-12 02:25:35,449 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-12 02:25:35,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 280 flow [2023-11-12 02:25:35,586 INFO L124 PetriNetUnfolderBase]: 2/128 cut-off events. [2023-11-12 02:25:35,586 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:25:35,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2023-11-12 02:25:35,594 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 132 transitions, 280 flow [2023-11-12 02:25:35,600 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 128 transitions, 268 flow [2023-11-12 02:25:35,604 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-12 02:25:35,616 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 128 transitions, 268 flow [2023-11-12 02:25:35,619 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 128 transitions, 268 flow [2023-11-12 02:25:35,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 268 flow [2023-11-12 02:25:35,661 INFO L124 PetriNetUnfolderBase]: 2/128 cut-off events. [2023-11-12 02:25:35,661 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:25:35,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2023-11-12 02:25:35,672 INFO L119 LiptonReduction]: Number of co-enabled transitions 3076 [2023-11-12 02:25:40,907 INFO L134 LiptonReduction]: Checked pairs total: 7377 [2023-11-12 02:25:40,907 INFO L136 LiptonReduction]: Total number of compositions: 113 [2023-11-12 02:25:40,935 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:25:40,948 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;@28f9568a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:25:40,948 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-12 02:25:40,961 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-12 02:25:40,963 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-11-12 02:25:40,963 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:25:40,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:25:40,964 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:25:40,965 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-12 02:25:40,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:40,971 INFO L85 PathProgramCache]: Analyzing trace with hash -740928017, now seen corresponding path program 1 times [2023-11-12 02:25:40,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:40,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179306814] [2023-11-12 02:25:40,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:40,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:41,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:41,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:25:41,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:41,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179306814] [2023-11-12 02:25:41,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179306814] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:41,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:41,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 02:25:41,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372412834] [2023-11-12 02:25:41,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:41,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:25:41,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:41,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:25:41,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:25:41,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 245 [2023-11-12 02:25:41,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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) [2023-11-12 02:25:41,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:25:41,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 245 [2023-11-12 02:25:41,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:25:42,646 INFO L124 PetriNetUnfolderBase]: 2855/4135 cut-off events. [2023-11-12 02:25:42,647 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2023-11-12 02:25:42,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8211 conditions, 4135 events. 2855/4135 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 20918 event pairs, 785 based on Foata normal form. 0/3894 useless extension candidates. Maximal degree in co-relation 8199. Up to 3103 conditions per place. [2023-11-12 02:25:42,689 INFO L140 encePairwiseOnDemand]: 241/245 looper letters, 33 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2023-11-12 02:25:42,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 41 transitions, 171 flow [2023-11-12 02:25:42,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:25:42,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:25:42,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2023-11-12 02:25:42,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5360544217687074 [2023-11-12 02:25:42,712 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 394 transitions. [2023-11-12 02:25:42,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 394 transitions. [2023-11-12 02:25:42,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:25:42,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 394 transitions. [2023-11-12 02:25:42,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 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) [2023-11-12 02:25:42,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 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) [2023-11-12 02:25:42,735 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 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) [2023-11-12 02:25:42,737 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 394 transitions. [2023-11-12 02:25:42,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 41 transitions, 171 flow [2023-11-12 02:25:42,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 41 transitions, 166 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-12 02:25:42,747 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 64 flow [2023-11-12 02:25:42,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2023-11-12 02:25:42,753 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2023-11-12 02:25:42,754 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 64 flow [2023-11-12 02:25:42,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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) [2023-11-12 02:25:42,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:25:42,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:25:42,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:25:42,755 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-12 02:25:42,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:42,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1216066635, now seen corresponding path program 1 times [2023-11-12 02:25:42,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:42,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533610909] [2023-11-12 02:25:42,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:42,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:42,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:43,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:25:43,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:43,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533610909] [2023-11-12 02:25:43,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533610909] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:43,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:43,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 02:25:43,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800879886] [2023-11-12 02:25:43,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:43,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:25:43,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:43,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:25:43,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:25:43,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 245 [2023-11-12 02:25:43,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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) [2023-11-12 02:25:43,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:25:43,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 245 [2023-11-12 02:25:43,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:25:44,771 INFO L124 PetriNetUnfolderBase]: 8755/12032 cut-off events. [2023-11-12 02:25:44,772 INFO L125 PetriNetUnfolderBase]: For 408/408 co-relation queries the response was YES. [2023-11-12 02:25:44,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24754 conditions, 12032 events. 8755/12032 cut-off events. For 408/408 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 59536 event pairs, 2987 based on Foata normal form. 296/12328 useless extension candidates. Maximal degree in co-relation 24744. Up to 8389 conditions per place. [2023-11-12 02:25:44,866 INFO L140 encePairwiseOnDemand]: 237/245 looper letters, 42 selfloop transitions, 7 changer transitions 0/49 dead transitions. [2023-11-12 02:25:44,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 49 transitions, 216 flow [2023-11-12 02:25:44,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:25:44,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:25:44,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2023-11-12 02:25:44,868 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5129251700680272 [2023-11-12 02:25:44,869 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 377 transitions. [2023-11-12 02:25:44,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 377 transitions. [2023-11-12 02:25:44,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:25:44,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 377 transitions. [2023-11-12 02:25:44,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 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) [2023-11-12 02:25:44,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 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) [2023-11-12 02:25:44,879 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 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) [2023-11-12 02:25:44,879 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 64 flow. Second operand 3 states and 377 transitions. [2023-11-12 02:25:44,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 49 transitions, 216 flow [2023-11-12 02:25:44,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 49 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:25:44,883 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 114 flow [2023-11-12 02:25:44,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2023-11-12 02:25:44,891 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2023-11-12 02:25:44,891 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 114 flow [2023-11-12 02:25:44,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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) [2023-11-12 02:25:44,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:25:44,892 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:25:44,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:25:44,892 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-12 02:25:44,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:44,893 INFO L85 PathProgramCache]: Analyzing trace with hash 956639204, now seen corresponding path program 1 times [2023-11-12 02:25:44,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:44,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357950077] [2023-11-12 02:25:44,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:44,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:44,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:45,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:25:45,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:45,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357950077] [2023-11-12 02:25:45,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357950077] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:45,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:45,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 02:25:45,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125397673] [2023-11-12 02:25:45,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:45,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:25:45,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:45,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:25:45,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:25:45,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 245 [2023-11-12 02:25:45,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 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) [2023-11-12 02:25:45,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:25:45,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 245 [2023-11-12 02:25:45,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:25:46,893 INFO L124 PetriNetUnfolderBase]: 6253/9079 cut-off events. [2023-11-12 02:25:46,893 INFO L125 PetriNetUnfolderBase]: For 2695/2735 co-relation queries the response was YES. [2023-11-12 02:25:46,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21155 conditions, 9079 events. 6253/9079 cut-off events. For 2695/2735 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 49307 event pairs, 2168 based on Foata normal form. 148/9155 useless extension candidates. Maximal degree in co-relation 21143. Up to 5564 conditions per place. [2023-11-12 02:25:46,982 INFO L140 encePairwiseOnDemand]: 242/245 looper letters, 34 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2023-11-12 02:25:46,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 43 transitions, 216 flow [2023-11-12 02:25:46,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:25:46,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:25:46,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 385 transitions. [2023-11-12 02:25:46,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2023-11-12 02:25:46,985 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 385 transitions. [2023-11-12 02:25:46,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 385 transitions. [2023-11-12 02:25:46,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:25:46,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 385 transitions. [2023-11-12 02:25:46,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 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) [2023-11-12 02:25:46,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 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) [2023-11-12 02:25:46,993 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 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) [2023-11-12 02:25:46,993 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 114 flow. Second operand 3 states and 385 transitions. [2023-11-12 02:25:46,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 43 transitions, 216 flow [2023-11-12 02:25:47,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:25:47,017 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 111 flow [2023-11-12 02:25:47,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2023-11-12 02:25:47,019 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2023-11-12 02:25:47,023 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 111 flow [2023-11-12 02:25:47,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 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) [2023-11-12 02:25:47,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:25:47,025 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:25:47,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:25:47,025 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-12 02:25:47,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:47,026 INFO L85 PathProgramCache]: Analyzing trace with hash -410342316, now seen corresponding path program 1 times [2023-11-12 02:25:47,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:47,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326695180] [2023-11-12 02:25:47,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:47,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:47,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:25:47,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:47,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326695180] [2023-11-12 02:25:47,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326695180] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:47,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:47,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:25:47,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220220446] [2023-11-12 02:25:47,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:47,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:25:47,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:47,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:25:47,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:25:47,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 245 [2023-11-12 02:25:47,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 111 flow. Second operand has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 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) [2023-11-12 02:25:47,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:25:47,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 245 [2023-11-12 02:25:47,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:25:48,418 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([394] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][68], [Black: 158#(= ~__unbuffered_p3_EAX~0 0), 111#L784true, 72#L2true, 161#true, 44#L756true, P3Thread1of1ForFork3InUse, 53#L839true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 156#true, 15#P2EXITtrue, Black: 152#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2023-11-12 02:25:48,419 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-12 02:25:48,419 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-12 02:25:48,419 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-12 02:25:48,419 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-12 02:25:48,521 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([394] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][68], [Black: 158#(= ~__unbuffered_p3_EAX~0 0), 72#L2true, 161#true, 44#L756true, P3Thread1of1ForFork3InUse, 53#L839true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 38#P1EXITtrue, 156#true, 15#P2EXITtrue, Black: 152#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2023-11-12 02:25:48,522 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-12 02:25:48,522 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-12 02:25:48,522 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-12 02:25:48,522 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-12 02:25:48,524 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([496] L874-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_30| 0) (= (mod v_~main$tmp_guard1~0_10 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_22|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_22| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_18 0) (= 0 v_~__unbuffered_p3_EBX~0_10) (= v_~z~0_14 2) (= 2 v_~__unbuffered_p3_EAX~0_10) (= v_~__unbuffered_p0_EAX~0_10 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_10)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_22|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][71], [Black: 158#(= ~__unbuffered_p3_EAX~0 0), 111#L784true, 161#true, 44#L756true, P3Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 156#true, 15#P2EXITtrue, Black: 152#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 58#L832true, 121#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue]) [2023-11-12 02:25:48,524 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-12 02:25:48,525 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-12 02:25:48,525 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-12 02:25:48,525 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-12 02:25:48,525 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([394] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][68], [Black: 158#(= ~__unbuffered_p3_EAX~0 0), 111#L784true, 161#true, 44#L756true, 53#L839true, P3Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, 81#L874true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 156#true, 15#P2EXITtrue, Black: 152#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2023-11-12 02:25:48,526 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-12 02:25:48,526 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-12 02:25:48,526 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-12 02:25:48,526 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-12 02:25:48,593 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([496] L874-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_30| 0) (= (mod v_~main$tmp_guard1~0_10 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_22|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_22| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|) (= (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_18 0) (= 0 v_~__unbuffered_p3_EBX~0_10) (= v_~z~0_14 2) (= 2 v_~__unbuffered_p3_EAX~0_10) (= v_~__unbuffered_p0_EAX~0_10 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_10)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_22|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][71], [Black: 158#(= ~__unbuffered_p3_EAX~0 0), 161#true, 44#L756true, P3Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 38#P1EXITtrue, 156#true, 15#P2EXITtrue, Black: 152#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 58#L832true, 121#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue]) [2023-11-12 02:25:48,593 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-12 02:25:48,594 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-12 02:25:48,594 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-12 02:25:48,594 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-12 02:25:48,594 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([394] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][68], [Black: 158#(= ~__unbuffered_p3_EAX~0 0), 161#true, 44#L756true, P3Thread1of1ForFork3InUse, 53#L839true, P1Thread1of1ForFork0InUse, 81#L874true, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 38#P1EXITtrue, 156#true, 15#P2EXITtrue, Black: 152#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2023-11-12 02:25:48,595 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-12 02:25:48,595 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-12 02:25:48,595 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-12 02:25:48,595 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-12 02:25:48,636 INFO L124 PetriNetUnfolderBase]: 5042/7558 cut-off events. [2023-11-12 02:25:48,636 INFO L125 PetriNetUnfolderBase]: For 1456/1543 co-relation queries the response was YES. [2023-11-12 02:25:48,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17056 conditions, 7558 events. 5042/7558 cut-off events. For 1456/1543 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 45036 event pairs, 939 based on Foata normal form. 573/7867 useless extension candidates. Maximal degree in co-relation 17043. Up to 4920 conditions per place. [2023-11-12 02:25:48,693 INFO L140 encePairwiseOnDemand]: 238/245 looper letters, 60 selfloop transitions, 10 changer transitions 0/78 dead transitions. [2023-11-12 02:25:48,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 78 transitions, 373 flow [2023-11-12 02:25:48,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:25:48,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:25:48,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 624 transitions. [2023-11-12 02:25:48,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5093877551020408 [2023-11-12 02:25:48,697 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 624 transitions. [2023-11-12 02:25:48,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 624 transitions. [2023-11-12 02:25:48,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:25:48,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 624 transitions. [2023-11-12 02:25:48,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 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) [2023-11-12 02:25:48,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 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) [2023-11-12 02:25:48,706 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 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) [2023-11-12 02:25:48,706 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 111 flow. Second operand 5 states and 624 transitions. [2023-11-12 02:25:48,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 78 transitions, 373 flow [2023-11-12 02:25:48,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 78 transitions, 367 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:25:48,710 INFO L231 Difference]: Finished difference. Result has 45 places, 41 transitions, 180 flow [2023-11-12 02:25:48,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=180, PETRI_PLACES=45, PETRI_TRANSITIONS=41} [2023-11-12 02:25:48,712 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2023-11-12 02:25:48,712 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 41 transitions, 180 flow [2023-11-12 02:25:48,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 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) [2023-11-12 02:25:48,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:25:48,713 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:25:48,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:25:48,713 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-12 02:25:48,714 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:48,714 INFO L85 PathProgramCache]: Analyzing trace with hash 181256082, now seen corresponding path program 1 times [2023-11-12 02:25:48,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:48,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182463141] [2023-11-12 02:25:48,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:48,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:48,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:48,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:25:48,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:48,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182463141] [2023-11-12 02:25:48,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182463141] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:48,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:48,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:25:48,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993660580] [2023-11-12 02:25:48,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:48,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:25:48,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:48,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:25:48,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:25:48,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 245 [2023-11-12 02:25:48,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 41 transitions, 180 flow. Second operand has 5 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 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) [2023-11-12 02:25:48,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:25:48,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 245 [2023-11-12 02:25:48,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:25:49,947 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([394] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][74], [Black: 158#(= ~__unbuffered_p3_EAX~0 0), 72#L2true, 111#L784true, 161#true, 44#L756true, Black: 164#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 166#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 53#L839true, P3Thread1of1ForFork3InUse, Black: 163#(= ~__unbuffered_cnt~0 0), P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, P0Thread1of1ForFork2InUse, 179#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 15#P2EXITtrue, Black: 152#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2023-11-12 02:25:49,948 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-12 02:25:49,948 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-12 02:25:49,948 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-12 02:25:49,948 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-12 02:25:50,126 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([394] L832-->L839: Formula: (let ((.cse2 (not (= (mod v_~y$w_buff0_used~0_97 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_26 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd4~0_24 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff1_used~0_81 256) 0)) .cse3)) (.cse4 (and (not (= (mod v_~y$w_buff0_used~0_98 256) 0)) .cse5)) (.cse0 (and .cse2 .cse5))) (and (= v_~y$w_buff1_used~0_80 (ite (or .cse0 .cse1) 0 v_~y$w_buff1_used~0_81)) (= (ite (or (and (not (= (mod v_~y$r_buff0_thd4~0_25 256) 0)) .cse2) (and (not (= (mod v_~y$w_buff1_used~0_80 256) 0)) .cse3)) 0 v_~y$r_buff1_thd4~0_24) v_~y$r_buff1_thd4~0_23) (= v_~y~0_62 (ite .cse4 v_~y$w_buff0~0_46 (ite .cse1 v_~y$w_buff1~0_45 v_~y~0_63))) (= v_~y$w_buff0_used~0_97 (ite .cse4 0 v_~y$w_buff0_used~0_98)) (= v_~y$r_buff0_thd4~0_25 (ite .cse0 0 v_~y$r_buff0_thd4~0_26))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_26, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_24, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_63, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_81} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_23, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$w_buff1~0=v_~y$w_buff1~0_45, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_62, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_80} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][97], [Black: 158#(= ~__unbuffered_p3_EAX~0 0), 72#L2true, 161#true, 44#L756true, Black: 164#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 166#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 163#(= ~__unbuffered_cnt~0 0), P3Thread1of1ForFork3InUse, 53#L839true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 38#P1EXITtrue, P0Thread1of1ForFork2InUse, 15#P2EXITtrue, 175#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), Black: 152#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))]) [2023-11-12 02:25:50,127 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-12 02:25:50,127 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-12 02:25:50,127 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-12 02:25:50,127 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-12 02:25:50,239 INFO L124 PetriNetUnfolderBase]: 4007/6228 cut-off events. [2023-11-12 02:25:50,240 INFO L125 PetriNetUnfolderBase]: For 3653/3698 co-relation queries the response was YES. [2023-11-12 02:25:50,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18644 conditions, 6228 events. 4007/6228 cut-off events. For 3653/3698 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 38079 event pairs, 416 based on Foata normal form. 401/6461 useless extension candidates. Maximal degree in co-relation 18628. Up to 2168 conditions per place. [2023-11-12 02:25:50,292 INFO L140 encePairwiseOnDemand]: 238/245 looper letters, 82 selfloop transitions, 19 changer transitions 0/109 dead transitions. [2023-11-12 02:25:50,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 109 transitions, 618 flow [2023-11-12 02:25:50,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:25:50,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:25:50,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 875 transitions. [2023-11-12 02:25:50,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5102040816326531 [2023-11-12 02:25:50,298 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 875 transitions. [2023-11-12 02:25:50,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 875 transitions. [2023-11-12 02:25:50,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:25:50,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 875 transitions. [2023-11-12 02:25:50,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 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) [2023-11-12 02:25:50,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 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) [2023-11-12 02:25:50,310 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 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) [2023-11-12 02:25:50,311 INFO L175 Difference]: Start difference. First operand has 45 places, 41 transitions, 180 flow. Second operand 7 states and 875 transitions. [2023-11-12 02:25:50,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 109 transitions, 618 flow [2023-11-12 02:25:50,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 109 transitions, 613 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-12 02:25:50,343 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 309 flow [2023-11-12 02:25:50,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=309, PETRI_PLACES=53, PETRI_TRANSITIONS=50} [2023-11-12 02:25:50,346 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2023-11-12 02:25:50,346 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 309 flow [2023-11-12 02:25:50,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 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) [2023-11-12 02:25:50,347 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:25:50,347 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] [2023-11-12 02:25:50,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:25:50,348 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-12 02:25:50,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:50,348 INFO L85 PathProgramCache]: Analyzing trace with hash -470547010, now seen corresponding path program 1 times [2023-11-12 02:25:50,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:50,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398212312] [2023-11-12 02:25:50,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:50,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:50,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:25:50,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:50,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398212312] [2023-11-12 02:25:50,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398212312] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:50,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:50,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:25:50,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492803749] [2023-11-12 02:25:50,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:50,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:25:50,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:50,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:25:50,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:25:50,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 245 [2023-11-12 02:25:50,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 50 transitions, 309 flow. Second operand has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 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) [2023-11-12 02:25:50,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:25:50,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 245 [2023-11-12 02:25:50,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:25:52,662 INFO L124 PetriNetUnfolderBase]: 7067/10435 cut-off events. [2023-11-12 02:25:52,663 INFO L125 PetriNetUnfolderBase]: For 21479/21479 co-relation queries the response was YES. [2023-11-12 02:25:52,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38185 conditions, 10435 events. 7067/10435 cut-off events. For 21479/21479 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 59650 event pairs, 640 based on Foata normal form. 56/10491 useless extension candidates. Maximal degree in co-relation 38165. Up to 4947 conditions per place. [2023-11-12 02:25:52,722 INFO L140 encePairwiseOnDemand]: 236/245 looper letters, 103 selfloop transitions, 16 changer transitions 36/155 dead transitions. [2023-11-12 02:25:52,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 155 transitions, 1299 flow [2023-11-12 02:25:52,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:25:52,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:25:52,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 624 transitions. [2023-11-12 02:25:52,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5093877551020408 [2023-11-12 02:25:52,726 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 624 transitions. [2023-11-12 02:25:52,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 624 transitions. [2023-11-12 02:25:52,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:25:52,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 624 transitions. [2023-11-12 02:25:52,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 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) [2023-11-12 02:25:52,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 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) [2023-11-12 02:25:52,733 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 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) [2023-11-12 02:25:52,733 INFO L175 Difference]: Start difference. First operand has 53 places, 50 transitions, 309 flow. Second operand 5 states and 624 transitions. [2023-11-12 02:25:52,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 155 transitions, 1299 flow [2023-11-12 02:25:52,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 155 transitions, 1127 flow, removed 60 selfloop flow, removed 3 redundant places. [2023-11-12 02:25:52,969 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 299 flow [2023-11-12 02:25:52,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=299, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2023-11-12 02:25:52,971 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places. [2023-11-12 02:25:52,971 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 299 flow [2023-11-12 02:25:52,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 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) [2023-11-12 02:25:52,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:25:52,972 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:25:52,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:25:52,972 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-12 02:25:52,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:52,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1389569727, now seen corresponding path program 1 times [2023-11-12 02:25:52,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:52,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049303226] [2023-11-12 02:25:52,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:52,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:53,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:25:53,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:53,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049303226] [2023-11-12 02:25:53,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049303226] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:53,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:53,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:25:53,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864742735] [2023-11-12 02:25:53,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:53,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:25:53,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:53,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:25:53,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:25:53,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 245 [2023-11-12 02:25:53,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 299 flow. Second operand has 4 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 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) [2023-11-12 02:25:53,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:25:53,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 245 [2023-11-12 02:25:53,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:25:54,242 INFO L124 PetriNetUnfolderBase]: 3989/6349 cut-off events. [2023-11-12 02:25:54,242 INFO L125 PetriNetUnfolderBase]: For 12352/12540 co-relation queries the response was YES. [2023-11-12 02:25:54,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23977 conditions, 6349 events. 3989/6349 cut-off events. For 12352/12540 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 38695 event pairs, 705 based on Foata normal form. 121/6320 useless extension candidates. Maximal degree in co-relation 23954. Up to 3307 conditions per place. [2023-11-12 02:25:54,294 INFO L140 encePairwiseOnDemand]: 242/245 looper letters, 70 selfloop transitions, 4 changer transitions 18/103 dead transitions. [2023-11-12 02:25:54,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 103 transitions, 785 flow [2023-11-12 02:25:54,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:25:54,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:25:54,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 515 transitions. [2023-11-12 02:25:54,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5255102040816326 [2023-11-12 02:25:54,297 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 515 transitions. [2023-11-12 02:25:54,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 515 transitions. [2023-11-12 02:25:54,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:25:54,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 515 transitions. [2023-11-12 02:25:54,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:25:54,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 245.0) internal successors, (1225), 5 states have internal predecessors, (1225), 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) [2023-11-12 02:25:54,303 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 245.0) internal successors, (1225), 5 states have internal predecessors, (1225), 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) [2023-11-12 02:25:54,303 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 299 flow. Second operand 4 states and 515 transitions. [2023-11-12 02:25:54,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 103 transitions, 785 flow [2023-11-12 02:25:54,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 103 transitions, 745 flow, removed 20 selfloop flow, removed 3 redundant places. [2023-11-12 02:25:54,371 INFO L231 Difference]: Finished difference. Result has 55 places, 53 transitions, 330 flow [2023-11-12 02:25:54,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=330, PETRI_PLACES=55, PETRI_TRANSITIONS=53} [2023-11-12 02:25:54,372 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places. [2023-11-12 02:25:54,373 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 330 flow [2023-11-12 02:25:54,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 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) [2023-11-12 02:25:54,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:25:54,374 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:25:54,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:25:54,374 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-12 02:25:54,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:54,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1177048007, now seen corresponding path program 2 times [2023-11-12 02:25:54,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:54,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940146678] [2023-11-12 02:25:54,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:54,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:54,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:54,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:25:54,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:54,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940146678] [2023-11-12 02:25:54,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940146678] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:54,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:54,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:25:54,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337964441] [2023-11-12 02:25:54,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:54,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:25:54,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:54,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:25:54,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:25:54,697 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 245 [2023-11-12 02:25:54,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 330 flow. Second operand has 6 states, 6 states have (on average 114.83333333333333) internal successors, (689), 6 states have internal predecessors, (689), 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) [2023-11-12 02:25:54,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:25:54,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 245 [2023-11-12 02:25:54,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:25:55,557 INFO L124 PetriNetUnfolderBase]: 3102/5049 cut-off events. [2023-11-12 02:25:55,558 INFO L125 PetriNetUnfolderBase]: For 7318/7489 co-relation queries the response was YES. [2023-11-12 02:25:55,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17577 conditions, 5049 events. 3102/5049 cut-off events. For 7318/7489 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 31213 event pairs, 353 based on Foata normal form. 407/5327 useless extension candidates. Maximal degree in co-relation 17554. Up to 1544 conditions per place. [2023-11-12 02:25:55,593 INFO L140 encePairwiseOnDemand]: 238/245 looper letters, 81 selfloop transitions, 17 changer transitions 24/139 dead transitions. [2023-11-12 02:25:55,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 139 transitions, 1034 flow [2023-11-12 02:25:55,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:25:55,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:25:55,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 876 transitions. [2023-11-12 02:25:55,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5107871720116618 [2023-11-12 02:25:55,598 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 876 transitions. [2023-11-12 02:25:55,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 876 transitions. [2023-11-12 02:25:55,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:25:55,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 876 transitions. [2023-11-12 02:25:55,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.14285714285714) internal successors, (876), 7 states have internal predecessors, (876), 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) [2023-11-12 02:25:55,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 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) [2023-11-12 02:25:55,611 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 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) [2023-11-12 02:25:55,611 INFO L175 Difference]: Start difference. First operand has 55 places, 53 transitions, 330 flow. Second operand 7 states and 876 transitions. [2023-11-12 02:25:55,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 139 transitions, 1034 flow [2023-11-12 02:25:55,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 139 transitions, 1028 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-12 02:25:55,632 INFO L231 Difference]: Finished difference. Result has 63 places, 61 transitions, 457 flow [2023-11-12 02:25:55,633 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=457, PETRI_PLACES=63, PETRI_TRANSITIONS=61} [2023-11-12 02:25:55,635 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 22 predicate places. [2023-11-12 02:25:55,636 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 61 transitions, 457 flow [2023-11-12 02:25:55,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.83333333333333) internal successors, (689), 6 states have internal predecessors, (689), 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) [2023-11-12 02:25:55,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:25:55,637 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] [2023-11-12 02:25:55,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:25:55,637 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-12 02:25:55,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:55,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1205735811, now seen corresponding path program 1 times [2023-11-12 02:25:55,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:55,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355341526] [2023-11-12 02:25:55,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:55,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:55,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:55,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:25:55,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:55,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355341526] [2023-11-12 02:25:55,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355341526] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:55,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:55,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:25:55,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199721653] [2023-11-12 02:25:55,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:55,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:25:55,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:55,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:25:55,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:25:55,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 245 [2023-11-12 02:25:55,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 61 transitions, 457 flow. Second operand has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 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) [2023-11-12 02:25:55,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:25:55,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 245 [2023-11-12 02:25:55,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:25:57,149 INFO L124 PetriNetUnfolderBase]: 5147/8122 cut-off events. [2023-11-12 02:25:57,149 INFO L125 PetriNetUnfolderBase]: For 24005/24005 co-relation queries the response was YES. [2023-11-12 02:25:57,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34663 conditions, 8122 events. 5147/8122 cut-off events. For 24005/24005 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 48698 event pairs, 1257 based on Foata normal form. 12/8134 useless extension candidates. Maximal degree in co-relation 34636. Up to 4464 conditions per place. [2023-11-12 02:25:57,186 INFO L140 encePairwiseOnDemand]: 239/245 looper letters, 70 selfloop transitions, 11 changer transitions 33/114 dead transitions. [2023-11-12 02:25:57,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 114 transitions, 1071 flow [2023-11-12 02:25:57,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:25:57,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:25:57,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 493 transitions. [2023-11-12 02:25:57,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.503061224489796 [2023-11-12 02:25:57,189 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 493 transitions. [2023-11-12 02:25:57,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 493 transitions. [2023-11-12 02:25:57,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:25:57,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 493 transitions. [2023-11-12 02:25:57,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 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) [2023-11-12 02:25:57,195 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 245.0) internal successors, (1225), 5 states have internal predecessors, (1225), 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) [2023-11-12 02:25:57,196 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 245.0) internal successors, (1225), 5 states have internal predecessors, (1225), 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) [2023-11-12 02:25:57,196 INFO L175 Difference]: Start difference. First operand has 63 places, 61 transitions, 457 flow. Second operand 4 states and 493 transitions. [2023-11-12 02:25:57,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 114 transitions, 1071 flow [2023-11-12 02:25:57,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 114 transitions, 954 flow, removed 46 selfloop flow, removed 2 redundant places. [2023-11-12 02:25:57,539 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 394 flow [2023-11-12 02:25:57,540 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=394, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2023-11-12 02:25:57,541 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 25 predicate places. [2023-11-12 02:25:57,541 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 394 flow [2023-11-12 02:25:57,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 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) [2023-11-12 02:25:57,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:25:57,542 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] [2023-11-12 02:25:57,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 02:25:57,542 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-12 02:25:57,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:57,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1482134348, now seen corresponding path program 1 times [2023-11-12 02:25:57,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:57,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993280985] [2023-11-12 02:25:57,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:57,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:57,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:57,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:25:57,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:57,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993280985] [2023-11-12 02:25:57,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993280985] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:57,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:57,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:25:57,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770959054] [2023-11-12 02:25:57,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:57,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:25:57,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:57,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:25:57,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:25:57,842 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 245 [2023-11-12 02:25:57,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 394 flow. Second operand has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 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) [2023-11-12 02:25:57,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:25:57,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 245 [2023-11-12 02:25:57,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:25:58,736 INFO L124 PetriNetUnfolderBase]: 3595/6109 cut-off events. [2023-11-12 02:25:58,736 INFO L125 PetriNetUnfolderBase]: For 12179/12361 co-relation queries the response was YES. [2023-11-12 02:25:58,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23018 conditions, 6109 events. 3595/6109 cut-off events. For 12179/12361 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 40295 event pairs, 930 based on Foata normal form. 41/6001 useless extension candidates. Maximal degree in co-relation 22988. Up to 3057 conditions per place. [2023-11-12 02:25:58,763 INFO L140 encePairwiseOnDemand]: 242/245 looper letters, 66 selfloop transitions, 3 changer transitions 27/104 dead transitions. [2023-11-12 02:25:58,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 104 transitions, 862 flow [2023-11-12 02:25:58,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:25:58,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:25:58,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 514 transitions. [2023-11-12 02:25:58,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5244897959183673 [2023-11-12 02:25:58,767 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 514 transitions. [2023-11-12 02:25:58,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 514 transitions. [2023-11-12 02:25:58,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:25:58,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 514 transitions. [2023-11-12 02:25:58,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 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) [2023-11-12 02:25:58,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 245.0) internal successors, (1225), 5 states have internal predecessors, (1225), 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) [2023-11-12 02:25:58,773 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 245.0) internal successors, (1225), 5 states have internal predecessors, (1225), 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) [2023-11-12 02:25:58,773 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 394 flow. Second operand 4 states and 514 transitions. [2023-11-12 02:25:58,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 104 transitions, 862 flow [2023-11-12 02:25:58,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 104 transitions, 837 flow, removed 9 selfloop flow, removed 3 redundant places. [2023-11-12 02:25:58,891 INFO L231 Difference]: Finished difference. Result has 65 places, 51 transitions, 353 flow [2023-11-12 02:25:58,891 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=353, PETRI_PLACES=65, PETRI_TRANSITIONS=51} [2023-11-12 02:25:58,892 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 24 predicate places. [2023-11-12 02:25:58,892 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 51 transitions, 353 flow [2023-11-12 02:25:58,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 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) [2023-11-12 02:25:58,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:25:58,893 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] [2023-11-12 02:25:58,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 02:25:58,893 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-12 02:25:58,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:25:58,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1067057229, now seen corresponding path program 2 times [2023-11-12 02:25:58,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:25:58,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150433134] [2023-11-12 02:25:58,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:25:58,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:25:58,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:25:59,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:25:59,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:25:59,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150433134] [2023-11-12 02:25:59,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150433134] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:25:59,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:25:59,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:25:59,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253335175] [2023-11-12 02:25:59,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:25:59,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:25:59,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:25:59,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:25:59,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:25:59,540 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 245 [2023-11-12 02:25:59,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 51 transitions, 353 flow. Second operand has 6 states, 6 states have (on average 116.33333333333333) internal successors, (698), 6 states have internal predecessors, (698), 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) [2023-11-12 02:25:59,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:25:59,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 245 [2023-11-12 02:25:59,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:26:00,754 INFO L124 PetriNetUnfolderBase]: 3587/6372 cut-off events. [2023-11-12 02:26:00,754 INFO L125 PetriNetUnfolderBase]: For 13838/13936 co-relation queries the response was YES. [2023-11-12 02:26:00,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24045 conditions, 6372 events. 3587/6372 cut-off events. For 13838/13936 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 46035 event pairs, 512 based on Foata normal form. 15/6176 useless extension candidates. Maximal degree in co-relation 24016. Up to 2400 conditions per place. [2023-11-12 02:26:00,778 INFO L140 encePairwiseOnDemand]: 238/245 looper letters, 79 selfloop transitions, 7 changer transitions 55/151 dead transitions. [2023-11-12 02:26:00,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 151 transitions, 1275 flow [2023-11-12 02:26:00,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:26:00,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:26:00,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 861 transitions. [2023-11-12 02:26:00,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5020408163265306 [2023-11-12 02:26:00,787 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 861 transitions. [2023-11-12 02:26:00,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 861 transitions. [2023-11-12 02:26:00,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:26:00,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 861 transitions. [2023-11-12 02:26:00,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.0) internal successors, (861), 7 states have internal predecessors, (861), 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) [2023-11-12 02:26:00,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 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) [2023-11-12 02:26:00,797 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 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) [2023-11-12 02:26:00,798 INFO L175 Difference]: Start difference. First operand has 65 places, 51 transitions, 353 flow. Second operand 7 states and 861 transitions. [2023-11-12 02:26:00,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 151 transitions, 1275 flow [2023-11-12 02:26:00,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 151 transitions, 1253 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-12 02:26:00,931 INFO L231 Difference]: Finished difference. Result has 71 places, 56 transitions, 394 flow [2023-11-12 02:26:00,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=394, PETRI_PLACES=71, PETRI_TRANSITIONS=56} [2023-11-12 02:26:00,933 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 30 predicate places. [2023-11-12 02:26:00,933 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 56 transitions, 394 flow [2023-11-12 02:26:00,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.33333333333333) internal successors, (698), 6 states have internal predecessors, (698), 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) [2023-11-12 02:26:00,934 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:26:00,934 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] [2023-11-12 02:26:00,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 02:26:00,934 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-12 02:26:00,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:26:00,935 INFO L85 PathProgramCache]: Analyzing trace with hash -399260426, now seen corresponding path program 2 times [2023-11-12 02:26:00,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:26:00,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917819304] [2023-11-12 02:26:00,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:26:00,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:26:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:26:01,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:26:01,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:26:01,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917819304] [2023-11-12 02:26:01,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917819304] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:26:01,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:26:01,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:26:01,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136302996] [2023-11-12 02:26:01,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:26:01,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:26:01,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:26:01,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:26:01,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:26:01,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 245 [2023-11-12 02:26:01,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 56 transitions, 394 flow. Second operand has 7 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 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) [2023-11-12 02:26:01,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:26:01,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 245 [2023-11-12 02:26:01,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:26:02,254 INFO L124 PetriNetUnfolderBase]: 2786/4853 cut-off events. [2023-11-12 02:26:02,255 INFO L125 PetriNetUnfolderBase]: For 10165/10342 co-relation queries the response was YES. [2023-11-12 02:26:02,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19269 conditions, 4853 events. 2786/4853 cut-off events. For 10165/10342 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 33412 event pairs, 320 based on Foata normal form. 202/4903 useless extension candidates. Maximal degree in co-relation 19240. Up to 1653 conditions per place. [2023-11-12 02:26:02,287 INFO L140 encePairwiseOnDemand]: 238/245 looper letters, 40 selfloop transitions, 17 changer transitions 63/124 dead transitions. [2023-11-12 02:26:02,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 124 transitions, 1043 flow [2023-11-12 02:26:02,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:26:02,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-12 02:26:02,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 977 transitions. [2023-11-12 02:26:02,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.498469387755102 [2023-11-12 02:26:02,294 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 977 transitions. [2023-11-12 02:26:02,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 977 transitions. [2023-11-12 02:26:02,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:26:02,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 977 transitions. [2023-11-12 02:26:02,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 122.125) internal successors, (977), 8 states have internal predecessors, (977), 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) [2023-11-12 02:26:02,306 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 245.0) internal successors, (2205), 9 states have internal predecessors, (2205), 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) [2023-11-12 02:26:02,307 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 245.0) internal successors, (2205), 9 states have internal predecessors, (2205), 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) [2023-11-12 02:26:02,308 INFO L175 Difference]: Start difference. First operand has 71 places, 56 transitions, 394 flow. Second operand 8 states and 977 transitions. [2023-11-12 02:26:02,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 124 transitions, 1043 flow [2023-11-12 02:26:02,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 124 transitions, 1020 flow, removed 10 selfloop flow, removed 3 redundant places. [2023-11-12 02:26:02,548 INFO L231 Difference]: Finished difference. Result has 76 places, 40 transitions, 282 flow [2023-11-12 02:26:02,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=282, PETRI_PLACES=76, PETRI_TRANSITIONS=40} [2023-11-12 02:26:02,549 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 35 predicate places. [2023-11-12 02:26:02,550 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 40 transitions, 282 flow [2023-11-12 02:26:02,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 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) [2023-11-12 02:26:02,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:26:02,551 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] [2023-11-12 02:26:02,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-12 02:26:02,551 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-12 02:26:02,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:26:02,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1732618228, now seen corresponding path program 1 times [2023-11-12 02:26:02,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:26:02,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918949506] [2023-11-12 02:26:02,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:26:02,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:26:02,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:26:02,622 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 02:26:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 02:26:02,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-12 02:26:02,745 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-12 02:26:02,747 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-12 02:26:02,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-12 02:26:02,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-12 02:26:02,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-12 02:26:02,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-12 02:26:02,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-12 02:26:02,753 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-12 02:26:02,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-12 02:26:02,753 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:26:02,763 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-12 02:26:02,763 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 02:26:02,842 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-12 02:26:02,844 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-12 02:26:02,846 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-12 02:26:02,849 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-12 02:26:02,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:26:02 BasicIcfg [2023-11-12 02:26:02,875 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 02:26:02,875 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:26:02,876 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:26:02,876 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:26:02,877 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:25:35" (3/4) ... [2023-11-12 02:26:02,878 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-12 02:26:02,914 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-12 02:26:02,915 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-12 02:26:02,916 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-12 02:26:02,918 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-12 02:26:02,993 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87d521f3-ce1f-40f3-82ac-32bcf4a4dfa9/bin/uautomizer-verify-uTZkv6EMXl/witness.graphml [2023-11-12 02:26:02,993 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:26:02,994 INFO L158 Benchmark]: Toolchain (without parser) took 29278.22ms. Allocated memory was 159.4MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 126.2MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 675.3MB. Max. memory is 16.1GB. [2023-11-12 02:26:02,994 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 113.2MB. Free memory is still 67.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:26:02,995 INFO L158 Benchmark]: CACSL2BoogieTranslator took 653.60ms. Allocated memory is still 159.4MB. Free memory was 125.7MB in the beginning and 102.4MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-12 02:26:02,995 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.36ms. Allocated memory is still 159.4MB. Free memory was 102.4MB in the beginning and 99.8MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-12 02:26:02,996 INFO L158 Benchmark]: Boogie Preprocessor took 40.36ms. Allocated memory is still 159.4MB. Free memory was 99.8MB in the beginning and 97.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:26:02,996 INFO L158 Benchmark]: RCFGBuilder took 830.92ms. Allocated memory is still 159.4MB. Free memory was 97.7MB in the beginning and 127.1MB in the end (delta: -29.5MB). Peak memory consumption was 42.1MB. Max. memory is 16.1GB. [2023-11-12 02:26:02,997 INFO L158 Benchmark]: TraceAbstraction took 27558.44ms. Allocated memory was 159.4MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 126.4MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 658.4MB. Max. memory is 16.1GB. [2023-11-12 02:26:02,997 INFO L158 Benchmark]: Witness Printer took 117.64ms. Allocated memory is still 2.2GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-12 02:26:02,999 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 113.2MB. Free memory is still 67.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 653.60ms. Allocated memory is still 159.4MB. Free memory was 125.7MB in the beginning and 102.4MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.36ms. Allocated memory is still 159.4MB. Free memory was 102.4MB in the beginning and 99.8MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.36ms. Allocated memory is still 159.4MB. Free memory was 99.8MB in the beginning and 97.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 830.92ms. Allocated memory is still 159.4MB. Free memory was 97.7MB in the beginning and 127.1MB in the end (delta: -29.5MB). Peak memory consumption was 42.1MB. Max. memory is 16.1GB. * TraceAbstraction took 27558.44ms. Allocated memory was 159.4MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 126.4MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 658.4MB. Max. memory is 16.1GB. * Witness Printer took 117.64ms. Allocated memory is still 2.2GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 139 PlacesBefore, 41 PlacesAfterwards, 128 TransitionsBefore, 29 TransitionsAfterwards, 3076 CoEnabledTransitionPairs, 6 FixpointIterations, 42 TrivialSequentialCompositions, 61 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 113 TotalNumberOfCompositions, 7377 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3006, independent: 2818, independent conditional: 0, independent unconditional: 2818, dependent: 188, dependent conditional: 0, dependent unconditional: 188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1672, independent: 1630, independent conditional: 0, independent unconditional: 1630, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3006, independent: 1188, independent conditional: 0, independent unconditional: 1188, dependent: 146, dependent conditional: 0, dependent unconditional: 146, unknown: 1672, unknown conditional: 0, unknown unconditional: 1672] , Statistics on independence cache: Total cache size (in pairs): 139, Positive cache size: 120, Positive conditional cache size: 0, Positive unconditional cache size: 120, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff0_thd4; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$r_buff1_thd4; [L739] 0 _Bool y$read_delayed; [L740] 0 int *y$read_delayed_var; [L741] 0 int y$w_buff0; [L742] 0 _Bool y$w_buff0_used; [L743] 0 int y$w_buff1; [L744] 0 _Bool y$w_buff1_used; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L856] 0 pthread_t t693; [L857] FCALL, FORK 0 pthread_create(&t693, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t693={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L858] 0 pthread_t t694; [L859] FCALL, FORK 0 pthread_create(&t694, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t693={5:0}, t694={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L860] 0 pthread_t t695; [L861] FCALL, FORK 0 pthread_create(&t695, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t693={5:0}, t694={6:0}, t695={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L862] 0 pthread_t t696; [L795] 3 y$w_buff1 = y$w_buff0 [L796] 3 y$w_buff0 = 1 [L797] 3 y$w_buff1_used = y$w_buff0_used [L798] 3 y$w_buff0_used = (_Bool)1 [L799] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L799] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L800] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L801] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L802] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L803] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L804] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L805] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L863] FCALL, FORK 0 pthread_create(&t696, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t693={5:0}, t694={6:0}, t695={7:0}, t696={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L808] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L825] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L828] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L831] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L767] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 y$flush_delayed = weak$$choice2 [L773] 2 y$mem_tmp = y [L774] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L775] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L776] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L777] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L778] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L780] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 __unbuffered_p1_EAX = y [L782] 2 y = y$flush_delayed ? y$mem_tmp : y [L783] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L811] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L813] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L814] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L815] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L834] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L835] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L836] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L837] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L838] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 2 return 0; [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L870] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L871] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L872] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L873] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t693={5:0}, t694={6:0}, t695={7:0}, t696={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L876] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L878] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 167 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 27.3s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 17.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 573 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 464 mSDsluCounter, 138 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 66 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1352 IncrementalHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 72 mSDtfsCounter, 1352 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=457occurred in iteration=8, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 233 NumberOfCodeBlocks, 233 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 195 ConstructedInterpolants, 0 QuantifiedInterpolants, 950 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-12 02:26:03,031 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_87d521f3-ce1f-40f3-82ac-32bcf4a4dfa9/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE