./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aad9bb19-291c-41ac-a6a4-63d07312de0e/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aad9bb19-291c-41ac-a6a4-63d07312de0e/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aad9bb19-291c-41ac-a6a4-63d07312de0e/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aad9bb19-291c-41ac-a6a4-63d07312de0e/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aad9bb19-291c-41ac-a6a4-63d07312de0e/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aad9bb19-291c-41ac-a6a4-63d07312de0e/bin/uautomizer-verify-4GaUIPS5ZU --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 39f434d3f7e7749f4257e03557066c1349e963b1d489e771c14fc3ff33c9a6c7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 21:56:42,694 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 21:56:42,791 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aad9bb19-291c-41ac-a6a4-63d07312de0e/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 21:56:42,796 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 21:56:42,798 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 21:56:42,836 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 21:56:42,838 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 21:56:42,839 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 21:56:42,839 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 21:56:42,841 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 21:56:42,841 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 21:56:42,842 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 21:56:42,843 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 21:56:42,843 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 21:56:42,844 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 21:56:42,844 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 21:56:42,845 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 21:56:42,845 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 21:56:42,845 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 21:56:42,846 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 21:56:42,846 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 21:56:42,850 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 21:56:42,850 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 21:56:42,852 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 21:56:42,852 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 21:56:42,852 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 21:56:42,853 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 21:56:42,853 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 21:56:42,854 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 21:56:42,854 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 21:56:42,854 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 21:56:42,854 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 21:56:42,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:56:42,855 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 21:56:42,856 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 21:56:42,857 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 21:56:42,857 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 21:56:42,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 21:56:42,858 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 21:56:42,858 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 21:56:42,858 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 21:56:42,859 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 21:56:42,859 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_aad9bb19-291c-41ac-a6a4-63d07312de0e/bin/uautomizer-verify-4GaUIPS5ZU/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_aad9bb19-291c-41ac-a6a4-63d07312de0e/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 39f434d3f7e7749f4257e03557066c1349e963b1d489e771c14fc3ff33c9a6c7 [2024-10-31 21:56:43,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 21:56:43,188 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 21:56:43,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 21:56:43,193 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 21:56:43,193 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 21:56:43,195 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aad9bb19-291c-41ac-a6a4-63d07312de0e/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.i Unable to find full path for "g++" [2024-10-31 21:56:45,270 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 21:56:45,551 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 21:56:45,552 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aad9bb19-291c-41ac-a6a4-63d07312de0e/sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.i [2024-10-31 21:56:45,573 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aad9bb19-291c-41ac-a6a4-63d07312de0e/bin/uautomizer-verify-4GaUIPS5ZU/data/808900fbe/1a45f5c7f2f24d1a836bf1da98918733/FLAG529dddc07 [2024-10-31 21:56:45,600 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aad9bb19-291c-41ac-a6a4-63d07312de0e/bin/uautomizer-verify-4GaUIPS5ZU/data/808900fbe/1a45f5c7f2f24d1a836bf1da98918733 [2024-10-31 21:56:45,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 21:56:45,606 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 21:56:45,610 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 21:56:45,610 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 21:56:45,615 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 21:56:45,616 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:56:45" (1/1) ... [2024-10-31 21:56:45,617 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f21c57d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:45, skipping insertion in model container [2024-10-31 21:56:45,617 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:56:45" (1/1) ... [2024-10-31 21:56:45,671 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 21:56:45,940 WARN L251 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_aad9bb19-291c-41ac-a6a4-63d07312de0e/sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.i[956,969] [2024-10-31 21:56:46,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:56:46,340 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 21:56:46,357 WARN L251 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_aad9bb19-291c-41ac-a6a4-63d07312de0e/sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.i[956,969] [2024-10-31 21:56:46,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:56:46,528 INFO L204 MainTranslator]: Completed translation [2024-10-31 21:56:46,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:46 WrapperNode [2024-10-31 21:56:46,529 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 21:56:46,530 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 21:56:46,531 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 21:56:46,532 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 21:56:46,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:46" (1/1) ... [2024-10-31 21:56:46,570 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:46" (1/1) ... [2024-10-31 21:56:46,619 INFO L138 Inliner]: procedures = 176, calls = 53, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 151 [2024-10-31 21:56:46,620 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 21:56:46,620 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 21:56:46,621 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 21:56:46,624 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 21:56:46,642 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:46" (1/1) ... [2024-10-31 21:56:46,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:46" (1/1) ... [2024-10-31 21:56:46,650 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:46" (1/1) ... [2024-10-31 21:56:46,682 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-31 21:56:46,682 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:46" (1/1) ... [2024-10-31 21:56:46,683 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:46" (1/1) ... [2024-10-31 21:56:46,695 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:46" (1/1) ... [2024-10-31 21:56:46,699 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:46" (1/1) ... [2024-10-31 21:56:46,707 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:46" (1/1) ... [2024-10-31 21:56:46,709 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:46" (1/1) ... [2024-10-31 21:56:46,715 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 21:56:46,716 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 21:56:46,716 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 21:56:46,717 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 21:56:46,722 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:46" (1/1) ... [2024-10-31 21:56:46,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:56:46,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aad9bb19-291c-41ac-a6a4-63d07312de0e/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:56:46,754 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aad9bb19-291c-41ac-a6a4-63d07312de0e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 21:56:46,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aad9bb19-291c-41ac-a6a4-63d07312de0e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 21:56:46,789 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-31 21:56:46,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 21:56:46,818 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-31 21:56:46,818 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-31 21:56:46,818 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-31 21:56:46,818 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-31 21:56:46,819 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-31 21:56:46,819 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-31 21:56:46,819 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-10-31 21:56:46,819 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-10-31 21:56:46,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 21:56:46,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-31 21:56:46,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 21:56:46,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 21:56:46,826 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-31 21:56:47,031 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 21:56:47,037 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 21:56:47,459 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-31 21:56:47,459 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 21:56:47,718 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 21:56:47,718 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-31 21:56:47,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:56:47 BoogieIcfgContainer [2024-10-31 21:56:47,719 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 21:56:47,721 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 21:56:47,721 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 21:56:47,725 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 21:56:47,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 09:56:45" (1/3) ... [2024-10-31 21:56:47,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3514208f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:56:47, skipping insertion in model container [2024-10-31 21:56:47,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:46" (2/3) ... [2024-10-31 21:56:47,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3514208f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:56:47, skipping insertion in model container [2024-10-31 21:56:47,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:56:47" (3/3) ... [2024-10-31 21:56:47,731 INFO L112 eAbstractionObserver]: Analyzing ICFG mix017_pso.opt_tso.opt.i [2024-10-31 21:56:47,753 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 21:56:47,754 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-31 21:56:47,754 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-31 21:56:47,845 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-31 21:56:47,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 49 transitions, 114 flow [2024-10-31 21:56:47,972 INFO L124 PetriNetUnfolderBase]: 1/45 cut-off events. [2024-10-31 21:56:47,972 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 21:56:47,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 45 events. 1/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 97 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2024-10-31 21:56:47,983 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 49 transitions, 114 flow [2024-10-31 21:56:47,992 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 45 transitions, 102 flow [2024-10-31 21:56:48,007 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 21:56:48,017 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=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;@4eea6ce5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 21:56:48,017 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-31 21:56:48,032 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 21:56:48,032 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2024-10-31 21:56:48,032 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 21:56:48,033 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:56:48,033 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:56:48,034 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-31 21:56:48,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:56:48,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1029438021, now seen corresponding path program 1 times [2024-10-31 21:56:48,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:56:48,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144640299] [2024-10-31 21:56:48,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:48,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:56:48,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:48,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:56:48,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:56:48,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144640299] [2024-10-31 21:56:48,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144640299] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:56:48,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:56:48,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-31 21:56:48,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575357226] [2024-10-31 21:56:48,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:56:48,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:56:48,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:56:48,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:56:48,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:56:48,829 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 49 [2024-10-31 21:56:48,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:56:48,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:56:48,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 49 [2024-10-31 21:56:48,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:56:49,531 INFO L124 PetriNetUnfolderBase]: 879/1523 cut-off events. [2024-10-31 21:56:49,532 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 21:56:49,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2843 conditions, 1523 events. 879/1523 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 10523 event pairs, 159 based on Foata normal form. 60/1538 useless extension candidates. Maximal degree in co-relation 2831. Up to 1009 conditions per place. [2024-10-31 21:56:49,552 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 26 selfloop transitions, 2 changer transitions 2/52 dead transitions. [2024-10-31 21:56:49,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 52 transitions, 176 flow [2024-10-31 21:56:49,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:56:49,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:56:49,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2024-10-31 21:56:49,571 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7551020408163265 [2024-10-31 21:56:49,573 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 102 flow. Second operand 3 states and 111 transitions. [2024-10-31 21:56:49,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 52 transitions, 176 flow [2024-10-31 21:56:49,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 52 transitions, 172 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-31 21:56:49,584 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 96 flow [2024-10-31 21:56:49,588 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2024-10-31 21:56:49,595 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -3 predicate places. [2024-10-31 21:56:49,596 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 96 flow [2024-10-31 21:56:49,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:56:49,596 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:56:49,597 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:56:49,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 21:56:49,597 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-31 21:56:49,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:56:49,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1094980479, now seen corresponding path program 1 times [2024-10-31 21:56:49,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:56:49,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285732864] [2024-10-31 21:56:49,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:49,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:56:49,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:49,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:56:49,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:56:49,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285732864] [2024-10-31 21:56:49,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285732864] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:56:49,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:56:49,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 21:56:49,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592093090] [2024-10-31 21:56:49,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:56:49,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:56:49,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:56:50,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:56:50,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:56:50,011 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2024-10-31 21:56:50,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:56:50,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:56:50,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2024-10-31 21:56:50,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:56:51,505 INFO L124 PetriNetUnfolderBase]: 4037/6465 cut-off events. [2024-10-31 21:56:51,505 INFO L125 PetriNetUnfolderBase]: For 244/244 co-relation queries the response was YES. [2024-10-31 21:56:51,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12425 conditions, 6465 events. 4037/6465 cut-off events. For 244/244 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 45411 event pairs, 603 based on Foata normal form. 216/6462 useless extension candidates. Maximal degree in co-relation 12415. Up to 3225 conditions per place. [2024-10-31 21:56:51,570 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 46 selfloop transitions, 6 changer transitions 1/70 dead transitions. [2024-10-31 21:56:51,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 70 transitions, 268 flow [2024-10-31 21:56:51,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:56:51,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-31 21:56:51,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2024-10-31 21:56:51,576 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7091836734693877 [2024-10-31 21:56:51,577 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 4 states and 139 transitions. [2024-10-31 21:56:51,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 70 transitions, 268 flow [2024-10-31 21:56:51,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 70 transitions, 260 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 21:56:51,583 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 134 flow [2024-10-31 21:56:51,584 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2024-10-31 21:56:51,585 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, -1 predicate places. [2024-10-31 21:56:51,586 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 134 flow [2024-10-31 21:56:51,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:56:51,586 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:56:51,587 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:56:51,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 21:56:51,587 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-31 21:56:51,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:56:51,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1850116433, now seen corresponding path program 1 times [2024-10-31 21:56:51,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:56:51,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183227846] [2024-10-31 21:56:51,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:51,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:56:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:51,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:56:51,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:56:51,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183227846] [2024-10-31 21:56:51,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183227846] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:56:51,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:56:51,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 21:56:51,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900173565] [2024-10-31 21:56:51,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:56:51,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:56:51,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:56:51,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:56:51,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:56:51,967 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2024-10-31 21:56:51,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 134 flow. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:56:51,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:56:51,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2024-10-31 21:56:51,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:56:53,183 INFO L124 PetriNetUnfolderBase]: 3433/5499 cut-off events. [2024-10-31 21:56:53,183 INFO L125 PetriNetUnfolderBase]: For 1468/1468 co-relation queries the response was YES. [2024-10-31 21:56:53,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12505 conditions, 5499 events. 3433/5499 cut-off events. For 1468/1468 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 37334 event pairs, 213 based on Foata normal form. 208/5532 useless extension candidates. Maximal degree in co-relation 12493. Up to 2433 conditions per place. [2024-10-31 21:56:53,227 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 59 selfloop transitions, 10 changer transitions 1/87 dead transitions. [2024-10-31 21:56:53,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 87 transitions, 385 flow [2024-10-31 21:56:53,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 21:56:53,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-31 21:56:53,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 177 transitions. [2024-10-31 21:56:53,232 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7224489795918367 [2024-10-31 21:56:53,232 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 134 flow. Second operand 5 states and 177 transitions. [2024-10-31 21:56:53,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 87 transitions, 385 flow [2024-10-31 21:56:53,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 87 transitions, 374 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-31 21:56:53,240 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 186 flow [2024-10-31 21:56:53,240 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2024-10-31 21:56:53,241 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, 3 predicate places. [2024-10-31 21:56:53,241 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 186 flow [2024-10-31 21:56:53,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:56:53,243 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:56:53,243 INFO L204 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] [2024-10-31 21:56:53,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 21:56:53,243 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-31 21:56:53,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:56:53,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1845446009, now seen corresponding path program 1 times [2024-10-31 21:56:53,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:56:53,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504546547] [2024-10-31 21:56:53,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:53,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:56:53,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:53,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:56:53,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:56:53,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504546547] [2024-10-31 21:56:53,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504546547] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:56:53,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:56:53,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:56:53,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411828203] [2024-10-31 21:56:53,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:56:53,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 21:56:53,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:56:53,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 21:56:53,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:56:53,506 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2024-10-31 21:56:53,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:56:53,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:56:53,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2024-10-31 21:56:53,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:56:54,393 INFO L124 PetriNetUnfolderBase]: 2355/3705 cut-off events. [2024-10-31 21:56:54,394 INFO L125 PetriNetUnfolderBase]: For 3022/3022 co-relation queries the response was YES. [2024-10-31 21:56:54,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9623 conditions, 3705 events. 2355/3705 cut-off events. For 3022/3022 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 21762 event pairs, 81 based on Foata normal form. 164/3778 useless extension candidates. Maximal degree in co-relation 9609. Up to 1089 conditions per place. [2024-10-31 21:56:54,428 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 70 selfloop transitions, 14 changer transitions 1/102 dead transitions. [2024-10-31 21:56:54,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 102 transitions, 508 flow [2024-10-31 21:56:54,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 21:56:54,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 21:56:54,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 213 transitions. [2024-10-31 21:56:54,430 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7244897959183674 [2024-10-31 21:56:54,431 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 186 flow. Second operand 6 states and 213 transitions. [2024-10-31 21:56:54,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 102 transitions, 508 flow [2024-10-31 21:56:54,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 102 transitions, 478 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-10-31 21:56:54,445 INFO L231 Difference]: Finished difference. Result has 63 places, 54 transitions, 236 flow [2024-10-31 21:56:54,446 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=236, PETRI_PLACES=63, PETRI_TRANSITIONS=54} [2024-10-31 21:56:54,446 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, 6 predicate places. [2024-10-31 21:56:54,447 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 236 flow [2024-10-31 21:56:54,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:56:54,448 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:56:54,448 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:56:54,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 21:56:54,448 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-31 21:56:54,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:56:54,449 INFO L85 PathProgramCache]: Analyzing trace with hash 29602639, now seen corresponding path program 1 times [2024-10-31 21:56:54,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:56:54,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547743613] [2024-10-31 21:56:54,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:54,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:56:54,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:54,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:56:54,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:56:54,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547743613] [2024-10-31 21:56:54,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547743613] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:56:54,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:56:54,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 21:56:54,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083477720] [2024-10-31 21:56:54,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:56:54,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 21:56:54,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:56:54,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 21:56:54,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-31 21:56:54,923 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 49 [2024-10-31 21:56:54,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 236 flow. Second operand has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:56:54,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:56:54,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 49 [2024-10-31 21:56:54,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:56:55,605 INFO L124 PetriNetUnfolderBase]: 1527/2281 cut-off events. [2024-10-31 21:56:55,605 INFO L125 PetriNetUnfolderBase]: For 3480/3480 co-relation queries the response was YES. [2024-10-31 21:56:55,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6768 conditions, 2281 events. 1527/2281 cut-off events. For 3480/3480 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 11242 event pairs, 47 based on Foata normal form. 80/2334 useless extension candidates. Maximal degree in co-relation 6753. Up to 768 conditions per place. [2024-10-31 21:56:55,624 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 63 selfloop transitions, 18 changer transitions 1/99 dead transitions. [2024-10-31 21:56:55,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 99 transitions, 506 flow [2024-10-31 21:56:55,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 21:56:55,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-31 21:56:55,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 231 transitions. [2024-10-31 21:56:55,626 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.673469387755102 [2024-10-31 21:56:55,626 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 236 flow. Second operand 7 states and 231 transitions. [2024-10-31 21:56:55,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 99 transitions, 506 flow [2024-10-31 21:56:55,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 99 transitions, 460 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-10-31 21:56:55,647 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 246 flow [2024-10-31 21:56:55,648 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=246, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2024-10-31 21:56:55,649 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places. [2024-10-31 21:56:55,650 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 246 flow [2024-10-31 21:56:55,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:56:55,650 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:56:55,650 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:56:55,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 21:56:55,651 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-31 21:56:55,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:56:55,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1729601031, now seen corresponding path program 1 times [2024-10-31 21:56:55,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:56:55,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626809329] [2024-10-31 21:56:55,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:55,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:56:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:56,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:56:56,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:56:56,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626809329] [2024-10-31 21:56:56,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626809329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:56:56,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:56:56,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 21:56:56,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188198704] [2024-10-31 21:56:56,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:56:56,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 21:56:56,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:56:56,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 21:56:56,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:56:56,228 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 49 [2024-10-31 21:56:56,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 246 flow. Second operand has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:56:56,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:56:56,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 49 [2024-10-31 21:56:56,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:56:57,050 INFO L124 PetriNetUnfolderBase]: 2148/3805 cut-off events. [2024-10-31 21:56:57,050 INFO L125 PetriNetUnfolderBase]: For 2083/2204 co-relation queries the response was YES. [2024-10-31 21:56:57,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8823 conditions, 3805 events. 2148/3805 cut-off events. For 2083/2204 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 25613 event pairs, 605 based on Foata normal form. 16/3573 useless extension candidates. Maximal degree in co-relation 8807. Up to 1370 conditions per place. [2024-10-31 21:56:57,089 INFO L140 encePairwiseOnDemand]: 44/49 looper letters, 48 selfloop transitions, 2 changer transitions 12/92 dead transitions. [2024-10-31 21:56:57,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 92 transitions, 464 flow [2024-10-31 21:56:57,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 21:56:57,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 21:56:57,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 195 transitions. [2024-10-31 21:56:57,091 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6632653061224489 [2024-10-31 21:56:57,091 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 246 flow. Second operand 6 states and 195 transitions. [2024-10-31 21:56:57,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 92 transitions, 464 flow [2024-10-31 21:56:57,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 92 transitions, 358 flow, removed 22 selfloop flow, removed 10 redundant places. [2024-10-31 21:56:57,123 INFO L231 Difference]: Finished difference. Result has 65 places, 55 transitions, 167 flow [2024-10-31 21:56:57,127 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=167, PETRI_PLACES=65, PETRI_TRANSITIONS=55} [2024-10-31 21:56:57,128 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, 8 predicate places. [2024-10-31 21:56:57,128 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 55 transitions, 167 flow [2024-10-31 21:56:57,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:56:57,129 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:56:57,129 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:56:57,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 21:56:57,129 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-31 21:56:57,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:56:57,130 INFO L85 PathProgramCache]: Analyzing trace with hash -233253007, now seen corresponding path program 2 times [2024-10-31 21:56:57,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:56:57,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125219476] [2024-10-31 21:56:57,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:57,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:56:57,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:57,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:56:57,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:56:57,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125219476] [2024-10-31 21:56:57,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125219476] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:56:57,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:56:57,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 21:56:57,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528219317] [2024-10-31 21:56:57,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:56:57,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 21:56:57,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:56:57,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 21:56:57,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:56:57,753 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 49 [2024-10-31 21:56:57,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 55 transitions, 167 flow. Second operand has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:56:57,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:56:57,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 49 [2024-10-31 21:56:57,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:56:59,417 INFO L124 PetriNetUnfolderBase]: 5182/8684 cut-off events. [2024-10-31 21:56:59,417 INFO L125 PetriNetUnfolderBase]: For 1007/1007 co-relation queries the response was YES. [2024-10-31 21:56:59,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17890 conditions, 8684 events. 5182/8684 cut-off events. For 1007/1007 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 62806 event pairs, 779 based on Foata normal form. 16/8254 useless extension candidates. Maximal degree in co-relation 17876. Up to 3796 conditions per place. [2024-10-31 21:56:59,480 INFO L140 encePairwiseOnDemand]: 39/49 looper letters, 53 selfloop transitions, 11 changer transitions 16/108 dead transitions. [2024-10-31 21:56:59,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 108 transitions, 465 flow [2024-10-31 21:56:59,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 21:56:59,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-31 21:56:59,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 217 transitions. [2024-10-31 21:56:59,482 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6326530612244898 [2024-10-31 21:56:59,483 INFO L175 Difference]: Start difference. First operand has 65 places, 55 transitions, 167 flow. Second operand 7 states and 217 transitions. [2024-10-31 21:56:59,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 108 transitions, 465 flow [2024-10-31 21:56:59,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 108 transitions, 458 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-10-31 21:56:59,487 INFO L231 Difference]: Finished difference. Result has 71 places, 64 transitions, 254 flow [2024-10-31 21:56:59,488 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=254, PETRI_PLACES=71, PETRI_TRANSITIONS=64} [2024-10-31 21:56:59,489 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, 14 predicate places. [2024-10-31 21:56:59,489 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 64 transitions, 254 flow [2024-10-31 21:56:59,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:56:59,490 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:56:59,490 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:56:59,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 21:56:59,491 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-31 21:56:59,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:56:59,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1368744617, now seen corresponding path program 3 times [2024-10-31 21:56:59,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:56:59,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425319613] [2024-10-31 21:56:59,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:59,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:56:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:00,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:57:00,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:00,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425319613] [2024-10-31 21:57:00,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425319613] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:00,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:00,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 21:57:00,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780548515] [2024-10-31 21:57:00,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:00,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 21:57:00,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:00,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 21:57:00,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-31 21:57:00,200 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 49 [2024-10-31 21:57:00,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 64 transitions, 254 flow. Second operand has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:57:00,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:57:00,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 49 [2024-10-31 21:57:00,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:57:02,007 INFO L124 PetriNetUnfolderBase]: 6305/10760 cut-off events. [2024-10-31 21:57:02,007 INFO L125 PetriNetUnfolderBase]: For 5499/5503 co-relation queries the response was YES. [2024-10-31 21:57:02,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25315 conditions, 10760 events. 6305/10760 cut-off events. For 5499/5503 co-relation queries the response was YES. Maximal size of possible extension queue 738. Compared 83419 event pairs, 1359 based on Foata normal form. 16/10145 useless extension candidates. Maximal degree in co-relation 25297. Up to 4608 conditions per place. [2024-10-31 21:57:02,092 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 64 selfloop transitions, 9 changer transitions 16/117 dead transitions. [2024-10-31 21:57:02,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 117 transitions, 612 flow [2024-10-31 21:57:02,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 21:57:02,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-31 21:57:02,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 243 transitions. [2024-10-31 21:57:02,095 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6198979591836735 [2024-10-31 21:57:02,095 INFO L175 Difference]: Start difference. First operand has 71 places, 64 transitions, 254 flow. Second operand 8 states and 243 transitions. [2024-10-31 21:57:02,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 117 transitions, 612 flow [2024-10-31 21:57:02,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 117 transitions, 606 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-10-31 21:57:02,102 INFO L231 Difference]: Finished difference. Result has 78 places, 66 transitions, 299 flow [2024-10-31 21:57:02,102 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=299, PETRI_PLACES=78, PETRI_TRANSITIONS=66} [2024-10-31 21:57:02,103 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, 21 predicate places. [2024-10-31 21:57:02,103 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 66 transitions, 299 flow [2024-10-31 21:57:02,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:57:02,104 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:57:02,104 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:57:02,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 21:57:02,105 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-31 21:57:02,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:02,105 INFO L85 PathProgramCache]: Analyzing trace with hash 816736917, now seen corresponding path program 4 times [2024-10-31 21:57:02,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:02,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666072388] [2024-10-31 21:57:02,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:02,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:02,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:57:02,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:02,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666072388] [2024-10-31 21:57:02,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666072388] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:02,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:02,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 21:57:02,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444033290] [2024-10-31 21:57:02,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:02,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 21:57:02,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:02,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 21:57:02,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-31 21:57:02,608 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 49 [2024-10-31 21:57:02,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 66 transitions, 299 flow. Second operand has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:57:02,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:57:02,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 49 [2024-10-31 21:57:02,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:57:04,476 INFO L124 PetriNetUnfolderBase]: 9510/16112 cut-off events. [2024-10-31 21:57:04,476 INFO L125 PetriNetUnfolderBase]: For 11588/11690 co-relation queries the response was YES. [2024-10-31 21:57:04,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37961 conditions, 16112 events. 9510/16112 cut-off events. For 11588/11690 co-relation queries the response was YES. Maximal size of possible extension queue 1130. Compared 131544 event pairs, 2635 based on Foata normal form. 64/14998 useless extension candidates. Maximal degree in co-relation 37939. Up to 6990 conditions per place. [2024-10-31 21:57:04,565 INFO L140 encePairwiseOnDemand]: 40/49 looper letters, 27 selfloop transitions, 3 changer transitions 68/127 dead transitions. [2024-10-31 21:57:04,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 127 transitions, 740 flow [2024-10-31 21:57:04,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 21:57:04,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-31 21:57:04,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 242 transitions. [2024-10-31 21:57:04,567 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6173469387755102 [2024-10-31 21:57:04,567 INFO L175 Difference]: Start difference. First operand has 78 places, 66 transitions, 299 flow. Second operand 8 states and 242 transitions. [2024-10-31 21:57:04,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 127 transitions, 740 flow [2024-10-31 21:57:04,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 127 transitions, 706 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-10-31 21:57:04,599 INFO L231 Difference]: Finished difference. Result has 82 places, 55 transitions, 206 flow [2024-10-31 21:57:04,600 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=206, PETRI_PLACES=82, PETRI_TRANSITIONS=55} [2024-10-31 21:57:04,600 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, 25 predicate places. [2024-10-31 21:57:04,601 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 55 transitions, 206 flow [2024-10-31 21:57:04,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 7 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:57:04,601 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:57:04,601 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:57:04,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 21:57:04,602 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-31 21:57:04,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:04,602 INFO L85 PathProgramCache]: Analyzing trace with hash 891898083, now seen corresponding path program 5 times [2024-10-31 21:57:04,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:04,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462676360] [2024-10-31 21:57:04,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:04,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:04,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:57:07,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:57:07,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:57:07,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462676360] [2024-10-31 21:57:07,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462676360] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:57:07,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:57:07,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-31 21:57:07,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40243839] [2024-10-31 21:57:07,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:57:07,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-31 21:57:07,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:57:07,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-31 21:57:07,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-31 21:57:07,631 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 49 [2024-10-31 21:57:07,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 55 transitions, 206 flow. Second operand has 10 states, 10 states have (on average 25.8) internal successors, (258), 10 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:57:07,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:57:07,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 49 [2024-10-31 21:57:07,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:57:08,324 INFO L124 PetriNetUnfolderBase]: 1143/2146 cut-off events. [2024-10-31 21:57:08,325 INFO L125 PetriNetUnfolderBase]: For 371/378 co-relation queries the response was YES. [2024-10-31 21:57:08,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4488 conditions, 2146 events. 1143/2146 cut-off events. For 371/378 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 13192 event pairs, 346 based on Foata normal form. 19/1985 useless extension candidates. Maximal degree in co-relation 4464. Up to 717 conditions per place. [2024-10-31 21:57:08,339 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 29 selfloop transitions, 5 changer transitions 12/79 dead transitions. [2024-10-31 21:57:08,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 79 transitions, 358 flow [2024-10-31 21:57:08,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-31 21:57:08,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-31 21:57:08,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 263 transitions. [2024-10-31 21:57:08,342 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5963718820861678 [2024-10-31 21:57:08,342 INFO L175 Difference]: Start difference. First operand has 82 places, 55 transitions, 206 flow. Second operand 9 states and 263 transitions. [2024-10-31 21:57:08,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 79 transitions, 358 flow [2024-10-31 21:57:08,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 79 transitions, 334 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-10-31 21:57:08,350 INFO L231 Difference]: Finished difference. Result has 82 places, 56 transitions, 217 flow [2024-10-31 21:57:08,351 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=217, PETRI_PLACES=82, PETRI_TRANSITIONS=56} [2024-10-31 21:57:08,352 INFO L277 CegarLoopForPetriNet]: 57 programPoint places, 25 predicate places. [2024-10-31 21:57:08,354 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 56 transitions, 217 flow [2024-10-31 21:57:08,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 25.8) internal successors, (258), 10 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:57:08,354 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:57:08,355 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:57:08,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 21:57:08,355 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-31 21:57:08,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:08,355 INFO L85 PathProgramCache]: Analyzing trace with hash -645880889, now seen corresponding path program 6 times [2024-10-31 21:57:08,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:08,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982745978] [2024-10-31 21:57:08,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:08,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:08,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:57:08,485 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 21:57:08,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:57:08,645 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 21:57:08,645 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 21:57:08,646 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-10-31 21:57:08,650 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-10-31 21:57:08,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-10-31 21:57:08,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-10-31 21:57:08,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-10-31 21:57:08,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-10-31 21:57:08,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-10-31 21:57:08,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 21:57:08,653 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1] [2024-10-31 21:57:08,771 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-31 21:57:08,771 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 21:57:08,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 09:57:08 BasicIcfg [2024-10-31 21:57:08,777 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 21:57:08,778 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 21:57:08,778 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 21:57:08,779 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 21:57:08,779 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:56:47" (3/4) ... [2024-10-31 21:57:08,780 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-31 21:57:08,915 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aad9bb19-291c-41ac-a6a4-63d07312de0e/bin/uautomizer-verify-4GaUIPS5ZU/witness.graphml [2024-10-31 21:57:08,917 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 21:57:08,918 INFO L158 Benchmark]: Toolchain (without parser) took 23312.65ms. Allocated memory was 138.4MB in the beginning and 826.3MB in the end (delta: 687.9MB). Free memory was 95.7MB in the beginning and 529.2MB in the end (delta: -433.5MB). Peak memory consumption was 255.8MB. Max. memory is 16.1GB. [2024-10-31 21:57:08,919 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 138.4MB. Free memory is still 83.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 21:57:08,919 INFO L158 Benchmark]: CACSL2BoogieTranslator took 919.64ms. Allocated memory is still 138.4MB. Free memory was 95.4MB in the beginning and 68.5MB in the end (delta: 26.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-31 21:57:08,919 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.49ms. Allocated memory is still 138.4MB. Free memory was 68.5MB in the beginning and 65.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 21:57:08,920 INFO L158 Benchmark]: Boogie Preprocessor took 95.07ms. Allocated memory is still 138.4MB. Free memory was 65.6MB in the beginning and 61.8MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-31 21:57:08,920 INFO L158 Benchmark]: RCFGBuilder took 1002.49ms. Allocated memory was 138.4MB in the beginning and 174.1MB in the end (delta: 35.7MB). Free memory was 61.8MB in the beginning and 90.8MB in the end (delta: -29.0MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. [2024-10-31 21:57:08,920 INFO L158 Benchmark]: TraceAbstraction took 21056.27ms. Allocated memory was 174.1MB in the beginning and 826.3MB in the end (delta: 652.2MB). Free memory was 90.0MB in the beginning and 549.1MB in the end (delta: -459.1MB). Peak memory consumption was 191.8MB. Max. memory is 16.1GB. [2024-10-31 21:57:08,921 INFO L158 Benchmark]: Witness Printer took 139.50ms. Allocated memory is still 826.3MB. Free memory was 549.1MB in the beginning and 529.2MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-31 21:57:08,923 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.33ms. Allocated memory is still 138.4MB. Free memory is still 83.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 919.64ms. Allocated memory is still 138.4MB. Free memory was 95.4MB in the beginning and 68.5MB in the end (delta: 26.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.49ms. Allocated memory is still 138.4MB. Free memory was 68.5MB in the beginning and 65.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 95.07ms. Allocated memory is still 138.4MB. Free memory was 65.6MB in the beginning and 61.8MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1002.49ms. Allocated memory was 138.4MB in the beginning and 174.1MB in the end (delta: 35.7MB). Free memory was 61.8MB in the beginning and 90.8MB in the end (delta: -29.0MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. * TraceAbstraction took 21056.27ms. Allocated memory was 174.1MB in the beginning and 826.3MB in the end (delta: 652.2MB). Free memory was 90.0MB in the beginning and 549.1MB in the end (delta: -459.1MB). Peak memory consumption was 191.8MB. Max. memory is 16.1GB. * Witness Printer took 139.50ms. Allocated memory is still 826.3MB. Free memory was 549.1MB in the beginning and 529.2MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L866] 0 pthread_t t445; [L867] FCALL, FORK 0 pthread_create(&t445, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t445=-2, weak$$choice0=0, weak$$choice2=0, x=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] [L868] 0 pthread_t t446; [L869] FCALL, FORK 0 pthread_create(&t446, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t445=-2, t446=-1, weak$$choice0=0, weak$$choice2=0, x=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] [L870] 0 pthread_t t447; [L871] FCALL, FORK 0 pthread_create(&t447, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t445=-2, t446=-1, t447=0, weak$$choice0=0, weak$$choice2=0, x=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] [L872] 0 pthread_t t448; [L873] FCALL, FORK 0 pthread_create(&t448, ((void *)0), P3, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t445=-2, t446=-1, t447=0, t448=1, weak$$choice0=0, weak$$choice2=0, x=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] [L812] 4 z$w_buff1 = z$w_buff0 [L813] 4 z$w_buff0 = 1 [L814] 4 z$w_buff1_used = z$w_buff0_used [L815] 4 z$w_buff0_used = (_Bool)1 [L816] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L816] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L817] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L818] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L819] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L820] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L821] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L825] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L826] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L827] 4 z$flush_delayed = weak$$choice2 [L828] 4 z$mem_tmp = z [L829] 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) [L830] 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)) [L831] 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)) [L832] 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)) [L833] 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)) [L834] 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)) [L835] 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)) [L836] 4 __unbuffered_p3_EAX = z [L837] 4 z = z$flush_delayed ? z$mem_tmp : z [L838] 4 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=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] [L841] 4 __unbuffered_p3_EBX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=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] [L754] 1 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=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] [L757] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=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] [L769] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, 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] [L772] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, 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] [L784] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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$$choice0=1, weak$$choice2=1, x=1, 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=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L787] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 3 z$flush_delayed = weak$$choice2 [L790] 3 z$mem_tmp = z [L791] 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) [L792] 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)) [L793] 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)) [L794] 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)) [L795] 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)) [L796] 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)) [L797] 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)) [L798] 3 __unbuffered_p2_EAX = z [L799] 3 z = z$flush_delayed ? z$mem_tmp : z [L800] 3 z$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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$$choice0=1, weak$$choice2=1, x=1, 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=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L844] 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) [L845] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L846] 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 [L847] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L848] 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 [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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$$choice0=1, weak$$choice2=1, x=1, 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] [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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$$choice0=1, weak$$choice2=1, x=1, 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] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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$$choice0=1, weak$$choice2=1, x=1, 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] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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$$choice0=1, weak$$choice2=1, x=1, 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] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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$$choice0=1, weak$$choice2=1, x=1, 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] [L875] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t445=-2, t446=-1, t447=0, t448=1, weak$$choice0=1, weak$$choice2=1, x=1, 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] [L877] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L877] RET 0 assume_abort_if_not(main$tmp_guard0) [L879] 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) [L880] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L881] 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 [L882] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L883] 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 [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t445=-2, t446=-1, t447=0, t448=1, weak$$choice0=1, weak$$choice2=1, x=1, 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] [L886] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t445=-2, t446=-1, t447=0, t448=1, weak$$choice0=1, weak$$choice2=1, x=1, 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] [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, 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] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, 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] - 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: 871]: 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: 869]: 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: 873]: 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: 867]: 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, 83 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.8s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 12.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 683 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 655 mSDsluCounter, 214 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 185 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1532 IncrementalHoareTripleChecker+Invalid, 1567 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 29 mSDtfsCounter, 1532 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=299occurred in iteration=8, InterpolantAutomatonStates: 63, 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.3s InterpolantComputationTime, 326 NumberOfCodeBlocks, 326 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 279 ConstructedInterpolants, 0 QuantifiedInterpolants, 1986 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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! [2024-10-31 21:57:08,964 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aad9bb19-291c-41ac-a6a4-63d07312de0e/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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