/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-18 22:46:21,022 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-18 22:46:21,023 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-18 22:46:21,054 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-18 22:46:21,075 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-18 22:46:21,078 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-18 22:46:21,079 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-18 22:46:21,080 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-18 22:46:21,081 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-18 22:46:21,086 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-18 22:46:21,087 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-18 22:46:21,089 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-18 22:46:21,089 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-18 22:46:21,092 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-18 22:46:21,092 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-18 22:46:21,093 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-18 22:46:21,093 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-18 22:46:21,094 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-18 22:46:21,095 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-18 22:46:21,096 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-18 22:46:21,096 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-18 22:46:21,101 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-18 22:46:21,103 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-18 22:46:21,104 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-18 22:46:21,107 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-18 22:46:21,107 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-18 22:46:21,107 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-18 22:46:21,108 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-18 22:46:21,108 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-18 22:46:21,108 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-18 22:46:21,109 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-18 22:46:21,109 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-18 22:46:21,109 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-18 22:46:21,110 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-18 22:46:21,110 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-18 22:46:21,110 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-18 22:46:21,111 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-18 22:46:21,111 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-18 22:46:21,111 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-18 22:46:21,112 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-18 22:46:21,112 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-18 22:46:21,115 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-01-18 22:46:21,129 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-18 22:46:21,129 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-18 22:46:21,130 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-18 22:46:21,130 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-18 22:46:21,130 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-18 22:46:21,130 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-18 22:46:21,130 INFO L138 SettingsManager]: * Use SBE=true [2022-01-18 22:46:21,131 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-18 22:46:21,131 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-18 22:46:21,131 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-18 22:46:21,131 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-18 22:46:21,131 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-18 22:46:21,131 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-18 22:46:21,131 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-18 22:46:21,131 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-18 22:46:21,131 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-18 22:46:21,131 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-18 22:46:21,131 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-18 22:46:21,132 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-18 22:46:21,132 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-18 22:46:21,132 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-18 22:46:21,132 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-18 22:46:21,132 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-18 22:46:21,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 22:46:21,132 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-18 22:46:21,132 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-18 22:46:21,132 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-18 22:46:21,133 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-18 22:46:21,133 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-18 22:46:21,133 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-18 22:46:21,133 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-18 22:46:21,133 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-01-18 22:46:21,317 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-18 22:46:21,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-18 22:46:21,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-18 22:46:21,340 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-18 22:46:21,340 INFO L275 PluginConnector]: CDTParser initialized [2022-01-18 22:46:21,341 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i [2022-01-18 22:46:21,384 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94cf7482c/d9872ef4a8f24745930aae429f60732c/FLAGbe9103a84 [2022-01-18 22:46:21,825 INFO L306 CDTParser]: Found 1 translation units. [2022-01-18 22:46:21,825 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i [2022-01-18 22:46:21,844 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94cf7482c/d9872ef4a8f24745930aae429f60732c/FLAGbe9103a84 [2022-01-18 22:46:21,859 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94cf7482c/d9872ef4a8f24745930aae429f60732c [2022-01-18 22:46:21,861 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-18 22:46:21,862 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-18 22:46:21,863 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-18 22:46:21,863 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-18 22:46:21,865 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-18 22:46:21,866 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 10:46:21" (1/1) ... [2022-01-18 22:46:21,866 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@529b1619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:46:21, skipping insertion in model container [2022-01-18 22:46:21,866 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.01 10:46:21" (1/1) ... [2022-01-18 22:46:21,871 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-18 22:46:21,909 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-18 22:46:22,067 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i[964,977] [2022-01-18 22:46:22,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 22:46:22,213 INFO L203 MainTranslator]: Completed pre-run [2022-01-18 22:46:22,220 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix051_pso.opt_rmo.opt_tso.opt.i[964,977] [2022-01-18 22:46:22,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-18 22:46:22,295 INFO L208 MainTranslator]: Completed translation [2022-01-18 22:46:22,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:46:22 WrapperNode [2022-01-18 22:46:22,296 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-18 22:46:22,297 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-18 22:46:22,297 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-18 22:46:22,297 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-18 22:46:22,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:46:22" (1/1) ... [2022-01-18 22:46:22,314 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:46:22" (1/1) ... [2022-01-18 22:46:22,329 INFO L137 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 192 [2022-01-18 22:46:22,329 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-18 22:46:22,330 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-18 22:46:22,330 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-18 22:46:22,330 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-18 22:46:22,335 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:46:22" (1/1) ... [2022-01-18 22:46:22,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:46:22" (1/1) ... [2022-01-18 22:46:22,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:46:22" (1/1) ... [2022-01-18 22:46:22,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:46:22" (1/1) ... [2022-01-18 22:46:22,344 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:46:22" (1/1) ... [2022-01-18 22:46:22,346 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:46:22" (1/1) ... [2022-01-18 22:46:22,348 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:46:22" (1/1) ... [2022-01-18 22:46:22,350 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-18 22:46:22,351 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-18 22:46:22,351 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-18 22:46:22,351 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-18 22:46:22,368 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:46:22" (1/1) ... [2022-01-18 22:46:22,373 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-18 22:46:22,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-18 22:46:22,391 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-18 22:46:22,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-18 22:46:22,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-18 22:46:22,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-18 22:46:22,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-18 22:46:22,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-18 22:46:22,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-18 22:46:22,421 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-01-18 22:46:22,421 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-01-18 22:46:22,421 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-01-18 22:46:22,421 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-01-18 22:46:22,421 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-01-18 22:46:22,424 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-01-18 22:46:22,424 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-01-18 22:46:22,424 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-01-18 22:46:22,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-18 22:46:22,424 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-18 22:46:22,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-18 22:46:22,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-18 22:46:22,426 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-18 22:46:22,522 INFO L234 CfgBuilder]: Building ICFG [2022-01-18 22:46:22,523 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-18 22:46:22,858 INFO L275 CfgBuilder]: Performing block encoding [2022-01-18 22:46:23,045 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-18 22:46:23,045 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-18 22:46:23,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 10:46:23 BoogieIcfgContainer [2022-01-18 22:46:23,047 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-18 22:46:23,049 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-18 22:46:23,049 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-18 22:46:23,051 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-18 22:46:23,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.01 10:46:21" (1/3) ... [2022-01-18 22:46:23,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5cca7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 10:46:23, skipping insertion in model container [2022-01-18 22:46:23,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.01 10:46:22" (2/3) ... [2022-01-18 22:46:23,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5cca7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 10:46:23, skipping insertion in model container [2022-01-18 22:46:23,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 10:46:23" (3/3) ... [2022-01-18 22:46:23,054 INFO L111 eAbstractionObserver]: Analyzing ICFG mix051_pso.opt_rmo.opt_tso.opt.i [2022-01-18 22:46:23,058 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-18 22:46:23,058 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-18 22:46:23,058 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-18 22:46:23,095 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,095 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,095 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,095 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,095 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,096 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,096 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,096 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,096 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,096 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,096 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,097 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,097 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,097 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,097 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,098 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,098 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,098 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,098 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,098 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,098 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,099 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,099 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,099 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,099 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,099 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,099 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,099 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,100 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,100 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,100 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,100 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,100 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,100 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,100 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,100 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,100 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,100 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,100 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,101 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,101 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,101 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,101 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,101 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,101 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,101 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,101 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,101 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,102 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,102 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,102 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,102 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,102 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,102 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,102 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,102 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,102 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,102 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,102 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,102 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,103 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,103 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,103 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,103 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,103 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,103 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,103 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,103 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,103 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,103 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,106 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,107 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,107 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,107 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,107 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,107 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,107 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,107 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,107 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,107 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,108 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,108 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,108 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,108 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,108 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,108 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,109 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,109 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,109 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,109 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,112 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,116 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,116 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,116 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,116 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,116 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,116 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,116 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,116 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,116 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,116 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,116 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,116 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,117 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,117 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,117 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,117 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,117 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,121 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,122 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,122 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,122 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,122 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,122 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,122 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,122 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,122 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,122 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,123 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,123 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,123 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,123 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,123 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,123 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,123 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,123 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,124 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,124 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,124 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,124 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,124 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,124 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,124 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,124 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,124 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,125 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,125 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,125 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,125 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,125 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,125 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,125 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,126 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,126 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,126 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,126 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,128 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,128 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,128 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,128 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,128 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,129 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,129 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,129 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,129 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,129 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,129 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,129 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,130 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,130 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,130 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,130 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,130 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,130 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,130 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,130 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,130 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,130 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,130 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,130 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,131 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,131 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,131 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,132 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,132 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,132 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,132 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,132 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,132 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,132 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,132 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,133 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,133 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,133 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,133 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,133 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,133 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,133 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,133 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,134 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,134 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,134 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,134 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-18 22:46:23,134 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-18 22:46:23,169 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-18 22:46:23,174 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-18 22:46:23,175 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-01-18 22:46:23,184 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 144 places, 133 transitions, 286 flow [2022-01-18 22:46:23,228 INFO L129 PetriNetUnfolder]: 2/129 cut-off events. [2022-01-18 22:46:23,229 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-18 22:46:23,231 INFO L84 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2022-01-18 22:46:23,231 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 133 transitions, 286 flow [2022-01-18 22:46:23,236 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 129 transitions, 270 flow [2022-01-18 22:46:23,260 INFO L129 PetriNetUnfolder]: 0/90 cut-off events. [2022-01-18 22:46:23,260 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-18 22:46:23,260 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:46:23,261 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:46:23,261 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-18 22:46:23,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:46:23,265 INFO L85 PathProgramCache]: Analyzing trace with hash 524967423, now seen corresponding path program 1 times [2022-01-18 22:46:23,271 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:46:23,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352321323] [2022-01-18 22:46:23,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:46:23,272 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:46:23,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:46:23,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:46:23,549 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:46:23,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352321323] [2022-01-18 22:46:23,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352321323] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:46:23,552 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:46:23,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-18 22:46:23,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086570290] [2022-01-18 22:46:23,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:46:23,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-18 22:46:23,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:46:23,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-18 22:46:23,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-18 22:46:23,581 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 133 [2022-01-18 22:46:23,587 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 129 transitions, 270 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 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) [2022-01-18 22:46:23,587 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:46:23,587 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 133 [2022-01-18 22:46:23,588 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:46:23,676 INFO L129 PetriNetUnfolder]: 10/201 cut-off events. [2022-01-18 22:46:23,677 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-01-18 22:46:23,678 INFO L84 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 201 events. 10/201 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 359 event pairs, 4 based on Foata normal form. 5/197 useless extension candidates. Maximal degree in co-relation 187. Up to 17 conditions per place. [2022-01-18 22:46:23,680 INFO L132 encePairwiseOnDemand]: 128/133 looper letters, 9 selfloop transitions, 2 changer transitions 0/127 dead transitions. [2022-01-18 22:46:23,680 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 127 transitions, 288 flow [2022-01-18 22:46:23,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-18 22:46:23,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-18 22:46:23,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2022-01-18 22:46:23,692 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9423558897243107 [2022-01-18 22:46:23,692 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2022-01-18 22:46:23,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2022-01-18 22:46:23,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:46:23,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2022-01-18 22:46:23,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 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) [2022-01-18 22:46:23,705 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 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) [2022-01-18 22:46:23,706 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 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) [2022-01-18 22:46:23,707 INFO L186 Difference]: Start difference. First operand has 140 places, 129 transitions, 270 flow. Second operand 3 states and 376 transitions. [2022-01-18 22:46:23,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 127 transitions, 288 flow [2022-01-18 22:46:23,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 127 transitions, 284 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-01-18 22:46:23,712 INFO L242 Difference]: Finished difference. Result has 136 places, 125 transitions, 262 flow [2022-01-18 22:46:23,714 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=262, PETRI_PLACES=136, PETRI_TRANSITIONS=125} [2022-01-18 22:46:23,716 INFO L334 CegarLoopForPetriNet]: 140 programPoint places, -4 predicate places. [2022-01-18 22:46:23,716 INFO L470 AbstractCegarLoop]: Abstraction has has 136 places, 125 transitions, 262 flow [2022-01-18 22:46:23,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 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) [2022-01-18 22:46:23,716 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:46:23,717 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:46:23,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-18 22:46:23,718 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-18 22:46:23,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:46:23,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1408801840, now seen corresponding path program 1 times [2022-01-18 22:46:23,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:46:23,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435337832] [2022-01-18 22:46:23,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:46:23,719 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:46:23,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:46:23,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:46:23,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:46:23,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435337832] [2022-01-18 22:46:23,871 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435337832] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:46:23,871 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:46:23,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 22:46:23,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236846283] [2022-01-18 22:46:23,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:46:23,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 22:46:23,873 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:46:23,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 22:46:23,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-18 22:46:23,874 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 133 [2022-01-18 22:46:23,875 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 125 transitions, 262 flow. Second operand has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 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) [2022-01-18 22:46:23,875 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:46:23,875 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 133 [2022-01-18 22:46:23,875 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:46:24,750 INFO L129 PetriNetUnfolder]: 1843/5139 cut-off events. [2022-01-18 22:46:24,750 INFO L130 PetriNetUnfolder]: For 209/209 co-relation queries the response was YES. [2022-01-18 22:46:24,762 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8169 conditions, 5139 events. 1843/5139 cut-off events. For 209/209 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 46574 event pairs, 504 based on Foata normal form. 0/4987 useless extension candidates. Maximal degree in co-relation 8110. Up to 1243 conditions per place. [2022-01-18 22:46:24,775 INFO L132 encePairwiseOnDemand]: 123/133 looper letters, 30 selfloop transitions, 6 changer transitions 66/191 dead transitions. [2022-01-18 22:46:24,775 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 191 transitions, 590 flow [2022-01-18 22:46:24,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-18 22:46:24,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-18 22:46:24,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1045 transitions. [2022-01-18 22:46:24,779 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.873015873015873 [2022-01-18 22:46:24,779 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1045 transitions. [2022-01-18 22:46:24,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1045 transitions. [2022-01-18 22:46:24,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:46:24,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1045 transitions. [2022-01-18 22:46:24,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 116.11111111111111) internal successors, (1045), 9 states have internal predecessors, (1045), 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) [2022-01-18 22:46:24,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 133.0) internal successors, (1330), 10 states have internal predecessors, (1330), 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) [2022-01-18 22:46:24,786 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 133.0) internal successors, (1330), 10 states have internal predecessors, (1330), 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) [2022-01-18 22:46:24,786 INFO L186 Difference]: Start difference. First operand has 136 places, 125 transitions, 262 flow. Second operand 9 states and 1045 transitions. [2022-01-18 22:46:24,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 191 transitions, 590 flow [2022-01-18 22:46:24,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 191 transitions, 572 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-18 22:46:24,792 INFO L242 Difference]: Finished difference. Result has 150 places, 116 transitions, 318 flow [2022-01-18 22:46:24,792 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=318, PETRI_PLACES=150, PETRI_TRANSITIONS=116} [2022-01-18 22:46:24,792 INFO L334 CegarLoopForPetriNet]: 140 programPoint places, 10 predicate places. [2022-01-18 22:46:24,792 INFO L470 AbstractCegarLoop]: Abstraction has has 150 places, 116 transitions, 318 flow [2022-01-18 22:46:24,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 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) [2022-01-18 22:46:24,793 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:46:24,793 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:46:24,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-18 22:46:24,793 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-18 22:46:24,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:46:24,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1797657935, now seen corresponding path program 1 times [2022-01-18 22:46:24,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:46:24,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615703389] [2022-01-18 22:46:24,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:46:24,794 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:46:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:46:24,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:46:24,972 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:46:24,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615703389] [2022-01-18 22:46:24,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615703389] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:46:24,972 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:46:24,973 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 22:46:24,973 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049371863] [2022-01-18 22:46:24,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:46:24,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 22:46:24,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:46:24,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 22:46:24,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-18 22:46:24,974 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 133 [2022-01-18 22:46:24,975 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 116 transitions, 318 flow. Second operand has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 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) [2022-01-18 22:46:24,975 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:46:24,975 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 133 [2022-01-18 22:46:24,975 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:46:26,251 INFO L129 PetriNetUnfolder]: 5863/10784 cut-off events. [2022-01-18 22:46:26,251 INFO L130 PetriNetUnfolder]: For 10553/12236 co-relation queries the response was YES. [2022-01-18 22:46:26,287 INFO L84 FinitePrefix]: Finished finitePrefix Result has 25382 conditions, 10784 events. 5863/10784 cut-off events. For 10553/12236 co-relation queries the response was YES. Maximal size of possible extension queue 857. Compared 92808 event pairs, 362 based on Foata normal form. 58/10027 useless extension candidates. Maximal degree in co-relation 25318. Up to 3460 conditions per place. [2022-01-18 22:46:26,322 INFO L132 encePairwiseOnDemand]: 122/133 looper letters, 51 selfloop transitions, 16 changer transitions 22/184 dead transitions. [2022-01-18 22:46:26,322 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 184 transitions, 722 flow [2022-01-18 22:46:26,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-18 22:46:26,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-18 22:46:26,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1173 transitions. [2022-01-18 22:46:26,325 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8819548872180452 [2022-01-18 22:46:26,325 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1173 transitions. [2022-01-18 22:46:26,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1173 transitions. [2022-01-18 22:46:26,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:46:26,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1173 transitions. [2022-01-18 22:46:26,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 117.3) internal successors, (1173), 10 states have internal predecessors, (1173), 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) [2022-01-18 22:46:26,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 133.0) internal successors, (1463), 11 states have internal predecessors, (1463), 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) [2022-01-18 22:46:26,330 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 133.0) internal successors, (1463), 11 states have internal predecessors, (1463), 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) [2022-01-18 22:46:26,330 INFO L186 Difference]: Start difference. First operand has 150 places, 116 transitions, 318 flow. Second operand 10 states and 1173 transitions. [2022-01-18 22:46:26,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 184 transitions, 722 flow [2022-01-18 22:46:26,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 184 transitions, 690 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-01-18 22:46:26,348 INFO L242 Difference]: Finished difference. Result has 143 places, 130 transitions, 421 flow [2022-01-18 22:46:26,348 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=421, PETRI_PLACES=143, PETRI_TRANSITIONS=130} [2022-01-18 22:46:26,349 INFO L334 CegarLoopForPetriNet]: 140 programPoint places, 3 predicate places. [2022-01-18 22:46:26,349 INFO L470 AbstractCegarLoop]: Abstraction has has 143 places, 130 transitions, 421 flow [2022-01-18 22:46:26,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 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) [2022-01-18 22:46:26,350 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:46:26,351 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:46:26,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-18 22:46:26,351 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-18 22:46:26,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:46:26,351 INFO L85 PathProgramCache]: Analyzing trace with hash -696813022, now seen corresponding path program 1 times [2022-01-18 22:46:26,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:46:26,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991228505] [2022-01-18 22:46:26,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:46:26,352 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:46:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:46:26,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:46:26,500 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:46:26,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991228505] [2022-01-18 22:46:26,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991228505] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:46:26,500 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:46:26,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 22:46:26,501 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522117732] [2022-01-18 22:46:26,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:46:26,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 22:46:26,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:46:26,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 22:46:26,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-18 22:46:26,506 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 133 [2022-01-18 22:46:26,506 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 130 transitions, 421 flow. Second operand has 7 states, 7 states have (on average 110.85714285714286) internal successors, (776), 7 states have internal predecessors, (776), 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) [2022-01-18 22:46:26,506 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:46:26,506 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 133 [2022-01-18 22:46:26,506 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:46:27,904 INFO L129 PetriNetUnfolder]: 5240/10153 cut-off events. [2022-01-18 22:46:27,905 INFO L130 PetriNetUnfolder]: For 23222/25417 co-relation queries the response was YES. [2022-01-18 22:46:27,952 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33948 conditions, 10153 events. 5240/10153 cut-off events. For 23222/25417 co-relation queries the response was YES. Maximal size of possible extension queue 904. Compared 92246 event pairs, 191 based on Foata normal form. 344/9959 useless extension candidates. Maximal degree in co-relation 33877. Up to 3125 conditions per place. [2022-01-18 22:46:27,979 INFO L132 encePairwiseOnDemand]: 122/133 looper letters, 83 selfloop transitions, 32 changer transitions 7/217 dead transitions. [2022-01-18 22:46:27,980 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 217 transitions, 1145 flow [2022-01-18 22:46:27,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-18 22:46:27,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-18 22:46:27,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1524 transitions. [2022-01-18 22:46:27,983 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8814343551185656 [2022-01-18 22:46:27,983 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1524 transitions. [2022-01-18 22:46:27,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1524 transitions. [2022-01-18 22:46:27,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:46:27,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1524 transitions. [2022-01-18 22:46:27,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 117.23076923076923) internal successors, (1524), 13 states have internal predecessors, (1524), 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) [2022-01-18 22:46:27,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 133.0) internal successors, (1862), 14 states have internal predecessors, (1862), 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) [2022-01-18 22:46:27,988 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 133.0) internal successors, (1862), 14 states have internal predecessors, (1862), 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) [2022-01-18 22:46:27,988 INFO L186 Difference]: Start difference. First operand has 143 places, 130 transitions, 421 flow. Second operand 13 states and 1524 transitions. [2022-01-18 22:46:27,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 217 transitions, 1145 flow [2022-01-18 22:46:28,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 217 transitions, 1137 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-01-18 22:46:28,047 INFO L242 Difference]: Finished difference. Result has 157 places, 148 transitions, 678 flow [2022-01-18 22:46:28,047 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=678, PETRI_PLACES=157, PETRI_TRANSITIONS=148} [2022-01-18 22:46:28,047 INFO L334 CegarLoopForPetriNet]: 140 programPoint places, 17 predicate places. [2022-01-18 22:46:28,048 INFO L470 AbstractCegarLoop]: Abstraction has has 157 places, 148 transitions, 678 flow [2022-01-18 22:46:28,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.85714285714286) internal successors, (776), 7 states have internal predecessors, (776), 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) [2022-01-18 22:46:28,048 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:46:28,048 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:46:28,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-18 22:46:28,048 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-18 22:46:28,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:46:28,049 INFO L85 PathProgramCache]: Analyzing trace with hash -159453042, now seen corresponding path program 1 times [2022-01-18 22:46:28,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:46:28,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135939772] [2022-01-18 22:46:28,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:46:28,049 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:46:28,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:46:28,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:46:28,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:46:28,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135939772] [2022-01-18 22:46:28,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135939772] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:46:28,241 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:46:28,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-18 22:46:28,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895063461] [2022-01-18 22:46:28,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:46:28,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-18 22:46:28,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:46:28,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-18 22:46:28,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-18 22:46:28,243 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 133 [2022-01-18 22:46:28,244 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 148 transitions, 678 flow. Second operand has 8 states, 8 states have (on average 110.75) internal successors, (886), 8 states have internal predecessors, (886), 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) [2022-01-18 22:46:28,244 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:46:28,244 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 133 [2022-01-18 22:46:28,244 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:46:29,417 INFO L129 PetriNetUnfolder]: 4755/9965 cut-off events. [2022-01-18 22:46:29,417 INFO L130 PetriNetUnfolder]: For 43772/46826 co-relation queries the response was YES. [2022-01-18 22:46:29,468 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41328 conditions, 9965 events. 4755/9965 cut-off events. For 43772/46826 co-relation queries the response was YES. Maximal size of possible extension queue 906. Compared 97180 event pairs, 212 based on Foata normal form. 425/9859 useless extension candidates. Maximal degree in co-relation 41252. Up to 3058 conditions per place. [2022-01-18 22:46:29,487 INFO L132 encePairwiseOnDemand]: 122/133 looper letters, 80 selfloop transitions, 50 changer transitions 27/252 dead transitions. [2022-01-18 22:46:29,488 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 252 transitions, 1740 flow [2022-01-18 22:46:29,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-18 22:46:29,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-18 22:46:29,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1878 transitions. [2022-01-18 22:46:29,491 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8825187969924813 [2022-01-18 22:46:29,491 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1878 transitions. [2022-01-18 22:46:29,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1878 transitions. [2022-01-18 22:46:29,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:46:29,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1878 transitions. [2022-01-18 22:46:29,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 117.375) internal successors, (1878), 16 states have internal predecessors, (1878), 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) [2022-01-18 22:46:29,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 133.0) internal successors, (2261), 17 states have internal predecessors, (2261), 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) [2022-01-18 22:46:29,584 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 133.0) internal successors, (2261), 17 states have internal predecessors, (2261), 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) [2022-01-18 22:46:29,585 INFO L186 Difference]: Start difference. First operand has 157 places, 148 transitions, 678 flow. Second operand 16 states and 1878 transitions. [2022-01-18 22:46:29,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 252 transitions, 1740 flow [2022-01-18 22:46:29,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 252 transitions, 1641 flow, removed 42 selfloop flow, removed 4 redundant places. [2022-01-18 22:46:29,996 INFO L242 Difference]: Finished difference. Result has 172 places, 172 transitions, 1013 flow [2022-01-18 22:46:29,997 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1013, PETRI_PLACES=172, PETRI_TRANSITIONS=172} [2022-01-18 22:46:29,997 INFO L334 CegarLoopForPetriNet]: 140 programPoint places, 32 predicate places. [2022-01-18 22:46:29,997 INFO L470 AbstractCegarLoop]: Abstraction has has 172 places, 172 transitions, 1013 flow [2022-01-18 22:46:29,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 110.75) internal successors, (886), 8 states have internal predecessors, (886), 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) [2022-01-18 22:46:29,998 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:46:29,998 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:46:29,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-18 22:46:29,998 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-18 22:46:29,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:46:29,998 INFO L85 PathProgramCache]: Analyzing trace with hash -533481200, now seen corresponding path program 1 times [2022-01-18 22:46:29,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:46:29,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260898344] [2022-01-18 22:46:29,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:46:29,999 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:46:30,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:46:30,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:46:30,074 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:46:30,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260898344] [2022-01-18 22:46:30,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260898344] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:46:30,075 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:46:30,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 22:46:30,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300344005] [2022-01-18 22:46:30,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:46:30,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 22:46:30,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:46:30,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 22:46:30,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-18 22:46:30,076 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 133 [2022-01-18 22:46:30,077 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 172 transitions, 1013 flow. Second operand has 7 states, 7 states have (on average 112.28571428571429) internal successors, (786), 7 states have internal predecessors, (786), 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) [2022-01-18 22:46:30,077 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:46:30,077 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 133 [2022-01-18 22:46:30,077 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:46:30,836 INFO L129 PetriNetUnfolder]: 2038/7355 cut-off events. [2022-01-18 22:46:30,837 INFO L130 PetriNetUnfolder]: For 34615/35218 co-relation queries the response was YES. [2022-01-18 22:46:30,882 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27430 conditions, 7355 events. 2038/7355 cut-off events. For 34615/35218 co-relation queries the response was YES. Maximal size of possible extension queue 883. Compared 91864 event pairs, 61 based on Foata normal form. 11/6889 useless extension candidates. Maximal degree in co-relation 27348. Up to 1877 conditions per place. [2022-01-18 22:46:30,911 INFO L132 encePairwiseOnDemand]: 127/133 looper letters, 38 selfloop transitions, 3 changer transitions 13/206 dead transitions. [2022-01-18 22:46:30,912 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 206 transitions, 1257 flow [2022-01-18 22:46:30,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-18 22:46:30,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-18 22:46:30,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 821 transitions. [2022-01-18 22:46:30,913 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8818474758324383 [2022-01-18 22:46:30,913 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 821 transitions. [2022-01-18 22:46:30,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 821 transitions. [2022-01-18 22:46:30,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:46:30,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 821 transitions. [2022-01-18 22:46:30,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.28571428571429) internal successors, (821), 7 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:30,916 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 133.0) internal successors, (1064), 8 states have internal predecessors, (1064), 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) [2022-01-18 22:46:30,917 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 133.0) internal successors, (1064), 8 states have internal predecessors, (1064), 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) [2022-01-18 22:46:30,917 INFO L186 Difference]: Start difference. First operand has 172 places, 172 transitions, 1013 flow. Second operand 7 states and 821 transitions. [2022-01-18 22:46:30,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 206 transitions, 1257 flow [2022-01-18 22:46:31,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 206 transitions, 956 flow, removed 114 selfloop flow, removed 11 redundant places. [2022-01-18 22:46:31,885 INFO L242 Difference]: Finished difference. Result has 172 places, 174 transitions, 749 flow [2022-01-18 22:46:31,885 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=712, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=749, PETRI_PLACES=172, PETRI_TRANSITIONS=174} [2022-01-18 22:46:31,886 INFO L334 CegarLoopForPetriNet]: 140 programPoint places, 32 predicate places. [2022-01-18 22:46:31,886 INFO L470 AbstractCegarLoop]: Abstraction has has 172 places, 174 transitions, 749 flow [2022-01-18 22:46:31,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.28571428571429) internal successors, (786), 7 states have internal predecessors, (786), 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) [2022-01-18 22:46:31,886 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:46:31,886 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:46:31,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-18 22:46:31,886 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-18 22:46:31,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:46:31,887 INFO L85 PathProgramCache]: Analyzing trace with hash -286220876, now seen corresponding path program 2 times [2022-01-18 22:46:31,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:46:31,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799578096] [2022-01-18 22:46:31,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:46:31,887 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:46:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:46:31,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:46:31,997 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:46:31,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799578096] [2022-01-18 22:46:31,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799578096] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:46:31,997 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:46:31,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-18 22:46:31,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176465490] [2022-01-18 22:46:32,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:46:32,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-18 22:46:32,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:46:32,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-18 22:46:32,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-18 22:46:32,002 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 133 [2022-01-18 22:46:32,003 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 174 transitions, 749 flow. Second operand has 9 states, 9 states have (on average 110.77777777777777) internal successors, (997), 9 states have internal predecessors, (997), 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) [2022-01-18 22:46:32,003 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:46:32,003 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 133 [2022-01-18 22:46:32,003 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:46:33,691 INFO L129 PetriNetUnfolder]: 7291/15223 cut-off events. [2022-01-18 22:46:33,691 INFO L130 PetriNetUnfolder]: For 26569/31459 co-relation queries the response was YES. [2022-01-18 22:46:33,773 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47786 conditions, 15223 events. 7291/15223 cut-off events. For 26569/31459 co-relation queries the response was YES. Maximal size of possible extension queue 1456. Compared 159346 event pairs, 261 based on Foata normal form. 494/14870 useless extension candidates. Maximal degree in co-relation 47758. Up to 1882 conditions per place. [2022-01-18 22:46:33,787 INFO L132 encePairwiseOnDemand]: 122/133 looper letters, 60 selfloop transitions, 45 changer transitions 54/256 dead transitions. [2022-01-18 22:46:33,787 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 256 transitions, 1502 flow [2022-01-18 22:46:33,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-18 22:46:33,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-01-18 22:46:33,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2196 transitions. [2022-01-18 22:46:33,803 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8690146418678275 [2022-01-18 22:46:33,803 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2196 transitions. [2022-01-18 22:46:33,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2196 transitions. [2022-01-18 22:46:33,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:46:33,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2196 transitions. [2022-01-18 22:46:33,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 115.57894736842105) internal successors, (2196), 19 states have internal predecessors, (2196), 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) [2022-01-18 22:46:33,810 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 133.0) internal successors, (2660), 20 states have internal predecessors, (2660), 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) [2022-01-18 22:46:33,811 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 133.0) internal successors, (2660), 20 states have internal predecessors, (2660), 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) [2022-01-18 22:46:33,811 INFO L186 Difference]: Start difference. First operand has 172 places, 174 transitions, 749 flow. Second operand 19 states and 2196 transitions. [2022-01-18 22:46:33,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 256 transitions, 1502 flow [2022-01-18 22:46:34,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 256 transitions, 1489 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-01-18 22:46:34,502 INFO L242 Difference]: Finished difference. Result has 190 places, 163 transitions, 792 flow [2022-01-18 22:46:34,502 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=792, PETRI_PLACES=190, PETRI_TRANSITIONS=163} [2022-01-18 22:46:34,503 INFO L334 CegarLoopForPetriNet]: 140 programPoint places, 50 predicate places. [2022-01-18 22:46:34,503 INFO L470 AbstractCegarLoop]: Abstraction has has 190 places, 163 transitions, 792 flow [2022-01-18 22:46:34,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 110.77777777777777) internal successors, (997), 9 states have internal predecessors, (997), 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) [2022-01-18 22:46:34,503 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:46:34,503 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:46:34,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-18 22:46:34,504 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-18 22:46:34,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:46:34,504 INFO L85 PathProgramCache]: Analyzing trace with hash -497940222, now seen corresponding path program 1 times [2022-01-18 22:46:34,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:46:34,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048996691] [2022-01-18 22:46:34,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:46:34,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:46:34,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:46:34,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:46:34,587 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:46:34,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048996691] [2022-01-18 22:46:34,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048996691] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:46:34,587 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:46:34,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-18 22:46:34,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606890519] [2022-01-18 22:46:34,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:46:34,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-18 22:46:34,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:46:34,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-18 22:46:34,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-18 22:46:34,588 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 133 [2022-01-18 22:46:34,589 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 163 transitions, 792 flow. Second operand has 7 states, 7 states have (on average 112.57142857142857) internal successors, (788), 7 states have internal predecessors, (788), 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) [2022-01-18 22:46:34,589 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:46:34,589 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 133 [2022-01-18 22:46:34,589 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:46:35,448 INFO L129 PetriNetUnfolder]: 2144/9515 cut-off events. [2022-01-18 22:46:35,448 INFO L130 PetriNetUnfolder]: For 19190/20082 co-relation queries the response was YES. [2022-01-18 22:46:35,483 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27725 conditions, 9515 events. 2144/9515 cut-off events. For 19190/20082 co-relation queries the response was YES. Maximal size of possible extension queue 1233. Compared 134626 event pairs, 28 based on Foata normal form. 2/8933 useless extension candidates. Maximal degree in co-relation 27637. Up to 1313 conditions per place. [2022-01-18 22:46:35,489 INFO L132 encePairwiseOnDemand]: 127/133 looper letters, 21 selfloop transitions, 1 changer transitions 16/180 dead transitions. [2022-01-18 22:46:35,489 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 180 transitions, 940 flow [2022-01-18 22:46:35,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-18 22:46:35,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-18 22:46:35,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 803 transitions. [2022-01-18 22:46:35,491 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8625134264232008 [2022-01-18 22:46:35,491 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 803 transitions. [2022-01-18 22:46:35,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 803 transitions. [2022-01-18 22:46:35,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:46:35,491 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 803 transitions. [2022-01-18 22:46:35,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-18 22:46:35,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 133.0) internal successors, (1064), 8 states have internal predecessors, (1064), 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) [2022-01-18 22:46:35,494 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 133.0) internal successors, (1064), 8 states have internal predecessors, (1064), 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) [2022-01-18 22:46:35,494 INFO L186 Difference]: Start difference. First operand has 190 places, 163 transitions, 792 flow. Second operand 7 states and 803 transitions. [2022-01-18 22:46:35,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 180 transitions, 940 flow [2022-01-18 22:46:35,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 180 transitions, 817 flow, removed 28 selfloop flow, removed 17 redundant places. [2022-01-18 22:46:35,967 INFO L242 Difference]: Finished difference. Result has 181 places, 162 transitions, 698 flow [2022-01-18 22:46:35,967 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=698, PETRI_PLACES=181, PETRI_TRANSITIONS=162} [2022-01-18 22:46:35,968 INFO L334 CegarLoopForPetriNet]: 140 programPoint places, 41 predicate places. [2022-01-18 22:46:35,968 INFO L470 AbstractCegarLoop]: Abstraction has has 181 places, 162 transitions, 698 flow [2022-01-18 22:46:35,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.57142857142857) internal successors, (788), 7 states have internal predecessors, (788), 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) [2022-01-18 22:46:35,968 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:46:35,968 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:46:35,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-18 22:46:35,968 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-18 22:46:35,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:46:35,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1225640178, now seen corresponding path program 2 times [2022-01-18 22:46:35,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:46:35,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581083557] [2022-01-18 22:46:35,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:46:35,969 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:46:35,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:46:36,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:46:36,085 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:46:36,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581083557] [2022-01-18 22:46:36,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581083557] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:46:36,085 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:46:36,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-18 22:46:36,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101938389] [2022-01-18 22:46:36,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:46:36,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-18 22:46:36,086 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:46:36,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-18 22:46:36,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-01-18 22:46:36,087 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 133 [2022-01-18 22:46:36,087 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 162 transitions, 698 flow. Second operand has 9 states, 9 states have (on average 109.33333333333333) internal successors, (984), 9 states have internal predecessors, (984), 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) [2022-01-18 22:46:36,087 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:46:36,087 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 133 [2022-01-18 22:46:36,087 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:46:36,619 INFO L129 PetriNetUnfolder]: 1466/6445 cut-off events. [2022-01-18 22:46:36,620 INFO L130 PetriNetUnfolder]: For 9027/9264 co-relation queries the response was YES. [2022-01-18 22:46:36,648 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16813 conditions, 6445 events. 1466/6445 cut-off events. For 9027/9264 co-relation queries the response was YES. Maximal size of possible extension queue 851. Compared 85920 event pairs, 16 based on Foata normal form. 1/6060 useless extension candidates. Maximal degree in co-relation 16783. Up to 851 conditions per place. [2022-01-18 22:46:36,654 INFO L132 encePairwiseOnDemand]: 124/133 looper letters, 18 selfloop transitions, 6 changer transitions 7/171 dead transitions. [2022-01-18 22:46:36,654 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 171 transitions, 796 flow [2022-01-18 22:46:36,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-18 22:46:36,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-18 22:46:36,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1099 transitions. [2022-01-18 22:46:36,656 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8263157894736842 [2022-01-18 22:46:36,656 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1099 transitions. [2022-01-18 22:46:36,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1099 transitions. [2022-01-18 22:46:36,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:46:36,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1099 transitions. [2022-01-18 22:46:36,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 109.9) internal successors, (1099), 10 states have internal predecessors, (1099), 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) [2022-01-18 22:46:36,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 133.0) internal successors, (1463), 11 states have internal predecessors, (1463), 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) [2022-01-18 22:46:36,660 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 133.0) internal successors, (1463), 11 states have internal predecessors, (1463), 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) [2022-01-18 22:46:36,660 INFO L186 Difference]: Start difference. First operand has 181 places, 162 transitions, 698 flow. Second operand 10 states and 1099 transitions. [2022-01-18 22:46:36,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 171 transitions, 796 flow [2022-01-18 22:46:36,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 171 transitions, 781 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-01-18 22:46:36,897 INFO L242 Difference]: Finished difference. Result has 186 places, 164 transitions, 725 flow [2022-01-18 22:46:36,897 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=725, PETRI_PLACES=186, PETRI_TRANSITIONS=164} [2022-01-18 22:46:36,898 INFO L334 CegarLoopForPetriNet]: 140 programPoint places, 46 predicate places. [2022-01-18 22:46:36,898 INFO L470 AbstractCegarLoop]: Abstraction has has 186 places, 164 transitions, 725 flow [2022-01-18 22:46:36,898 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 109.33333333333333) internal successors, (984), 9 states have internal predecessors, (984), 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) [2022-01-18 22:46:36,898 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:46:36,898 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:46:36,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-18 22:46:36,899 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-18 22:46:36,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:46:36,899 INFO L85 PathProgramCache]: Analyzing trace with hash -310102538, now seen corresponding path program 3 times [2022-01-18 22:46:36,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:46:36,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299408064] [2022-01-18 22:46:36,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:46:36,899 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:46:36,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-18 22:46:36,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-18 22:46:36,978 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-18 22:46:36,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299408064] [2022-01-18 22:46:36,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299408064] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-18 22:46:36,978 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-18 22:46:36,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-18 22:46:36,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965256681] [2022-01-18 22:46:36,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-18 22:46:36,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-18 22:46:36,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-18 22:46:36,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-18 22:46:36,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-18 22:46:36,981 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 133 [2022-01-18 22:46:36,981 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 164 transitions, 725 flow. Second operand has 6 states, 6 states have (on average 113.83333333333333) internal successors, (683), 6 states have internal predecessors, (683), 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) [2022-01-18 22:46:36,981 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-18 22:46:36,981 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 133 [2022-01-18 22:46:36,981 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-18 22:46:37,729 INFO L129 PetriNetUnfolder]: 2307/10291 cut-off events. [2022-01-18 22:46:37,730 INFO L130 PetriNetUnfolder]: For 14451/14675 co-relation queries the response was YES. [2022-01-18 22:46:37,785 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26966 conditions, 10291 events. 2307/10291 cut-off events. For 14451/14675 co-relation queries the response was YES. Maximal size of possible extension queue 1338. Compared 148719 event pairs, 32 based on Foata normal form. 2/9723 useless extension candidates. Maximal degree in co-relation 26935. Up to 1372 conditions per place. [2022-01-18 22:46:37,793 INFO L132 encePairwiseOnDemand]: 127/133 looper letters, 20 selfloop transitions, 3 changer transitions 15/178 dead transitions. [2022-01-18 22:46:37,793 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 178 transitions, 862 flow [2022-01-18 22:46:37,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-18 22:46:37,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-18 22:46:37,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 695 transitions. [2022-01-18 22:46:37,795 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8709273182957393 [2022-01-18 22:46:37,795 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 695 transitions. [2022-01-18 22:46:37,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 695 transitions. [2022-01-18 22:46:37,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-18 22:46:37,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 695 transitions. [2022-01-18 22:46:37,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 115.83333333333333) internal successors, (695), 6 states have internal predecessors, (695), 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) [2022-01-18 22:46:37,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 133.0) internal successors, (931), 7 states have internal predecessors, (931), 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) [2022-01-18 22:46:37,797 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 133.0) internal successors, (931), 7 states have internal predecessors, (931), 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) [2022-01-18 22:46:37,797 INFO L186 Difference]: Start difference. First operand has 186 places, 164 transitions, 725 flow. Second operand 6 states and 695 transitions. [2022-01-18 22:46:37,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 178 transitions, 862 flow [2022-01-18 22:46:38,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 178 transitions, 838 flow, removed 7 selfloop flow, removed 7 redundant places. [2022-01-18 22:46:38,391 INFO L242 Difference]: Finished difference. Result has 184 places, 162 transitions, 714 flow [2022-01-18 22:46:38,391 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=711, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=714, PETRI_PLACES=184, PETRI_TRANSITIONS=162} [2022-01-18 22:46:38,391 INFO L334 CegarLoopForPetriNet]: 140 programPoint places, 44 predicate places. [2022-01-18 22:46:38,391 INFO L470 AbstractCegarLoop]: Abstraction has has 184 places, 162 transitions, 714 flow [2022-01-18 22:46:38,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.83333333333333) internal successors, (683), 6 states have internal predecessors, (683), 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) [2022-01-18 22:46:38,392 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-18 22:46:38,392 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-18 22:46:38,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-18 22:46:38,392 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-18 22:46:38,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-18 22:46:38,392 INFO L85 PathProgramCache]: Analyzing trace with hash 677237920, now seen corresponding path program 4 times [2022-01-18 22:46:38,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-18 22:46:38,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940099032] [2022-01-18 22:46:38,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-18 22:46:38,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-18 22:46:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-18 22:46:38,422 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-18 22:46:38,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-18 22:46:38,469 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-18 22:46:38,469 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-18 22:46:38,470 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-01-18 22:46:38,471 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-01-18 22:46:38,471 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2022-01-18 22:46:38,471 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2022-01-18 22:46:38,471 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2022-01-18 22:46:38,471 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2022-01-18 22:46:38,471 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-01-18 22:46:38,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-18 22:46:38,474 INFO L732 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1] [2022-01-18 22:46:38,477 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-18 22:46:38,477 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-18 22:46:38,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.01 10:46:38 BasicIcfg [2022-01-18 22:46:38,590 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-18 22:46:38,590 INFO L158 Benchmark]: Toolchain (without parser) took 16728.50ms. Allocated memory was 436.2MB in the beginning and 2.4GB in the end (delta: 2.0GB). Free memory was 381.7MB in the beginning and 684.0MB in the end (delta: -302.3MB). Peak memory consumption was 1.7GB. Max. memory is 16.0GB. [2022-01-18 22:46:38,590 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 436.2MB. Free memory is still 400.5MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-18 22:46:38,591 INFO L158 Benchmark]: CACSL2BoogieTranslator took 432.94ms. Allocated memory is still 436.2MB. Free memory was 381.4MB in the beginning and 396.9MB in the end (delta: -15.4MB). Peak memory consumption was 19.7MB. Max. memory is 16.0GB. [2022-01-18 22:46:38,591 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.72ms. Allocated memory is still 436.2MB. Free memory was 396.9MB in the beginning and 394.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-18 22:46:38,594 INFO L158 Benchmark]: Boogie Preprocessor took 20.35ms. Allocated memory is still 436.2MB. Free memory was 394.8MB in the beginning and 392.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-18 22:46:38,595 INFO L158 Benchmark]: RCFGBuilder took 696.46ms. Allocated memory is still 436.2MB. Free memory was 392.7MB in the beginning and 325.5MB in the end (delta: 67.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.0GB. [2022-01-18 22:46:38,596 INFO L158 Benchmark]: TraceAbstraction took 15541.34ms. Allocated memory was 436.2MB in the beginning and 2.4GB in the end (delta: 2.0GB). Free memory was 325.5MB in the beginning and 684.0MB in the end (delta: -358.4MB). Peak memory consumption was 1.6GB. Max. memory is 16.0GB. [2022-01-18 22:46:38,597 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 436.2MB. Free memory is still 400.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 432.94ms. Allocated memory is still 436.2MB. Free memory was 381.4MB in the beginning and 396.9MB in the end (delta: -15.4MB). Peak memory consumption was 19.7MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 32.72ms. Allocated memory is still 436.2MB. Free memory was 396.9MB in the beginning and 394.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 20.35ms. Allocated memory is still 436.2MB. Free memory was 394.8MB in the beginning and 392.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 696.46ms. Allocated memory is still 436.2MB. Free memory was 392.7MB in the beginning and 325.5MB in the end (delta: 67.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.0GB. * TraceAbstraction took 15541.34ms. Allocated memory was 436.2MB in the beginning and 2.4GB in the end (delta: 2.0GB). Free memory was 325.5MB in the beginning and 684.0MB in the end (delta: -358.4MB). Peak memory consumption was 1.6GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L716] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L718] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0] [L719] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0] [L720] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L722] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L724] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L726] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L727] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L728] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L729] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L730] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L731] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L732] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=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] [L733] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=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] [L734] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=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] [L735] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=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] [L736] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=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] [L737] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=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] [L738] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=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] [L739] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=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] [L740] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=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}] [L741] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=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] [L742] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=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] [L743] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=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] [L744] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=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] [L745] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=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] [L746] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=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] [L846] 0 pthread_t t1365; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1365={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=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] [L847] FCALL, FORK 0 pthread_create(&t1365, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1365, ((void *)0), P0, ((void *)0))=-3, t1365={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=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] [L848] 0 pthread_t t1366; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1365={5:0}, t1366={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=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] [L849] FCALL, FORK 0 pthread_create(&t1366, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1366, ((void *)0), P1, ((void *)0))=-2, t1365={5:0}, t1366={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=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] [L850] 0 pthread_t t1367; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1365={5:0}, t1366={6:0}, t1367={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=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] [L851] FCALL, FORK 0 pthread_create(&t1367, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1367, ((void *)0), P2, ((void *)0))=-1, t1365={5:0}, t1366={6:0}, t1367={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=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] [L852] 0 pthread_t t1368; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1365={5:0}, t1366={6:0}, t1367={7:0}, t1368={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=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] [L853] FCALL, FORK 0 pthread_create(&t1368, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1368, ((void *)0), P3, ((void *)0))=0, t1365={5:0}, t1366={6:0}, t1367={7:0}, t1368={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=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] [L808] 4 z$w_buff1 = z$w_buff0 [L809] 4 z$w_buff0 = 1 [L810] 4 z$w_buff1_used = z$w_buff0_used [L811] 4 z$w_buff0_used = (_Bool)1 [L812] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L812] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L813] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L814] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L815] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L816] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L817] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L818] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=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] [L821] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=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] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=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] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=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] [L765] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=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] [L768] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=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] [L780] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=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] [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z [L787] EXPR 3 !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) [L787] 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) [L788] EXPR 3 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)) [L788] EXPR 3 !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) [L788] EXPR 3 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)) [L788] 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)) [L789] EXPR 3 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)) [L789] EXPR 3 !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) [L789] EXPR 3 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)) [L789] 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)) [L790] EXPR 3 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)) [L790] EXPR 3 !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) [L790] EXPR 3 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)) [L790] 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)) [L791] EXPR 3 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)) [L791] EXPR 3 !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) [L791] EXPR 3 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)) [L791] 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)) [L792] EXPR 3 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)) [L792] EXPR 3 !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) [L792] EXPR 3 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)) [L792] 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)) [L793] EXPR 3 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)) [L793] EXPR 3 !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) [L793] EXPR 3 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)) [L793] 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)) [L794] 3 __unbuffered_p2_EAX = z [L795] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L795] 3 z = z$flush_delayed ? z$mem_tmp : z [L796] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=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] [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L824] 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) [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L826] 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 [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L828] 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 [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=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] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=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] [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=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] [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=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] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1365={5:0}, t1366={6:0}, t1367={7:0}, t1368={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=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] [L857] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=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] [L857] RET 0 assume_abort_if_not(main$tmp_guard0) [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] 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) [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L861] 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 [L862] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L863] 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 [L866] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1365={5:0}, t1366={6:0}, t1367={7:0}, t1368={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=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] [L868] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=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] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=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] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 166 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: 15.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 13.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 566 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 566 mSDsluCounter, 403 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 815 mSDsCounter, 168 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1153 IncrementalHoareTripleChecker+Invalid, 1321 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 168 mSolverCounterUnsat, 85 mSDtfsCounter, 1153 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1013occurred in iteration=5, InterpolantAutomatonStates: 100, 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.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1026 NumberOfCodeBlocks, 1026 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 914 ConstructedInterpolants, 0 QuantifiedInterpolants, 3261 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! [2022-01-18 22:46:38,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...