./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix008_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff 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_91a65802-fc22-4e9a-a850-ce888c9eeed9/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a65802-fc22-4e9a-a850-ce888c9eeed9/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a65802-fc22-4e9a-a850-ce888c9eeed9/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a65802-fc22-4e9a-a850-ce888c9eeed9/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix008_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a65802-fc22-4e9a-a850-ce888c9eeed9/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a65802-fc22-4e9a-a850-ce888c9eeed9/bin/uautomizer-verify-uCwYo4JHxu --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 5babed9169ff1f82a919f6310b42a42108866edd5cf3c99389faf03347963192 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:48:31,623 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:48:31,690 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a65802-fc22-4e9a-a850-ce888c9eeed9/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:48:31,696 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:48:31,697 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:48:31,723 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:48:31,724 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:48:31,725 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:48:31,726 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:48:31,726 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:48:31,727 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:48:31,728 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:48:31,728 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:48:31,729 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:48:31,729 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:48:31,730 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:48:31,730 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:48:31,731 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:48:31,731 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:48:31,732 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:48:31,732 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:48:31,733 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:48:31,733 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:48:31,734 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:48:31,734 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:48:31,735 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:48:31,735 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:48:31,735 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:48:31,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:48:31,736 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:48:31,737 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:48:31,737 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:48:31,737 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:48:31,738 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:48:31,738 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:48:31,739 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:48:31,739 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:48:31,739 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:48:31,740 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:48:31,740 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_91a65802-fc22-4e9a-a850-ce888c9eeed9/bin/uautomizer-verify-uCwYo4JHxu/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_91a65802-fc22-4e9a-a850-ce888c9eeed9/bin/uautomizer-verify-uCwYo4JHxu 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 -> 5babed9169ff1f82a919f6310b42a42108866edd5cf3c99389faf03347963192 [2023-11-19 07:48:32,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:48:32,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:48:32,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:48:32,125 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:48:32,126 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:48:32,128 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a65802-fc22-4e9a-a850-ce888c9eeed9/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/mix008_tso.oepc.i [2023-11-19 07:48:35,315 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:48:35,677 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:48:35,678 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a65802-fc22-4e9a-a850-ce888c9eeed9/sv-benchmarks/c/pthread-wmm/mix008_tso.oepc.i [2023-11-19 07:48:35,708 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a65802-fc22-4e9a-a850-ce888c9eeed9/bin/uautomizer-verify-uCwYo4JHxu/data/d026c85ba/f46c0442f24144eeb8d573b27c0ba855/FLAG41cf890b9 [2023-11-19 07:48:35,728 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a65802-fc22-4e9a-a850-ce888c9eeed9/bin/uautomizer-verify-uCwYo4JHxu/data/d026c85ba/f46c0442f24144eeb8d573b27c0ba855 [2023-11-19 07:48:35,739 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:48:35,742 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:48:35,744 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:48:35,745 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:48:35,751 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:48:35,755 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:48:35" (1/1) ... [2023-11-19 07:48:35,756 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6edaedb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:35, skipping insertion in model container [2023-11-19 07:48:35,757 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:48:35" (1/1) ... [2023-11-19 07:48:35,835 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:48:36,055 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_91a65802-fc22-4e9a-a850-ce888c9eeed9/sv-benchmarks/c/pthread-wmm/mix008_tso.oepc.i[949,962] [2023-11-19 07:48:36,374 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:48:36,392 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:48:36,406 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_91a65802-fc22-4e9a-a850-ce888c9eeed9/sv-benchmarks/c/pthread-wmm/mix008_tso.oepc.i[949,962] [2023-11-19 07:48:36,528 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:48:36,575 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:48:36,576 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:48:36,584 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:48:36,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:36 WrapperNode [2023-11-19 07:48:36,585 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:48:36,586 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:48:36,586 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:48:36,586 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:48:36,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:36" (1/1) ... [2023-11-19 07:48:36,615 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:36" (1/1) ... [2023-11-19 07:48:36,679 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 281 [2023-11-19 07:48:36,687 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:48:36,688 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:48:36,688 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:48:36,688 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:48:36,698 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:36" (1/1) ... [2023-11-19 07:48:36,699 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:36" (1/1) ... [2023-11-19 07:48:36,705 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:36" (1/1) ... [2023-11-19 07:48:36,705 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:36" (1/1) ... [2023-11-19 07:48:36,721 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:36" (1/1) ... [2023-11-19 07:48:36,724 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:36" (1/1) ... [2023-11-19 07:48:36,728 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:36" (1/1) ... [2023-11-19 07:48:36,731 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:36" (1/1) ... [2023-11-19 07:48:36,738 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:48:36,739 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:48:36,739 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:48:36,739 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:48:36,740 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:36" (1/1) ... [2023-11-19 07:48:36,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:48:36,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a65802-fc22-4e9a-a850-ce888c9eeed9/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:48:36,788 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a65802-fc22-4e9a-a850-ce888c9eeed9/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:48:36,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a65802-fc22-4e9a-a850-ce888c9eeed9/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:48:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:48:36,862 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:48:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:48:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:48:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:48:36,863 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 07:48:36,863 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 07:48:36,864 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 07:48:36,864 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 07:48:36,864 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 07:48:36,866 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 07:48:36,866 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-19 07:48:36,867 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-19 07:48:36,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:48:36,868 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:48:36,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:48:36,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:48:36,871 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 07:48:37,158 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:48:37,161 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:48:37,850 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:48:38,168 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:48:38,169 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:48:38,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:48:38 BoogieIcfgContainer [2023-11-19 07:48:38,173 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:48:38,176 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:48:38,176 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:48:38,179 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:48:38,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:48:35" (1/3) ... [2023-11-19 07:48:38,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b800648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:48:38, skipping insertion in model container [2023-11-19 07:48:38,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:48:36" (2/3) ... [2023-11-19 07:48:38,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b800648 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:48:38, skipping insertion in model container [2023-11-19 07:48:38,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:48:38" (3/3) ... [2023-11-19 07:48:38,183 INFO L112 eAbstractionObserver]: Analyzing ICFG mix008_tso.oepc.i [2023-11-19 07:48:38,193 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 07:48:38,227 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:48:38,227 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-11-19 07:48:38,227 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:48:38,300 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:48:38,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 154 transitions, 324 flow [2023-11-19 07:48:38,412 INFO L124 PetriNetUnfolderBase]: 2/150 cut-off events. [2023-11-19 07:48:38,412 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:48:38,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 150 events. 2/150 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 94. Up to 2 conditions per place. [2023-11-19 07:48:38,420 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 154 transitions, 324 flow [2023-11-19 07:48:38,426 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 150 transitions, 312 flow [2023-11-19 07:48:38,430 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:48:38,441 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 150 transitions, 312 flow [2023-11-19 07:48:38,444 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 150 transitions, 312 flow [2023-11-19 07:48:38,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 150 transitions, 312 flow [2023-11-19 07:48:38,484 INFO L124 PetriNetUnfolderBase]: 2/150 cut-off events. [2023-11-19 07:48:38,485 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:48:38,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 150 events. 2/150 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 94. Up to 2 conditions per place. [2023-11-19 07:48:38,489 INFO L119 LiptonReduction]: Number of co-enabled transitions 3620 [2023-11-19 07:48:45,622 INFO L134 LiptonReduction]: Checked pairs total: 9915 [2023-11-19 07:48:45,623 INFO L136 LiptonReduction]: Total number of compositions: 129 [2023-11-19 07:48:45,638 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:48:45,645 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;@1946ac2a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:48:45,645 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-11-19 07:48:45,651 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:48:45,651 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-11-19 07:48:45,651 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:48:45,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:48:45,652 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:48:45,653 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-11-19 07:48:45,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:45,658 INFO L85 PathProgramCache]: Analyzing trace with hash -256297982, now seen corresponding path program 1 times [2023-11-19 07:48:45,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:45,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775397293] [2023-11-19 07:48:45,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:45,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:45,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:46,364 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-19 07:48:46,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:46,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775397293] [2023-11-19 07:48:46,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775397293] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:46,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:48:46,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:48:46,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579546207] [2023-11-19 07:48:46,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:46,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:48:46,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:46,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:48:46,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:48:46,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 283 [2023-11-19 07:48:46,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 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-19 07:48:46,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:48:46,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 283 [2023-11-19 07:48:46,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:48:49,241 INFO L124 PetriNetUnfolderBase]: 9255/12494 cut-off events. [2023-11-19 07:48:49,242 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2023-11-19 07:48:49,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25130 conditions, 12494 events. 9255/12494 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 68272 event pairs, 1135 based on Foata normal form. 432/11542 useless extension candidates. Maximal degree in co-relation 25118. Up to 10761 conditions per place. [2023-11-19 07:48:49,357 INFO L140 encePairwiseOnDemand]: 279/283 looper letters, 45 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2023-11-19 07:48:49,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 50 transitions, 209 flow [2023-11-19 07:48:49,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:48:49,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:48:49,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions. [2023-11-19 07:48:49,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5323910482921084 [2023-11-19 07:48:49,380 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 452 transitions. [2023-11-19 07:48:49,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 452 transitions. [2023-11-19 07:48:49,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:48:49,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 452 transitions. [2023-11-19 07:48:49,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 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-19 07:48:49,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 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-19 07:48:49,403 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 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-19 07:48:49,405 INFO L175 Difference]: Start difference. First operand has 46 places, 34 transitions, 80 flow. Second operand 3 states and 452 transitions. [2023-11-19 07:48:49,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 50 transitions, 209 flow [2023-11-19 07:48:49,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 50 transitions, 204 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-19 07:48:49,414 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 76 flow [2023-11-19 07:48:49,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2023-11-19 07:48:49,424 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -3 predicate places. [2023-11-19 07:48:49,425 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 76 flow [2023-11-19 07:48:49,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 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-19 07:48:49,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:48:49,426 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:48:49,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:48:49,427 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-11-19 07:48:49,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:49,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1489150995, now seen corresponding path program 1 times [2023-11-19 07:48:49,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:49,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222148579] [2023-11-19 07:48:49,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:49,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:49,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:49,689 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-19 07:48:49,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:49,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222148579] [2023-11-19 07:48:49,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222148579] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:49,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:48:49,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:48:49,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847631521] [2023-11-19 07:48:49,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:49,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:48:49,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:49,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:48:49,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:48:49,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 283 [2023-11-19 07:48:49,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 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-19 07:48:49,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:48:49,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 283 [2023-11-19 07:48:49,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:48:52,116 INFO L124 PetriNetUnfolderBase]: 7689/10892 cut-off events. [2023-11-19 07:48:52,117 INFO L125 PetriNetUnfolderBase]: For 435/435 co-relation queries the response was YES. [2023-11-19 07:48:52,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21900 conditions, 10892 events. 7689/10892 cut-off events. For 435/435 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 61675 event pairs, 1425 based on Foata normal form. 0/10168 useless extension candidates. Maximal degree in co-relation 21890. Up to 8281 conditions per place. [2023-11-19 07:48:52,223 INFO L140 encePairwiseOnDemand]: 280/283 looper letters, 38 selfloop transitions, 2 changer transitions 4/47 dead transitions. [2023-11-19 07:48:52,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 47 transitions, 196 flow [2023-11-19 07:48:52,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:48:52,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:48:52,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 447 transitions. [2023-11-19 07:48:52,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5265017667844523 [2023-11-19 07:48:52,229 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 447 transitions. [2023-11-19 07:48:52,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 447 transitions. [2023-11-19 07:48:52,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:48:52,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 447 transitions. [2023-11-19 07:48:52,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 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-19 07:48:52,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 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-19 07:48:52,242 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 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-19 07:48:52,242 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 76 flow. Second operand 3 states and 447 transitions. [2023-11-19 07:48:52,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 47 transitions, 196 flow [2023-11-19 07:48:52,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 47 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:48:52,249 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 70 flow [2023-11-19 07:48:52,255 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-11-19 07:48:52,257 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -4 predicate places. [2023-11-19 07:48:52,257 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 70 flow [2023-11-19 07:48:52,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 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-19 07:48:52,258 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:48:52,258 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:48:52,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:48:52,258 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-11-19 07:48:52,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:52,262 INFO L85 PathProgramCache]: Analyzing trace with hash -576526892, now seen corresponding path program 1 times [2023-11-19 07:48:52,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:52,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206349332] [2023-11-19 07:48:52,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:52,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:52,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:53,357 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-19 07:48:53,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:53,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206349332] [2023-11-19 07:48:53,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206349332] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:53,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:48:53,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:48:53,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217476049] [2023-11-19 07:48:53,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:53,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:48:53,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:53,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:48:53,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:48:53,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 283 [2023-11-19 07:48:53,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 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-19 07:48:53,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:48:53,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 283 [2023-11-19 07:48:53,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:48:57,002 INFO L124 PetriNetUnfolderBase]: 12215/16740 cut-off events. [2023-11-19 07:48:57,002 INFO L125 PetriNetUnfolderBase]: For 672/672 co-relation queries the response was YES. [2023-11-19 07:48:57,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34482 conditions, 16740 events. 12215/16740 cut-off events. For 672/672 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 88596 event pairs, 2199 based on Foata normal form. 768/17504 useless extension candidates. Maximal degree in co-relation 34472. Up to 9377 conditions per place. [2023-11-19 07:48:57,111 INFO L140 encePairwiseOnDemand]: 270/283 looper letters, 49 selfloop transitions, 11 changer transitions 41/102 dead transitions. [2023-11-19 07:48:57,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 102 transitions, 432 flow [2023-11-19 07:48:57,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:48:57,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:48:57,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 951 transitions. [2023-11-19 07:48:57,116 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48006057546693587 [2023-11-19 07:48:57,116 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 951 transitions. [2023-11-19 07:48:57,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 951 transitions. [2023-11-19 07:48:57,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:48:57,118 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 951 transitions. [2023-11-19 07:48:57,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.85714285714286) internal successors, (951), 7 states have internal predecessors, (951), 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-19 07:48:57,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 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-19 07:48:57,129 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 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-19 07:48:57,130 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 7 states and 951 transitions. [2023-11-19 07:48:57,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 102 transitions, 432 flow [2023-11-19 07:48:57,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 102 transitions, 418 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:48:57,139 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 172 flow [2023-11-19 07:48:57,140 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=172, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2023-11-19 07:48:57,141 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 4 predicate places. [2023-11-19 07:48:57,141 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 172 flow [2023-11-19 07:48:57,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 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-19 07:48:57,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:48:57,142 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:48:57,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:48:57,143 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-11-19 07:48:57,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:48:57,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1576876877, now seen corresponding path program 1 times [2023-11-19 07:48:57,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:48:57,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097984079] [2023-11-19 07:48:57,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:48:57,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:48:57,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:48:57,935 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-19 07:48:57,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:48:57,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097984079] [2023-11-19 07:48:57,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097984079] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:48:57,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:48:57,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:48:57,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276795968] [2023-11-19 07:48:57,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:48:57,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:48:57,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:48:57,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:48:57,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:48:58,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 283 [2023-11-19 07:48:58,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 172 flow. Second operand has 5 states, 5 states have (on average 123.8) internal successors, (619), 5 states have internal predecessors, (619), 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-19 07:48:58,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:48:58,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 283 [2023-11-19 07:48:58,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:49:00,499 INFO L124 PetriNetUnfolderBase]: 10871/15016 cut-off events. [2023-11-19 07:49:00,499 INFO L125 PetriNetUnfolderBase]: For 13896/13896 co-relation queries the response was YES. [2023-11-19 07:49:00,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46768 conditions, 15016 events. 10871/15016 cut-off events. For 13896/13896 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 77937 event pairs, 2551 based on Foata normal form. 576/15588 useless extension candidates. Maximal degree in co-relation 46752. Up to 7873 conditions per place. [2023-11-19 07:49:00,601 INFO L140 encePairwiseOnDemand]: 269/283 looper letters, 50 selfloop transitions, 19 changer transitions 39/109 dead transitions. [2023-11-19 07:49:00,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 109 transitions, 708 flow [2023-11-19 07:49:00,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:49:00,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:49:00,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 940 transitions. [2023-11-19 07:49:00,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4745078243311459 [2023-11-19 07:49:00,606 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 940 transitions. [2023-11-19 07:49:00,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 940 transitions. [2023-11-19 07:49:00,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:49:00,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 940 transitions. [2023-11-19 07:49:00,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.28571428571428) internal successors, (940), 7 states have internal predecessors, (940), 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-19 07:49:00,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 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-19 07:49:00,618 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 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-19 07:49:00,618 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 172 flow. Second operand 7 states and 940 transitions. [2023-11-19 07:49:00,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 109 transitions, 708 flow [2023-11-19 07:49:00,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 109 transitions, 696 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-19 07:49:00,704 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 365 flow [2023-11-19 07:49:00,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=365, PETRI_PLACES=57, PETRI_TRANSITIONS=52} [2023-11-19 07:49:00,705 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 11 predicate places. [2023-11-19 07:49:00,706 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 365 flow [2023-11-19 07:49:00,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.8) internal successors, (619), 5 states have internal predecessors, (619), 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-19 07:49:00,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:49:00,707 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:49:00,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:49:00,707 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-11-19 07:49:00,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:49:00,708 INFO L85 PathProgramCache]: Analyzing trace with hash -2034789234, now seen corresponding path program 1 times [2023-11-19 07:49:00,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:49:00,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926497470] [2023-11-19 07:49:00,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:49:00,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:49:00,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:01,383 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-19 07:49:01,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:49:01,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926497470] [2023-11-19 07:49:01,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926497470] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:49:01,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:49:01,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:49:01,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173855416] [2023-11-19 07:49:01,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:49:01,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:49:01,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:49:01,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:49:01,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:49:01,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 283 [2023-11-19 07:49:01,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 365 flow. Second operand has 6 states, 6 states have (on average 127.66666666666667) internal successors, (766), 6 states have internal predecessors, (766), 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-19 07:49:01,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:49:01,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 283 [2023-11-19 07:49:01,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:49:05,168 INFO L124 PetriNetUnfolderBase]: 15200/21273 cut-off events. [2023-11-19 07:49:05,169 INFO L125 PetriNetUnfolderBase]: For 43656/44004 co-relation queries the response was YES. [2023-11-19 07:49:05,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76586 conditions, 21273 events. 15200/21273 cut-off events. For 43656/44004 co-relation queries the response was YES. Maximal size of possible extension queue 610. Compared 116742 event pairs, 5421 based on Foata normal form. 608/21759 useless extension candidates. Maximal degree in co-relation 76564. Up to 9771 conditions per place. [2023-11-19 07:49:05,321 INFO L140 encePairwiseOnDemand]: 274/283 looper letters, 79 selfloop transitions, 18 changer transitions 34/134 dead transitions. [2023-11-19 07:49:05,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 134 transitions, 1071 flow [2023-11-19 07:49:05,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:49:05,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:49:05,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 977 transitions. [2023-11-19 07:49:05,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49318525996971224 [2023-11-19 07:49:05,328 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 977 transitions. [2023-11-19 07:49:05,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 977 transitions. [2023-11-19 07:49:05,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:49:05,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 977 transitions. [2023-11-19 07:49:05,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 139.57142857142858) internal successors, (977), 7 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-19 07:49:05,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 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-19 07:49:05,338 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 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-19 07:49:05,338 INFO L175 Difference]: Start difference. First operand has 57 places, 52 transitions, 365 flow. Second operand 7 states and 977 transitions. [2023-11-19 07:49:05,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 134 transitions, 1071 flow [2023-11-19 07:49:05,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 134 transitions, 1037 flow, removed 14 selfloop flow, removed 3 redundant places. [2023-11-19 07:49:05,662 INFO L231 Difference]: Finished difference. Result has 63 places, 63 transitions, 525 flow [2023-11-19 07:49:05,662 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=525, PETRI_PLACES=63, PETRI_TRANSITIONS=63} [2023-11-19 07:49:05,665 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 17 predicate places. [2023-11-19 07:49:05,665 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 63 transitions, 525 flow [2023-11-19 07:49:05,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.66666666666667) internal successors, (766), 6 states have internal predecessors, (766), 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-19 07:49:05,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:49:05,666 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:49:05,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:49:05,667 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-11-19 07:49:05,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:49:05,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1050627542, now seen corresponding path program 1 times [2023-11-19 07:49:05,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:49:05,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835088065] [2023-11-19 07:49:05,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:49:05,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:49:05,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:06,116 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-19 07:49:06,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:49:06,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835088065] [2023-11-19 07:49:06,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835088065] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:49:06,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:49:06,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:49:06,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733537249] [2023-11-19 07:49:06,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:49:06,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:49:06,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:49:06,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:49:06,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:49:06,137 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 283 [2023-11-19 07:49:06,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 63 transitions, 525 flow. Second operand has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 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-19 07:49:06,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:49:06,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 283 [2023-11-19 07:49:06,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:49:07,621 INFO L124 PetriNetUnfolderBase]: 5658/8158 cut-off events. [2023-11-19 07:49:07,621 INFO L125 PetriNetUnfolderBase]: For 28757/29898 co-relation queries the response was YES. [2023-11-19 07:49:07,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33468 conditions, 8158 events. 5658/8158 cut-off events. For 28757/29898 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 44379 event pairs, 1414 based on Foata normal form. 448/8383 useless extension candidates. Maximal degree in co-relation 33441. Up to 6904 conditions per place. [2023-11-19 07:49:07,690 INFO L140 encePairwiseOnDemand]: 277/283 looper letters, 76 selfloop transitions, 5 changer transitions 0/93 dead transitions. [2023-11-19 07:49:07,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 93 transitions, 893 flow [2023-11-19 07:49:07,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:49:07,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:49:07,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 437 transitions. [2023-11-19 07:49:07,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5147232037691402 [2023-11-19 07:49:07,699 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 437 transitions. [2023-11-19 07:49:07,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 437 transitions. [2023-11-19 07:49:07,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:49:07,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 437 transitions. [2023-11-19 07:49:07,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 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-19 07:49:07,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 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-19 07:49:07,705 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 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-19 07:49:07,706 INFO L175 Difference]: Start difference. First operand has 63 places, 63 transitions, 525 flow. Second operand 3 states and 437 transitions. [2023-11-19 07:49:07,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 93 transitions, 893 flow [2023-11-19 07:49:07,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 93 transitions, 867 flow, removed 13 selfloop flow, removed 3 redundant places. [2023-11-19 07:49:07,751 INFO L231 Difference]: Finished difference. Result has 61 places, 64 transitions, 510 flow [2023-11-19 07:49:07,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=510, PETRI_PLACES=61, PETRI_TRANSITIONS=64} [2023-11-19 07:49:07,754 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 15 predicate places. [2023-11-19 07:49:07,754 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 64 transitions, 510 flow [2023-11-19 07:49:07,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 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-19 07:49:07,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:49:07,755 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-19 07:49:07,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:49:07,755 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-11-19 07:49:07,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:49:07,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1665520183, now seen corresponding path program 1 times [2023-11-19 07:49:07,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:49:07,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799321273] [2023-11-19 07:49:07,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:49:07,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:49:07,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:08,199 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-19 07:49:08,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:49:08,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799321273] [2023-11-19 07:49:08,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799321273] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:49:08,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:49:08,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:49:08,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798833372] [2023-11-19 07:49:08,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:49:08,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:49:08,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:49:08,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:49:08,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:49:08,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 283 [2023-11-19 07:49:08,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 64 transitions, 510 flow. Second operand has 4 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 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-19 07:49:08,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:49:08,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 283 [2023-11-19 07:49:08,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:49:09,086 INFO L124 PetriNetUnfolderBase]: 2949/4502 cut-off events. [2023-11-19 07:49:09,087 INFO L125 PetriNetUnfolderBase]: For 14777/15246 co-relation queries the response was YES. [2023-11-19 07:49:09,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19879 conditions, 4502 events. 2949/4502 cut-off events. For 14777/15246 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 24036 event pairs, 649 based on Foata normal form. 432/4861 useless extension candidates. Maximal degree in co-relation 19852. Up to 2146 conditions per place. [2023-11-19 07:49:09,129 INFO L140 encePairwiseOnDemand]: 277/283 looper letters, 100 selfloop transitions, 9 changer transitions 0/121 dead transitions. [2023-11-19 07:49:09,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 121 transitions, 1152 flow [2023-11-19 07:49:09,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:49:09,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:49:09,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 585 transitions. [2023-11-19 07:49:09,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5167844522968198 [2023-11-19 07:49:09,133 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 585 transitions. [2023-11-19 07:49:09,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 585 transitions. [2023-11-19 07:49:09,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:49:09,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 585 transitions. [2023-11-19 07:49:09,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.25) internal successors, (585), 4 states have internal predecessors, (585), 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-19 07:49:09,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 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-19 07:49:09,140 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 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-19 07:49:09,140 INFO L175 Difference]: Start difference. First operand has 61 places, 64 transitions, 510 flow. Second operand 4 states and 585 transitions. [2023-11-19 07:49:09,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 121 transitions, 1152 flow [2023-11-19 07:49:09,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 121 transitions, 1145 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-19 07:49:09,155 INFO L231 Difference]: Finished difference. Result has 63 places, 68 transitions, 555 flow [2023-11-19 07:49:09,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=555, PETRI_PLACES=63, PETRI_TRANSITIONS=68} [2023-11-19 07:49:09,156 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 17 predicate places. [2023-11-19 07:49:09,156 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 68 transitions, 555 flow [2023-11-19 07:49:09,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 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-19 07:49:09,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:49:09,157 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-19 07:49:09,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:49:09,158 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-11-19 07:49:09,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:49:09,158 INFO L85 PathProgramCache]: Analyzing trace with hash 473636040, now seen corresponding path program 1 times [2023-11-19 07:49:09,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:49:09,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591878592] [2023-11-19 07:49:09,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:49:09,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:49:09,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:09,484 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-19 07:49:09,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:49:09,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591878592] [2023-11-19 07:49:09,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591878592] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:49:09,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:49:09,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:49:09,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633113452] [2023-11-19 07:49:09,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:49:09,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:49:09,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:49:09,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:49:09,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:49:09,496 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 283 [2023-11-19 07:49:09,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 68 transitions, 555 flow. Second operand has 5 states, 5 states have (on average 134.2) internal successors, (671), 5 states have internal predecessors, (671), 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-19 07:49:09,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:49:09,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 283 [2023-11-19 07:49:09,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:49:10,298 INFO L124 PetriNetUnfolderBase]: 2119/3243 cut-off events. [2023-11-19 07:49:10,298 INFO L125 PetriNetUnfolderBase]: For 11879/12237 co-relation queries the response was YES. [2023-11-19 07:49:10,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15281 conditions, 3243 events. 2119/3243 cut-off events. For 11879/12237 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 16649 event pairs, 495 based on Foata normal form. 268/3461 useless extension candidates. Maximal degree in co-relation 15253. Up to 1442 conditions per place. [2023-11-19 07:49:10,330 INFO L140 encePairwiseOnDemand]: 277/283 looper letters, 111 selfloop transitions, 13 changer transitions 4/140 dead transitions. [2023-11-19 07:49:10,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 140 transitions, 1359 flow [2023-11-19 07:49:10,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:49:10,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:49:10,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 731 transitions. [2023-11-19 07:49:10,336 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5166077738515901 [2023-11-19 07:49:10,337 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 731 transitions. [2023-11-19 07:49:10,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 731 transitions. [2023-11-19 07:49:10,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:49:10,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 731 transitions. [2023-11-19 07:49:10,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 146.2) internal successors, (731), 5 states have internal predecessors, (731), 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-19 07:49:10,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 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-19 07:49:10,347 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 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-19 07:49:10,347 INFO L175 Difference]: Start difference. First operand has 63 places, 68 transitions, 555 flow. Second operand 5 states and 731 transitions. [2023-11-19 07:49:10,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 140 transitions, 1359 flow [2023-11-19 07:49:10,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 140 transitions, 1341 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-19 07:49:10,369 INFO L231 Difference]: Finished difference. Result has 66 places, 70 transitions, 589 flow [2023-11-19 07:49:10,369 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=521, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=589, PETRI_PLACES=66, PETRI_TRANSITIONS=70} [2023-11-19 07:49:10,370 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 20 predicate places. [2023-11-19 07:49:10,370 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 70 transitions, 589 flow [2023-11-19 07:49:10,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.2) internal successors, (671), 5 states have internal predecessors, (671), 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-19 07:49:10,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:49:10,371 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-19 07:49:10,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:49:10,372 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-11-19 07:49:10,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:49:10,372 INFO L85 PathProgramCache]: Analyzing trace with hash 347675968, now seen corresponding path program 1 times [2023-11-19 07:49:10,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:49:10,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659725988] [2023-11-19 07:49:10,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:49:10,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:49:10,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:10,920 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-19 07:49:10,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:49:10,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659725988] [2023-11-19 07:49:10,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659725988] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:49:10,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:49:10,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:49:10,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703145385] [2023-11-19 07:49:10,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:49:10,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:49:10,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:49:10,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:49:10,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:49:10,935 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 283 [2023-11-19 07:49:10,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 70 transitions, 589 flow. Second operand has 6 states, 6 states have (on average 134.0) internal successors, (804), 6 states have internal predecessors, (804), 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-19 07:49:10,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:49:10,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 283 [2023-11-19 07:49:10,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:49:11,782 INFO L124 PetriNetUnfolderBase]: 2029/3067 cut-off events. [2023-11-19 07:49:11,783 INFO L125 PetriNetUnfolderBase]: For 11855/12206 co-relation queries the response was YES. [2023-11-19 07:49:11,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14681 conditions, 3067 events. 2029/3067 cut-off events. For 11855/12206 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 15733 event pairs, 483 based on Foata normal form. 147/3165 useless extension candidates. Maximal degree in co-relation 14652. Up to 1355 conditions per place. [2023-11-19 07:49:11,808 INFO L140 encePairwiseOnDemand]: 277/283 looper letters, 100 selfloop transitions, 17 changer transitions 12/140 dead transitions. [2023-11-19 07:49:11,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 140 transitions, 1385 flow [2023-11-19 07:49:11,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:49:11,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:49:11,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 861 transitions. [2023-11-19 07:49:11,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5070671378091873 [2023-11-19 07:49:11,814 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 861 transitions. [2023-11-19 07:49:11,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 861 transitions. [2023-11-19 07:49:11,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:49:11,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 861 transitions. [2023-11-19 07:49:11,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 143.5) internal successors, (861), 6 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-19 07:49:11,823 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 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-19 07:49:11,825 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 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-19 07:49:11,825 INFO L175 Difference]: Start difference. First operand has 66 places, 70 transitions, 589 flow. Second operand 6 states and 861 transitions. [2023-11-19 07:49:11,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 140 transitions, 1385 flow [2023-11-19 07:49:11,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 140 transitions, 1310 flow, removed 20 selfloop flow, removed 5 redundant places. [2023-11-19 07:49:11,876 INFO L231 Difference]: Finished difference. Result has 67 places, 65 transitions, 516 flow [2023-11-19 07:49:11,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=516, PETRI_PLACES=67, PETRI_TRANSITIONS=65} [2023-11-19 07:49:11,877 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 21 predicate places. [2023-11-19 07:49:11,877 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 65 transitions, 516 flow [2023-11-19 07:49:11,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 134.0) internal successors, (804), 6 states have internal predecessors, (804), 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-19 07:49:11,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:49:11,878 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:49:11,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:49:11,879 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-11-19 07:49:11,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:49:11,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1062676478, now seen corresponding path program 1 times [2023-11-19 07:49:11,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:49:11,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549433309] [2023-11-19 07:49:11,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:49:11,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:49:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:12,746 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-19 07:49:12,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:49:12,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549433309] [2023-11-19 07:49:12,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549433309] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:49:12,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:49:12,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:49:12,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774553339] [2023-11-19 07:49:12,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:49:12,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:49:12,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:49:12,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:49:12,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:49:12,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 283 [2023-11-19 07:49:12,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 65 transitions, 516 flow. Second operand has 6 states, 6 states have (on average 123.66666666666667) internal successors, (742), 6 states have internal predecessors, (742), 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-19 07:49:12,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:49:12,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 283 [2023-11-19 07:49:12,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:49:13,786 INFO L124 PetriNetUnfolderBase]: 2010/3119 cut-off events. [2023-11-19 07:49:13,787 INFO L125 PetriNetUnfolderBase]: For 11066/11066 co-relation queries the response was YES. [2023-11-19 07:49:13,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14895 conditions, 3119 events. 2010/3119 cut-off events. For 11066/11066 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 15757 event pairs, 352 based on Foata normal form. 1/3120 useless extension candidates. Maximal degree in co-relation 14867. Up to 1766 conditions per place. [2023-11-19 07:49:13,805 INFO L140 encePairwiseOnDemand]: 270/283 looper letters, 66 selfloop transitions, 16 changer transitions 78/161 dead transitions. [2023-11-19 07:49:13,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 161 transitions, 1568 flow [2023-11-19 07:49:13,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:49:13,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:49:13,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 919 transitions. [2023-11-19 07:49:13,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.463907117617365 [2023-11-19 07:49:13,810 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 919 transitions. [2023-11-19 07:49:13,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 919 transitions. [2023-11-19 07:49:13,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:49:13,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 919 transitions. [2023-11-19 07:49:13,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.28571428571428) internal successors, (919), 7 states have internal predecessors, (919), 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-19 07:49:13,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 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-19 07:49:13,821 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 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-19 07:49:13,821 INFO L175 Difference]: Start difference. First operand has 67 places, 65 transitions, 516 flow. Second operand 7 states and 919 transitions. [2023-11-19 07:49:13,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 161 transitions, 1568 flow [2023-11-19 07:49:13,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 161 transitions, 1338 flow, removed 58 selfloop flow, removed 7 redundant places. [2023-11-19 07:49:13,877 INFO L231 Difference]: Finished difference. Result has 71 places, 58 transitions, 444 flow [2023-11-19 07:49:13,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=444, PETRI_PLACES=71, PETRI_TRANSITIONS=58} [2023-11-19 07:49:13,879 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 25 predicate places. [2023-11-19 07:49:13,879 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 58 transitions, 444 flow [2023-11-19 07:49:13,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 123.66666666666667) internal successors, (742), 6 states have internal predecessors, (742), 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-19 07:49:13,880 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:49:13,880 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:49:13,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:49:13,880 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-11-19 07:49:13,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:49:13,881 INFO L85 PathProgramCache]: Analyzing trace with hash -2001378256, now seen corresponding path program 2 times [2023-11-19 07:49:13,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:49:13,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101694303] [2023-11-19 07:49:13,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:49:13,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:49:13,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:49:15,324 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-19 07:49:15,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:49:15,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101694303] [2023-11-19 07:49:15,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101694303] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:49:15,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:49:15,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:49:15,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829916118] [2023-11-19 07:49:15,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:49:15,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 07:49:15,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:49:15,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 07:49:15,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:49:15,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 283 [2023-11-19 07:49:15,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 58 transitions, 444 flow. Second operand has 8 states, 8 states have (on average 130.375) internal successors, (1043), 8 states have internal predecessors, (1043), 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-19 07:49:15,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:49:15,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 283 [2023-11-19 07:49:15,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:49:16,069 INFO L124 PetriNetUnfolderBase]: 1547/2459 cut-off events. [2023-11-19 07:49:16,069 INFO L125 PetriNetUnfolderBase]: For 8132/8164 co-relation queries the response was YES. [2023-11-19 07:49:16,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10012 conditions, 2459 events. 1547/2459 cut-off events. For 8132/8164 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 12393 event pairs, 371 based on Foata normal form. 5/2446 useless extension candidates. Maximal degree in co-relation 9991. Up to 1374 conditions per place. [2023-11-19 07:49:16,083 INFO L140 encePairwiseOnDemand]: 275/283 looper letters, 85 selfloop transitions, 13 changer transitions 7/110 dead transitions. [2023-11-19 07:49:16,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 110 transitions, 974 flow [2023-11-19 07:49:16,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:49:16,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:49:16,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 821 transitions. [2023-11-19 07:49:16,087 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.483510011778563 [2023-11-19 07:49:16,087 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 821 transitions. [2023-11-19 07:49:16,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 821 transitions. [2023-11-19 07:49:16,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:49:16,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 821 transitions. [2023-11-19 07:49:16,091 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 136.83333333333334) internal successors, (821), 6 states have internal predecessors, (821), 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-19 07:49:16,095 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 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-19 07:49:16,096 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 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-19 07:49:16,096 INFO L175 Difference]: Start difference. First operand has 71 places, 58 transitions, 444 flow. Second operand 6 states and 821 transitions. [2023-11-19 07:49:16,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 110 transitions, 974 flow [2023-11-19 07:49:16,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 110 transitions, 899 flow, removed 6 selfloop flow, removed 6 redundant places. [2023-11-19 07:49:16,132 INFO L231 Difference]: Finished difference. Result has 71 places, 64 transitions, 496 flow [2023-11-19 07:49:16,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=496, PETRI_PLACES=71, PETRI_TRANSITIONS=64} [2023-11-19 07:49:16,133 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 25 predicate places. [2023-11-19 07:49:16,133 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 64 transitions, 496 flow [2023-11-19 07:49:16,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 130.375) internal successors, (1043), 8 states have internal predecessors, (1043), 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-19 07:49:16,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:49:16,134 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:49:16,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:49:16,134 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-11-19 07:49:16,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:49:16,135 INFO L85 PathProgramCache]: Analyzing trace with hash -2045861074, now seen corresponding path program 3 times [2023-11-19 07:49:16,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:49:16,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645850586] [2023-11-19 07:49:16,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:49:16,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:49:16,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:49:16,277 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:49:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:49:16,442 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:49:16,443 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:49:16,444 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 9 remaining) [2023-11-19 07:49:16,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2023-11-19 07:49:16,446 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2023-11-19 07:49:16,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 9 remaining) [2023-11-19 07:49:16,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2023-11-19 07:49:16,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2023-11-19 07:49:16,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2023-11-19 07:49:16,447 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2023-11-19 07:49:16,448 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2023-11-19 07:49:16,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 07:49:16,448 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:49:16,456 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 07:49:16,456 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:49:16,572 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-19 07:49:16,575 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-19 07:49:16,583 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre13 could not be translated [2023-11-19 07:49:16,585 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre15 could not be translated [2023-11-19 07:49:16,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:49:16 BasicIcfg [2023-11-19 07:49:16,634 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:49:16,635 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:49:16,635 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:49:16,635 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:49:16,636 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:48:38" (3/4) ... [2023-11-19 07:49:16,637 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-19 07:49:16,690 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-19 07:49:16,693 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-19 07:49:16,695 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre13 could not be translated [2023-11-19 07:49:16,696 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre15 could not be translated [2023-11-19 07:49:16,803 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a65802-fc22-4e9a-a850-ce888c9eeed9/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml [2023-11-19 07:49:16,803 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:49:16,804 INFO L158 Benchmark]: Toolchain (without parser) took 41061.59ms. Allocated memory was 132.1MB in the beginning and 2.9GB in the end (delta: 2.8GB). Free memory was 91.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2023-11-19 07:49:16,804 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 132.1MB. Free memory was 101.6MB in the beginning and 101.5MB in the end (delta: 152.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:49:16,805 INFO L158 Benchmark]: CACSL2BoogieTranslator took 841.23ms. Allocated memory is still 132.1MB. Free memory was 91.4MB in the beginning and 62.9MB in the end (delta: 28.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2023-11-19 07:49:16,805 INFO L158 Benchmark]: Boogie Procedure Inliner took 101.20ms. Allocated memory is still 132.1MB. Free memory was 62.9MB in the beginning and 58.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-19 07:49:16,805 INFO L158 Benchmark]: Boogie Preprocessor took 49.95ms. Allocated memory is still 132.1MB. Free memory was 58.7MB in the beginning and 56.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:49:16,806 INFO L158 Benchmark]: RCFGBuilder took 1434.77ms. Allocated memory was 132.1MB in the beginning and 172.0MB in the end (delta: 39.8MB). Free memory was 56.2MB in the beginning and 77.9MB in the end (delta: -21.7MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2023-11-19 07:49:16,806 INFO L158 Benchmark]: TraceAbstraction took 38458.63ms. Allocated memory was 172.0MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 76.8MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2023-11-19 07:49:16,807 INFO L158 Benchmark]: Witness Printer took 168.33ms. Allocated memory is still 2.9GB. Free memory was 1.4GB in the beginning and 1.3GB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-19 07:49:16,810 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.55ms. Allocated memory is still 132.1MB. Free memory was 101.6MB in the beginning and 101.5MB in the end (delta: 152.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 841.23ms. Allocated memory is still 132.1MB. Free memory was 91.4MB in the beginning and 62.9MB in the end (delta: 28.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 101.20ms. Allocated memory is still 132.1MB. Free memory was 62.9MB in the beginning and 58.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.95ms. Allocated memory is still 132.1MB. Free memory was 58.7MB in the beginning and 56.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1434.77ms. Allocated memory was 132.1MB in the beginning and 172.0MB in the end (delta: 39.8MB). Free memory was 56.2MB in the beginning and 77.9MB in the end (delta: -21.7MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. * TraceAbstraction took 38458.63ms. Allocated memory was 172.0MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 76.8MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 168.33ms. Allocated memory is still 2.9GB. Free memory was 1.4GB in the beginning and 1.3GB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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 Unfinished Backtranslation: IdentifierExpression #t~pre13 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre15 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - 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 Unfinished Backtranslation: IdentifierExpression #t~pre13 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre15 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: 7.2s, 161 PlacesBefore, 46 PlacesAfterwards, 150 TransitionsBefore, 34 TransitionsAfterwards, 3620 CoEnabledTransitionPairs, 7 FixpointIterations, 60 TrivialSequentialCompositions, 62 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 129 TotalNumberOfCompositions, 9915 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3835, independent: 3583, independent conditional: 0, independent unconditional: 3583, dependent: 252, dependent conditional: 0, dependent unconditional: 252, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1862, independent: 1821, independent conditional: 0, independent unconditional: 1821, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3835, independent: 1762, independent conditional: 0, independent unconditional: 1762, dependent: 211, dependent conditional: 0, dependent unconditional: 211, unknown: 1862, unknown conditional: 0, unknown unconditional: 1862] , Statistics on independence cache: Total cache size (in pairs): 143, Positive cache size: 124, Positive conditional cache size: 0, Positive unconditional cache size: 124, 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_p2_EAX = 0; [L714] 0 int __unbuffered_p2_EBX = 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 z$flush_delayed; [L748] 0 int z$mem_tmp; [L749] 0 _Bool z$r_buff0_thd0; [L750] 0 _Bool z$r_buff0_thd1; [L751] 0 _Bool z$r_buff0_thd2; [L752] 0 _Bool z$r_buff0_thd3; [L753] 0 _Bool z$r_buff0_thd4; [L754] 0 _Bool z$r_buff1_thd0; [L755] 0 _Bool z$r_buff1_thd1; [L756] 0 _Bool z$r_buff1_thd2; [L757] 0 _Bool z$r_buff1_thd3; [L758] 0 _Bool z$r_buff1_thd4; [L759] 0 _Bool z$read_delayed; [L760] 0 int *z$read_delayed_var; [L761] 0 int z$w_buff0; [L762] 0 _Bool z$w_buff0_used; [L763] 0 int z$w_buff1; [L764] 0 _Bool z$w_buff1_used; [L765] 0 _Bool weak$$choice0; [L766] 0 _Bool weak$$choice2; [L923] 0 pthread_t t233; [L924] FCALL, FORK 0 pthread_create(&t233, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t233={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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L925] 0 pthread_t t234; [L926] FCALL, FORK 0 pthread_create(&t234, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, t233={5:0}, t234={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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L927] 0 pthread_t t235; [L928] FCALL, FORK 0 pthread_create(&t235, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, t233={5:0}, t234={6:0}, t235={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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L929] 0 pthread_t t236; [L930] FCALL, FORK 0 pthread_create(&t236, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, t233={5:0}, t234={6:0}, t235={7:0}, t236={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=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L864] 4 z$w_buff1 = z$w_buff0 [L865] 4 z$w_buff0 = 1 [L866] 4 z$w_buff1_used = z$w_buff0_used [L867] 4 z$w_buff0_used = (_Bool)1 [L868] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L868] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L869] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L870] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L871] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L872] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L873] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L874] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L805] 3 y$w_buff1 = y$w_buff0 [L806] 3 y$w_buff0 = 2 [L807] 3 y$w_buff1_used = y$w_buff0_used [L808] 3 y$w_buff0_used = (_Bool)1 [L809] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L809] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L810] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L811] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L812] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L813] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L814] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L815] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L877] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L878] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L879] 4 z$flush_delayed = weak$$choice2 [L880] 4 z$mem_tmp = z [L881] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L882] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L883] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L884] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L885] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L886] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L887] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L888] 4 __unbuffered_p3_EAX = z [L889] 4 z = z$flush_delayed ? z$mem_tmp : z [L890] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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$$choice2=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L893] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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$$choice2=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L818] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 3 y$flush_delayed = weak$$choice2 [L821] 3 y$mem_tmp = y [L822] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L823] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L824] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L825] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L826] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L828] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L829] 3 __unbuffered_p2_EAX = y [L830] 3 y = y$flush_delayed ? y$mem_tmp : y [L831] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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$$choice2=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L834] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 3 z$flush_delayed = weak$$choice2 [L837] 3 z$mem_tmp = z [L838] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L839] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L840] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L841] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L842] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L843] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L844] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L845] 3 __unbuffered_p2_EBX = z [L846] 3 z = z$flush_delayed ? z$mem_tmp : z [L847] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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$$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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L773] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L896] 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) [L897] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L898] 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 [L899] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L900] 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 [L901] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L902] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L903] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L904] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L905] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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$$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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L785] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L788] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L791] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L792] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L793] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L794] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L795] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L850] 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) [L851] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L852] 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 [L853] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L854] 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_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L857] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L859] 3 return 0; [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L778] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 1 return 0; [L908] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L910] 4 return 0; [L932] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L934] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L934] RET 0 assume_abort_if_not(main$tmp_guard0) [L936] 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) [L937] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L938] 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 [L939] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L940] 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 [L941] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L942] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L943] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L944] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L945] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t233={5:0}, t234={6:0}, t235={7:0}, t236={3:0}, weak$$choice2=0, x=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L948] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L949] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L950] 0 y$flush_delayed = weak$$choice2 [L951] 0 y$mem_tmp = y [L952] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L953] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L954] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L955] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L956] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L957] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L958] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L959] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L960] 0 y = y$flush_delayed ? y$mem_tmp : y [L961] 0 y$flush_delayed = (_Bool)0 [L963] 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}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - 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: 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: 926]: 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: 930]: 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: 928]: 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: 924]: 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, 193 locations, 9 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: 38.1s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 22.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 687 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 580 mSDsluCounter, 331 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 269 mSDsCounter, 119 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1517 IncrementalHoareTripleChecker+Invalid, 1636 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 119 mSolverCounterUnsat, 62 mSDtfsCounter, 1517 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=589occurred in iteration=8, InterpolantAutomatonStates: 58, 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, 1.0s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 231 NumberOfCodeBlocks, 231 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 191 ConstructedInterpolants, 0 QuantifiedInterpolants, 1388 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-19 07:49:16,872 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a65802-fc22-4e9a-a850-ce888c9eeed9/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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