/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-After.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix040_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 11:12:46,034 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 11:12:46,036 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 11:12:46,094 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 11:12:46,094 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 11:12:46,095 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 11:12:46,096 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 11:12:46,097 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 11:12:46,098 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 11:12:46,098 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 11:12:46,110 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 11:12:46,113 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 11:12:46,113 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 11:12:46,116 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 11:12:46,117 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 11:12:46,119 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 11:12:46,119 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 11:12:46,120 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 11:12:46,123 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 11:12:46,127 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 11:12:46,128 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 11:12:46,129 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 11:12:46,130 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 11:12:46,130 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 11:12:46,140 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 11:12:46,140 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 11:12:46,140 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 11:12:46,141 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 11:12:46,141 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 11:12:46,142 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 11:12:46,142 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 11:12:46,142 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 11:12:46,144 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 11:12:46,144 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 11:12:46,145 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 11:12:46,145 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 11:12:46,145 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 11:12:46,145 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 11:12:46,145 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 11:12:46,146 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 11:12:46,146 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 11:12:46,147 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-After.epf [2022-01-19 11:12:46,169 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 11:12:46,169 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 11:12:46,170 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 11:12:46,170 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 11:12:46,170 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 11:12:46,170 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 11:12:46,170 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 11:12:46,170 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 11:12:46,170 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 11:12:46,171 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 11:12:46,171 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 11:12:46,171 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 11:12:46,171 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 11:12:46,171 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 11:12:46,171 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 11:12:46,172 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 11:12:46,172 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 11:12:46,172 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 11:12:46,172 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 11:12:46,172 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 11:12:46,172 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 11:12:46,172 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 11:12:46,172 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 11:12:46,172 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 11:12:46,172 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 11:12:46,172 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 11:12:46,172 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 11:12:46,174 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 11:12:46,174 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 11:12:46,174 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 11:12:46,174 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 11:12:46,174 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=AFTER [2022-01-19 11:12:46,174 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-19 11:12:46,342 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 11:12:46,356 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 11:12:46,358 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 11:12:46,358 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 11:12:46,359 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 11:12:46,360 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix040_tso.oepc.i [2022-01-19 11:12:46,412 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/369a65658/3648237ebbda4688b350af59be0cabc9/FLAG6109c41c5 [2022-01-19 11:12:46,807 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 11:12:46,808 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix040_tso.oepc.i [2022-01-19 11:12:46,823 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/369a65658/3648237ebbda4688b350af59be0cabc9/FLAG6109c41c5 [2022-01-19 11:12:46,838 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/369a65658/3648237ebbda4688b350af59be0cabc9 [2022-01-19 11:12:46,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 11:12:46,841 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 11:12:46,845 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 11:12:46,845 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 11:12:46,847 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 11:12:46,847 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 11:12:46" (1/1) ... [2022-01-19 11:12:46,848 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a78db5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:12:46, skipping insertion in model container [2022-01-19 11:12:46,848 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 11:12:46" (1/1) ... [2022-01-19 11:12:46,853 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 11:12:46,898 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 11:12:47,013 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/mix040_tso.oepc.i[949,962] [2022-01-19 11:12:47,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 11:12:47,115 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 11:12:47,123 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/mix040_tso.oepc.i[949,962] [2022-01-19 11:12:47,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 11:12:47,173 INFO L208 MainTranslator]: Completed translation [2022-01-19 11:12:47,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:12:47 WrapperNode [2022-01-19 11:12:47,173 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 11:12:47,174 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 11:12:47,174 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 11:12:47,174 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 11:12:47,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:12:47" (1/1) ... [2022-01-19 11:12:47,189 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:12:47" (1/1) ... [2022-01-19 11:12:47,229 INFO L137 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 292 [2022-01-19 11:12:47,229 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 11:12:47,230 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 11:12:47,230 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 11:12:47,230 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 11:12:47,235 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:12:47" (1/1) ... [2022-01-19 11:12:47,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:12:47" (1/1) ... [2022-01-19 11:12:47,247 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:12:47" (1/1) ... [2022-01-19 11:12:47,248 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:12:47" (1/1) ... [2022-01-19 11:12:47,263 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:12:47" (1/1) ... [2022-01-19 11:12:47,265 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:12:47" (1/1) ... [2022-01-19 11:12:47,267 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:12:47" (1/1) ... [2022-01-19 11:12:47,269 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 11:12:47,269 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 11:12:47,269 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 11:12:47,270 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 11:12:47,270 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:12:47" (1/1) ... [2022-01-19 11:12:47,287 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 11:12:47,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 11:12:47,303 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-19 11:12:47,305 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-19 11:12:47,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 11:12:47,326 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 11:12:47,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 11:12:47,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 11:12:47,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 11:12:47,326 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-01-19 11:12:47,326 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-01-19 11:12:47,326 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-01-19 11:12:47,327 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-01-19 11:12:47,327 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-01-19 11:12:47,327 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-01-19 11:12:47,327 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-01-19 11:12:47,327 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-01-19 11:12:47,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 11:12:47,327 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 11:12:47,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 11:12:47,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 11:12:47,328 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 11:12:47,478 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 11:12:47,479 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 11:12:47,861 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 11:12:48,090 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 11:12:48,090 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-19 11:12:48,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 11:12:48 BoogieIcfgContainer [2022-01-19 11:12:48,093 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 11:12:48,094 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 11:12:48,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 11:12:48,096 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 11:12:48,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 11:12:46" (1/3) ... [2022-01-19 11:12:48,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc95abd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 11:12:48, skipping insertion in model container [2022-01-19 11:12:48,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 11:12:47" (2/3) ... [2022-01-19 11:12:48,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc95abd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 11:12:48, skipping insertion in model container [2022-01-19 11:12:48,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 11:12:48" (3/3) ... [2022-01-19 11:12:48,098 INFO L111 eAbstractionObserver]: Analyzing ICFG mix040_tso.oepc.i [2022-01-19 11:12:48,102 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 11:12:48,102 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-01-19 11:12:48,102 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 11:12:48,146 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,146 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,146 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,146 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,146 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,146 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,146 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,147 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,148 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,148 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,148 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,148 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,149 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,149 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,149 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,149 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,149 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,149 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,149 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,149 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,150 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,150 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,150 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,150 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,150 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,150 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,151 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,151 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,151 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,151 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,152 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,152 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,152 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,152 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,152 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,153 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,153 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,153 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,153 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,153 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,153 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,154 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,154 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,154 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,154 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,154 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,154 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,154 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,155 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,155 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,155 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,155 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,156 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,156 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,156 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,156 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,156 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,156 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,156 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,156 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,156 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,157 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,157 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,157 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,157 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,157 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,157 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,157 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,158 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,158 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,159 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,159 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,159 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,159 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,159 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,159 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,159 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,159 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,159 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,160 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,160 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,160 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,160 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,161 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,161 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,161 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,161 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,162 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,163 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,164 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,169 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,169 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,169 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,169 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,170 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,170 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,170 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,170 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,173 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,173 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,173 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,173 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,173 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,173 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,173 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,174 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,174 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,174 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,174 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,174 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,175 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,175 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,175 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,175 WARN L322 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,175 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,175 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,176 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,176 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,176 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,176 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,176 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,176 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,176 WARN L322 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,176 WARN L322 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,177 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,177 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,177 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,177 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,177 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,177 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,177 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,177 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,177 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,178 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 11:12:48,178 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-19 11:12:48,211 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 11:12:48,215 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-19 11:12:48,216 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-01-19 11:12:48,223 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 149 places, 138 transitions, 296 flow [2022-01-19 11:12:48,261 INFO L129 PetriNetUnfolder]: 2/134 cut-off events. [2022-01-19 11:12:48,262 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 11:12:48,265 INFO L84 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 134 events. 2/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 72 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 92. Up to 2 conditions per place. [2022-01-19 11:12:48,265 INFO L82 GeneralOperation]: Start removeDead. Operand has 149 places, 138 transitions, 296 flow [2022-01-19 11:12:48,270 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 134 transitions, 280 flow [2022-01-19 11:12:48,282 INFO L129 PetriNetUnfolder]: 0/78 cut-off events. [2022-01-19 11:12:48,282 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 11:12:48,282 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:12:48,285 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] [2022-01-19 11:12:48,285 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:12:48,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:12:48,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1812777549, now seen corresponding path program 1 times [2022-01-19 11:12:48,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:12:48,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23582819] [2022-01-19 11:12:48,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:12:48,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:12:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:12:48,575 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-19 11:12:48,575 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:12:48,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23582819] [2022-01-19 11:12:48,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23582819] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:12:48,576 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:12:48,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 11:12:48,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073967266] [2022-01-19 11:12:48,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:12:48,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 11:12:48,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:12:48,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 11:12:48,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 11:12:48,608 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 138 [2022-01-19 11:12:48,614 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 134 transitions, 280 flow. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 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-19 11:12:48,614 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:12:48,614 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 138 [2022-01-19 11:12:48,615 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:12:48,751 INFO L129 PetriNetUnfolder]: 57/352 cut-off events. [2022-01-19 11:12:48,751 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-01-19 11:12:48,754 INFO L84 FinitePrefix]: Finished finitePrefix Result has 481 conditions, 352 events. 57/352 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1398 event pairs, 11 based on Foata normal form. 14/349 useless extension candidates. Maximal degree in co-relation 423. Up to 75 conditions per place. [2022-01-19 11:12:48,757 INFO L132 encePairwiseOnDemand]: 133/138 looper letters, 14 selfloop transitions, 2 changer transitions 0/135 dead transitions. [2022-01-19 11:12:48,758 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 135 transitions, 317 flow [2022-01-19 11:12:48,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 11:12:48,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 11:12:48,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions. [2022-01-19 11:12:48,772 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9420289855072463 [2022-01-19 11:12:48,773 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 390 transitions. [2022-01-19 11:12:48,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 390 transitions. [2022-01-19 11:12:48,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:12:48,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 390 transitions. [2022-01-19 11:12:48,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 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-19 11:12:48,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 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-19 11:12:48,787 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 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-19 11:12:48,789 INFO L186 Difference]: Start difference. First operand has 145 places, 134 transitions, 280 flow. Second operand 3 states and 390 transitions. [2022-01-19 11:12:48,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 135 transitions, 317 flow [2022-01-19 11:12:48,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 135 transitions, 312 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-01-19 11:12:48,797 INFO L242 Difference]: Finished difference. Result has 141 places, 130 transitions, 272 flow [2022-01-19 11:12:48,799 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=272, PETRI_PLACES=141, PETRI_TRANSITIONS=130} [2022-01-19 11:12:48,801 INFO L334 CegarLoopForPetriNet]: 145 programPoint places, -4 predicate places. [2022-01-19 11:12:48,802 INFO L470 AbstractCegarLoop]: Abstraction has has 141 places, 130 transitions, 272 flow [2022-01-19 11:12:48,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 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-19 11:12:48,802 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:12:48,802 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] [2022-01-19 11:12:48,802 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 11:12:48,802 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:12:48,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:12:48,803 INFO L85 PathProgramCache]: Analyzing trace with hash 706789698, now seen corresponding path program 1 times [2022-01-19 11:12:48,803 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:12:48,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453287407] [2022-01-19 11:12:48,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:12:48,803 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:12:48,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:12:49,035 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-19 11:12:49,035 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:12:49,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453287407] [2022-01-19 11:12:49,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453287407] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:12:49,036 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:12:49,036 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 11:12:49,036 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767326503] [2022-01-19 11:12:49,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:12:49,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 11:12:49,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:12:49,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 11:12:49,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 11:12:49,045 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 138 [2022-01-19 11:12:49,046 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 130 transitions, 272 flow. Second operand has 6 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 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-19 11:12:49,046 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:12:49,046 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 138 [2022-01-19 11:12:49,047 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:12:49,435 INFO L129 PetriNetUnfolder]: 330/1149 cut-off events. [2022-01-19 11:12:49,435 INFO L130 PetriNetUnfolder]: For 68/68 co-relation queries the response was YES. [2022-01-19 11:12:49,441 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1780 conditions, 1149 events. 330/1149 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 7750 event pairs, 59 based on Foata normal form. 0/1120 useless extension candidates. Maximal degree in co-relation 1723. Up to 257 conditions per place. [2022-01-19 11:12:49,444 INFO L132 encePairwiseOnDemand]: 132/138 looper letters, 19 selfloop transitions, 2 changer transitions 47/167 dead transitions. [2022-01-19 11:12:49,444 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 167 transitions, 470 flow [2022-01-19 11:12:49,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 11:12:49,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 11:12:49,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1101 transitions. [2022-01-19 11:12:49,447 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8864734299516909 [2022-01-19 11:12:49,447 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1101 transitions. [2022-01-19 11:12:49,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1101 transitions. [2022-01-19 11:12:49,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:12:49,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1101 transitions. [2022-01-19 11:12:49,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 122.33333333333333) internal successors, (1101), 9 states have internal predecessors, (1101), 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-19 11:12:49,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 138.0) internal successors, (1380), 10 states have internal predecessors, (1380), 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-19 11:12:49,452 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 138.0) internal successors, (1380), 10 states have internal predecessors, (1380), 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-19 11:12:49,452 INFO L186 Difference]: Start difference. First operand has 141 places, 130 transitions, 272 flow. Second operand 9 states and 1101 transitions. [2022-01-19 11:12:49,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 167 transitions, 470 flow [2022-01-19 11:12:49,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 167 transitions, 452 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 11:12:49,457 INFO L242 Difference]: Finished difference. Result has 154 places, 116 transitions, 260 flow [2022-01-19 11:12:49,457 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=260, PETRI_PLACES=154, PETRI_TRANSITIONS=116} [2022-01-19 11:12:49,458 INFO L334 CegarLoopForPetriNet]: 145 programPoint places, 9 predicate places. [2022-01-19 11:12:49,458 INFO L470 AbstractCegarLoop]: Abstraction has has 154 places, 116 transitions, 260 flow [2022-01-19 11:12:49,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 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-19 11:12:49,458 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:12:49,458 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] [2022-01-19 11:12:49,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 11:12:49,459 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:12:49,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:12:49,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1725402564, now seen corresponding path program 1 times [2022-01-19 11:12:49,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:12:49,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783538111] [2022-01-19 11:12:49,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:12:49,460 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:12:49,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:12:49,609 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-19 11:12:49,609 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:12:49,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783538111] [2022-01-19 11:12:49,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783538111] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:12:49,610 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:12:49,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 11:12:49,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884231885] [2022-01-19 11:12:49,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:12:49,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 11:12:49,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:12:49,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 11:12:49,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 11:12:49,611 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 138 [2022-01-19 11:12:49,612 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 116 transitions, 260 flow. Second operand has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 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-19 11:12:49,612 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:12:49,612 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 138 [2022-01-19 11:12:49,612 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:12:49,942 INFO L129 PetriNetUnfolder]: 805/1620 cut-off events. [2022-01-19 11:12:49,942 INFO L130 PetriNetUnfolder]: For 366/366 co-relation queries the response was YES. [2022-01-19 11:12:49,949 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3246 conditions, 1620 events. 805/1620 cut-off events. For 366/366 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9887 event pairs, 101 based on Foata normal form. 36/1617 useless extension candidates. Maximal degree in co-relation 3182. Up to 721 conditions per place. [2022-01-19 11:12:49,955 INFO L132 encePairwiseOnDemand]: 131/138 looper letters, 24 selfloop transitions, 3 changer transitions 40/165 dead transitions. [2022-01-19 11:12:49,955 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 165 transitions, 516 flow [2022-01-19 11:12:49,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 11:12:49,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 11:12:49,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1104 transitions. [2022-01-19 11:12:49,958 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2022-01-19 11:12:49,958 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1104 transitions. [2022-01-19 11:12:49,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1104 transitions. [2022-01-19 11:12:49,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:12:49,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1104 transitions. [2022-01-19 11:12:49,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 122.66666666666667) internal successors, (1104), 9 states have internal predecessors, (1104), 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-19 11:12:49,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 138.0) internal successors, (1380), 10 states have internal predecessors, (1380), 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-19 11:12:49,962 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 138.0) internal successors, (1380), 10 states have internal predecessors, (1380), 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-19 11:12:49,962 INFO L186 Difference]: Start difference. First operand has 154 places, 116 transitions, 260 flow. Second operand 9 states and 1104 transitions. [2022-01-19 11:12:49,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 165 transitions, 516 flow [2022-01-19 11:12:49,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 165 transitions, 484 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-01-19 11:12:49,975 INFO L242 Difference]: Finished difference. Result has 141 places, 118 transitions, 287 flow [2022-01-19 11:12:49,976 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=287, PETRI_PLACES=141, PETRI_TRANSITIONS=118} [2022-01-19 11:12:49,977 INFO L334 CegarLoopForPetriNet]: 145 programPoint places, -4 predicate places. [2022-01-19 11:12:49,977 INFO L470 AbstractCegarLoop]: Abstraction has has 141 places, 118 transitions, 287 flow [2022-01-19 11:12:49,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 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-19 11:12:49,978 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:12:49,978 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] [2022-01-19 11:12:49,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 11:12:49,978 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:12:49,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:12:49,979 INFO L85 PathProgramCache]: Analyzing trace with hash -556446721, now seen corresponding path program 1 times [2022-01-19 11:12:49,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:12:49,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008523586] [2022-01-19 11:12:49,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:12:49,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:12:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:12:50,184 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-19 11:12:50,185 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:12:50,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008523586] [2022-01-19 11:12:50,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008523586] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:12:50,185 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:12:50,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 11:12:50,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135518605] [2022-01-19 11:12:50,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:12:50,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 11:12:50,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:12:50,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 11:12:50,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-01-19 11:12:50,190 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 138 [2022-01-19 11:12:50,192 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 118 transitions, 287 flow. Second operand has 10 states, 10 states have (on average 114.5) internal successors, (1145), 10 states have internal predecessors, (1145), 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-19 11:12:50,192 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:12:50,192 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 138 [2022-01-19 11:12:50,192 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:12:50,621 INFO L129 PetriNetUnfolder]: 753/1587 cut-off events. [2022-01-19 11:12:50,621 INFO L130 PetriNetUnfolder]: For 1347/1357 co-relation queries the response was YES. [2022-01-19 11:12:50,626 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3693 conditions, 1587 events. 753/1587 cut-off events. For 1347/1357 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 10049 event pairs, 294 based on Foata normal form. 42/1564 useless extension candidates. Maximal degree in co-relation 3625. Up to 637 conditions per place. [2022-01-19 11:12:50,631 INFO L132 encePairwiseOnDemand]: 126/138 looper letters, 21 selfloop transitions, 10 changer transitions 44/173 dead transitions. [2022-01-19 11:12:50,631 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 173 transitions, 585 flow [2022-01-19 11:12:50,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-19 11:12:50,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-01-19 11:12:50,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1773 transitions. [2022-01-19 11:12:50,634 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8565217391304348 [2022-01-19 11:12:50,635 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1773 transitions. [2022-01-19 11:12:50,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1773 transitions. [2022-01-19 11:12:50,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:12:50,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1773 transitions. [2022-01-19 11:12:50,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 118.2) internal successors, (1773), 15 states have internal predecessors, (1773), 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-19 11:12:50,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 138.0) internal successors, (2208), 16 states have internal predecessors, (2208), 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-19 11:12:50,640 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 138.0) internal successors, (2208), 16 states have internal predecessors, (2208), 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-19 11:12:50,641 INFO L186 Difference]: Start difference. First operand has 141 places, 118 transitions, 287 flow. Second operand 15 states and 1773 transitions. [2022-01-19 11:12:50,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 173 transitions, 585 flow [2022-01-19 11:12:50,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 173 transitions, 564 flow, removed 9 selfloop flow, removed 4 redundant places. [2022-01-19 11:12:50,645 INFO L242 Difference]: Finished difference. Result has 156 places, 124 transitions, 362 flow [2022-01-19 11:12:50,645 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=362, PETRI_PLACES=156, PETRI_TRANSITIONS=124} [2022-01-19 11:12:50,646 INFO L334 CegarLoopForPetriNet]: 145 programPoint places, 11 predicate places. [2022-01-19 11:12:50,646 INFO L470 AbstractCegarLoop]: Abstraction has has 156 places, 124 transitions, 362 flow [2022-01-19 11:12:50,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 114.5) internal successors, (1145), 10 states have internal predecessors, (1145), 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-19 11:12:50,646 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:12:50,646 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-19 11:12:50,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 11:12:50,647 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:12:50,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:12:50,647 INFO L85 PathProgramCache]: Analyzing trace with hash 175617836, now seen corresponding path program 1 times [2022-01-19 11:12:50,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:12:50,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017854660] [2022-01-19 11:12:50,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:12:50,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:12:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:12:50,747 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-19 11:12:50,748 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:12:50,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017854660] [2022-01-19 11:12:50,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017854660] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:12:50,748 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:12:50,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 11:12:50,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722312174] [2022-01-19 11:12:50,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:12:50,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 11:12:50,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:12:50,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 11:12:50,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 11:12:50,749 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 138 [2022-01-19 11:12:50,750 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 124 transitions, 362 flow. Second operand has 7 states, 7 states have (on average 117.0) internal successors, (819), 7 states have internal predecessors, (819), 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-19 11:12:50,750 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:12:50,750 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 138 [2022-01-19 11:12:50,750 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:12:51,120 INFO L129 PetriNetUnfolder]: 663/1494 cut-off events. [2022-01-19 11:12:51,121 INFO L130 PetriNetUnfolder]: For 4377/4399 co-relation queries the response was YES. [2022-01-19 11:12:51,128 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4905 conditions, 1494 events. 663/1494 cut-off events. For 4377/4399 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 9416 event pairs, 112 based on Foata normal form. 30/1474 useless extension candidates. Maximal degree in co-relation 4826. Up to 504 conditions per place. [2022-01-19 11:12:51,134 INFO L132 encePairwiseOnDemand]: 128/138 looper letters, 35 selfloop transitions, 9 changer transitions 37/181 dead transitions. [2022-01-19 11:12:51,134 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 181 transitions, 860 flow [2022-01-19 11:12:51,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 11:12:51,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 11:12:51,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1573 transitions. [2022-01-19 11:12:51,137 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8768115942028986 [2022-01-19 11:12:51,137 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1573 transitions. [2022-01-19 11:12:51,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1573 transitions. [2022-01-19 11:12:51,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:12:51,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1573 transitions. [2022-01-19 11:12:51,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 121.0) internal successors, (1573), 13 states have internal predecessors, (1573), 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-19 11:12:51,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 138.0) internal successors, (1932), 14 states have internal predecessors, (1932), 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-19 11:12:51,142 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 138.0) internal successors, (1932), 14 states have internal predecessors, (1932), 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-19 11:12:51,142 INFO L186 Difference]: Start difference. First operand has 156 places, 124 transitions, 362 flow. Second operand 13 states and 1573 transitions. [2022-01-19 11:12:51,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 181 transitions, 860 flow [2022-01-19 11:12:51,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 181 transitions, 826 flow, removed 15 selfloop flow, removed 5 redundant places. [2022-01-19 11:12:51,148 INFO L242 Difference]: Finished difference. Result has 165 places, 129 transitions, 446 flow [2022-01-19 11:12:51,149 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=446, PETRI_PLACES=165, PETRI_TRANSITIONS=129} [2022-01-19 11:12:51,149 INFO L334 CegarLoopForPetriNet]: 145 programPoint places, 20 predicate places. [2022-01-19 11:12:51,149 INFO L470 AbstractCegarLoop]: Abstraction has has 165 places, 129 transitions, 446 flow [2022-01-19 11:12:51,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.0) internal successors, (819), 7 states have internal predecessors, (819), 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-19 11:12:51,150 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:12:51,150 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-19 11:12:51,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 11:12:51,150 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:12:51,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:12:51,150 INFO L85 PathProgramCache]: Analyzing trace with hash 729604984, now seen corresponding path program 2 times [2022-01-19 11:12:51,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:12:51,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480581281] [2022-01-19 11:12:51,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:12:51,151 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:12:51,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:12:51,335 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-19 11:12:51,335 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:12:51,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480581281] [2022-01-19 11:12:51,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480581281] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:12:51,335 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:12:51,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 11:12:51,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511916087] [2022-01-19 11:12:51,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:12:51,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 11:12:51,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:12:51,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 11:12:51,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-19 11:12:51,337 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 138 [2022-01-19 11:12:51,338 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 129 transitions, 446 flow. Second operand has 12 states, 12 states have (on average 112.5) internal successors, (1350), 12 states have internal predecessors, (1350), 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-19 11:12:51,338 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:12:51,338 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 138 [2022-01-19 11:12:51,338 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:12:51,731 INFO L129 PetriNetUnfolder]: 581/1298 cut-off events. [2022-01-19 11:12:51,731 INFO L130 PetriNetUnfolder]: For 8096/8356 co-relation queries the response was YES. [2022-01-19 11:12:51,738 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5961 conditions, 1298 events. 581/1298 cut-off events. For 8096/8356 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7872 event pairs, 92 based on Foata normal form. 33/1282 useless extension candidates. Maximal degree in co-relation 5870. Up to 472 conditions per place. [2022-01-19 11:12:51,745 INFO L132 encePairwiseOnDemand]: 127/138 looper letters, 39 selfloop transitions, 11 changer transitions 25/171 dead transitions. [2022-01-19 11:12:51,745 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 171 transitions, 1024 flow [2022-01-19 11:12:51,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 11:12:51,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 11:12:51,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1622 transitions. [2022-01-19 11:12:51,750 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.839544513457557 [2022-01-19 11:12:51,750 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1622 transitions. [2022-01-19 11:12:51,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1622 transitions. [2022-01-19 11:12:51,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:12:51,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1622 transitions. [2022-01-19 11:12:51,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 115.85714285714286) internal successors, (1622), 14 states have internal predecessors, (1622), 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-19 11:12:51,756 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 138.0) internal successors, (2070), 15 states have internal predecessors, (2070), 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-19 11:12:51,756 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 138.0) internal successors, (2070), 15 states have internal predecessors, (2070), 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-19 11:12:51,756 INFO L186 Difference]: Start difference. First operand has 165 places, 129 transitions, 446 flow. Second operand 14 states and 1622 transitions. [2022-01-19 11:12:51,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 171 transitions, 1024 flow [2022-01-19 11:12:51,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 171 transitions, 960 flow, removed 28 selfloop flow, removed 7 redundant places. [2022-01-19 11:12:51,769 INFO L242 Difference]: Finished difference. Result has 169 places, 130 transitions, 478 flow [2022-01-19 11:12:51,770 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=478, PETRI_PLACES=169, PETRI_TRANSITIONS=130} [2022-01-19 11:12:51,771 INFO L334 CegarLoopForPetriNet]: 145 programPoint places, 24 predicate places. [2022-01-19 11:12:51,771 INFO L470 AbstractCegarLoop]: Abstraction has has 169 places, 130 transitions, 478 flow [2022-01-19 11:12:51,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 112.5) internal successors, (1350), 12 states have internal predecessors, (1350), 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-19 11:12:51,772 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:12:51,772 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] [2022-01-19 11:12:51,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 11:12:51,772 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:12:51,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:12:51,773 INFO L85 PathProgramCache]: Analyzing trace with hash 2091568862, now seen corresponding path program 1 times [2022-01-19 11:12:51,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:12:51,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710425395] [2022-01-19 11:12:51,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:12:51,774 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:12:51,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:12:51,998 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-19 11:12:51,999 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:12:51,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710425395] [2022-01-19 11:12:51,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710425395] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:12:51,999 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:12:51,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 11:12:51,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956452235] [2022-01-19 11:12:52,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:12:52,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 11:12:52,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:12:52,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 11:12:52,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-01-19 11:12:52,004 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 138 [2022-01-19 11:12:52,005 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 130 transitions, 478 flow. Second operand has 12 states, 12 states have (on average 113.41666666666667) internal successors, (1361), 12 states have internal predecessors, (1361), 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-19 11:12:52,005 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:12:52,005 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 138 [2022-01-19 11:12:52,005 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:12:52,395 INFO L129 PetriNetUnfolder]: 471/1107 cut-off events. [2022-01-19 11:12:52,396 INFO L130 PetriNetUnfolder]: For 6711/7000 co-relation queries the response was YES. [2022-01-19 11:12:52,402 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4884 conditions, 1107 events. 471/1107 cut-off events. For 6711/7000 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6524 event pairs, 125 based on Foata normal form. 31/1078 useless extension candidates. Maximal degree in co-relation 4788. Up to 508 conditions per place. [2022-01-19 11:12:52,407 INFO L132 encePairwiseOnDemand]: 124/138 looper letters, 28 selfloop transitions, 16 changer transitions 40/181 dead transitions. [2022-01-19 11:12:52,408 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 181 transitions, 1118 flow [2022-01-19 11:12:52,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 11:12:52,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 11:12:52,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1862 transitions. [2022-01-19 11:12:52,411 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8432971014492754 [2022-01-19 11:12:52,411 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1862 transitions. [2022-01-19 11:12:52,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1862 transitions. [2022-01-19 11:12:52,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:12:52,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1862 transitions. [2022-01-19 11:12:52,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 116.375) internal successors, (1862), 16 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-19 11:12:52,416 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 138.0) internal successors, (2346), 17 states have internal predecessors, (2346), 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-19 11:12:52,417 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 138.0) internal successors, (2346), 17 states have internal predecessors, (2346), 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-19 11:12:52,417 INFO L186 Difference]: Start difference. First operand has 169 places, 130 transitions, 478 flow. Second operand 16 states and 1862 transitions. [2022-01-19 11:12:52,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 181 transitions, 1118 flow [2022-01-19 11:12:52,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 181 transitions, 1028 flow, removed 34 selfloop flow, removed 11 redundant places. [2022-01-19 11:12:52,425 INFO L242 Difference]: Finished difference. Result has 178 places, 137 transitions, 588 flow [2022-01-19 11:12:52,425 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=588, PETRI_PLACES=178, PETRI_TRANSITIONS=137} [2022-01-19 11:12:52,426 INFO L334 CegarLoopForPetriNet]: 145 programPoint places, 33 predicate places. [2022-01-19 11:12:52,426 INFO L470 AbstractCegarLoop]: Abstraction has has 178 places, 137 transitions, 588 flow [2022-01-19 11:12:52,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 113.41666666666667) internal successors, (1361), 12 states have internal predecessors, (1361), 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-19 11:12:52,427 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:12:52,427 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] [2022-01-19 11:12:52,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 11:12:52,427 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:12:52,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:12:52,427 INFO L85 PathProgramCache]: Analyzing trace with hash 864810376, now seen corresponding path program 1 times [2022-01-19 11:12:52,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:12:52,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782166112] [2022-01-19 11:12:52,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:12:52,428 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:12:52,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:12:52,570 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-19 11:12:52,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:12:52,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782166112] [2022-01-19 11:12:52,571 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782166112] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:12:52,571 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:12:52,571 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 11:12:52,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851153444] [2022-01-19 11:12:52,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:12:52,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 11:12:52,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:12:52,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 11:12:52,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-19 11:12:52,572 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 138 [2022-01-19 11:12:52,573 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 137 transitions, 588 flow. Second operand has 9 states, 9 states have (on average 114.88888888888889) internal successors, (1034), 9 states have internal predecessors, (1034), 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-19 11:12:52,573 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:12:52,573 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 138 [2022-01-19 11:12:52,573 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:12:52,991 INFO L129 PetriNetUnfolder]: 503/1270 cut-off events. [2022-01-19 11:12:52,991 INFO L130 PetriNetUnfolder]: For 10962/11085 co-relation queries the response was YES. [2022-01-19 11:12:52,999 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6120 conditions, 1270 events. 503/1270 cut-off events. For 10962/11085 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7628 event pairs, 126 based on Foata normal form. 41/1248 useless extension candidates. Maximal degree in co-relation 6018. Up to 469 conditions per place. [2022-01-19 11:12:53,007 INFO L132 encePairwiseOnDemand]: 126/138 looper letters, 36 selfloop transitions, 14 changer transitions 25/173 dead transitions. [2022-01-19 11:12:53,007 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 173 transitions, 1154 flow [2022-01-19 11:12:53,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 11:12:53,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 11:12:53,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1419 transitions. [2022-01-19 11:12:53,010 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8568840579710145 [2022-01-19 11:12:53,010 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1419 transitions. [2022-01-19 11:12:53,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1419 transitions. [2022-01-19 11:12:53,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:12:53,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1419 transitions. [2022-01-19 11:12:53,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 118.25) internal successors, (1419), 12 states have internal predecessors, (1419), 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-19 11:12:53,015 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 138.0) internal successors, (1794), 13 states have internal predecessors, (1794), 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-19 11:12:53,015 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 138.0) internal successors, (1794), 13 states have internal predecessors, (1794), 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-19 11:12:53,015 INFO L186 Difference]: Start difference. First operand has 178 places, 137 transitions, 588 flow. Second operand 12 states and 1419 transitions. [2022-01-19 11:12:53,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 173 transitions, 1154 flow [2022-01-19 11:12:53,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 173 transitions, 1063 flow, removed 35 selfloop flow, removed 14 redundant places. [2022-01-19 11:12:53,027 INFO L242 Difference]: Finished difference. Result has 173 places, 140 transitions, 631 flow [2022-01-19 11:12:53,027 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=521, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=631, PETRI_PLACES=173, PETRI_TRANSITIONS=140} [2022-01-19 11:12:53,028 INFO L334 CegarLoopForPetriNet]: 145 programPoint places, 28 predicate places. [2022-01-19 11:12:53,028 INFO L470 AbstractCegarLoop]: Abstraction has has 173 places, 140 transitions, 631 flow [2022-01-19 11:12:53,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 114.88888888888889) internal successors, (1034), 9 states have internal predecessors, (1034), 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-19 11:12:53,029 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:12:53,029 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] [2022-01-19 11:12:53,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 11:12:53,029 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:12:53,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:12:53,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1084490596, now seen corresponding path program 2 times [2022-01-19 11:12:53,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:12:53,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431233953] [2022-01-19 11:12:53,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:12:53,030 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:12:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:12:53,197 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-19 11:12:53,197 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:12:53,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431233953] [2022-01-19 11:12:53,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431233953] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:12:53,198 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:12:53,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-19 11:12:53,198 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707867159] [2022-01-19 11:12:53,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:12:53,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 11:12:53,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:12:53,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 11:12:53,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-01-19 11:12:53,200 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 138 [2022-01-19 11:12:53,201 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 140 transitions, 631 flow. Second operand has 11 states, 11 states have (on average 114.54545454545455) internal successors, (1260), 11 states have internal predecessors, (1260), 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-19 11:12:53,201 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:12:53,201 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 138 [2022-01-19 11:12:53,201 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:12:53,558 INFO L129 PetriNetUnfolder]: 553/1274 cut-off events. [2022-01-19 11:12:53,558 INFO L130 PetriNetUnfolder]: For 19999/20624 co-relation queries the response was YES. [2022-01-19 11:12:53,566 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8091 conditions, 1274 events. 553/1274 cut-off events. For 19999/20624 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7759 event pairs, 44 based on Foata normal form. 46/1265 useless extension candidates. Maximal degree in co-relation 7993. Up to 481 conditions per place. [2022-01-19 11:12:53,574 INFO L132 encePairwiseOnDemand]: 126/138 looper letters, 39 selfloop transitions, 15 changer transitions 25/177 dead transitions. [2022-01-19 11:12:53,574 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 177 transitions, 1389 flow [2022-01-19 11:12:53,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 11:12:53,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 11:12:53,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1531 transitions. [2022-01-19 11:12:53,577 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8534002229654404 [2022-01-19 11:12:53,577 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1531 transitions. [2022-01-19 11:12:53,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1531 transitions. [2022-01-19 11:12:53,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:12:53,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1531 transitions. [2022-01-19 11:12:53,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 117.76923076923077) internal successors, (1531), 13 states have internal predecessors, (1531), 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-19 11:12:53,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 138.0) internal successors, (1932), 14 states have internal predecessors, (1932), 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-19 11:12:53,582 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 138.0) internal successors, (1932), 14 states have internal predecessors, (1932), 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-19 11:12:53,582 INFO L186 Difference]: Start difference. First operand has 173 places, 140 transitions, 631 flow. Second operand 13 states and 1531 transitions. [2022-01-19 11:12:53,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 177 transitions, 1389 flow [2022-01-19 11:12:53,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 177 transitions, 1257 flow, removed 54 selfloop flow, removed 10 redundant places. [2022-01-19 11:12:53,597 INFO L242 Difference]: Finished difference. Result has 176 places, 143 transitions, 693 flow [2022-01-19 11:12:53,598 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=693, PETRI_PLACES=176, PETRI_TRANSITIONS=143} [2022-01-19 11:12:53,598 INFO L334 CegarLoopForPetriNet]: 145 programPoint places, 31 predicate places. [2022-01-19 11:12:53,598 INFO L470 AbstractCegarLoop]: Abstraction has has 176 places, 143 transitions, 693 flow [2022-01-19 11:12:53,599 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 114.54545454545455) internal successors, (1260), 11 states have internal predecessors, (1260), 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-19 11:12:53,599 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:12:53,599 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] [2022-01-19 11:12:53,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 11:12:53,599 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:12:53,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:12:53,600 INFO L85 PathProgramCache]: Analyzing trace with hash 456706670, now seen corresponding path program 3 times [2022-01-19 11:12:53,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:12:53,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450895460] [2022-01-19 11:12:53,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:12:53,600 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:12:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:12:53,734 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-19 11:12:53,734 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:12:53,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450895460] [2022-01-19 11:12:53,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450895460] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:12:53,735 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:12:53,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 11:12:53,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135333738] [2022-01-19 11:12:53,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:12:53,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 11:12:53,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:12:53,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 11:12:53,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-19 11:12:53,737 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 138 [2022-01-19 11:12:53,738 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 143 transitions, 693 flow. Second operand has 9 states, 9 states have (on average 114.88888888888889) internal successors, (1034), 9 states have internal predecessors, (1034), 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-19 11:12:53,738 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:12:53,738 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 138 [2022-01-19 11:12:53,738 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:12:54,174 INFO L129 PetriNetUnfolder]: 583/1516 cut-off events. [2022-01-19 11:12:54,174 INFO L130 PetriNetUnfolder]: For 30356/30559 co-relation queries the response was YES. [2022-01-19 11:12:54,186 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9961 conditions, 1516 events. 583/1516 cut-off events. For 30356/30559 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9785 event pairs, 48 based on Foata normal form. 48/1495 useless extension candidates. Maximal degree in co-relation 9861. Up to 482 conditions per place. [2022-01-19 11:12:54,197 INFO L132 encePairwiseOnDemand]: 126/138 looper letters, 39 selfloop transitions, 27 changer transitions 25/189 dead transitions. [2022-01-19 11:12:54,197 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 189 transitions, 1785 flow [2022-01-19 11:12:54,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 11:12:54,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 11:12:54,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1536 transitions. [2022-01-19 11:12:54,199 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8561872909698997 [2022-01-19 11:12:54,199 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1536 transitions. [2022-01-19 11:12:54,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1536 transitions. [2022-01-19 11:12:54,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:12:54,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1536 transitions. [2022-01-19 11:12:54,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 118.15384615384616) internal successors, (1536), 13 states have internal predecessors, (1536), 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-19 11:12:54,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 138.0) internal successors, (1932), 14 states have internal predecessors, (1932), 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-19 11:12:54,205 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 138.0) internal successors, (1932), 14 states have internal predecessors, (1932), 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-19 11:12:54,205 INFO L186 Difference]: Start difference. First operand has 176 places, 143 transitions, 693 flow. Second operand 13 states and 1536 transitions. [2022-01-19 11:12:54,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 189 transitions, 1785 flow [2022-01-19 11:12:54,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 189 transitions, 1271 flow, removed 244 selfloop flow, removed 14 redundant places. [2022-01-19 11:12:54,231 INFO L242 Difference]: Finished difference. Result has 176 places, 152 transitions, 804 flow [2022-01-19 11:12:54,231 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=804, PETRI_PLACES=176, PETRI_TRANSITIONS=152} [2022-01-19 11:12:54,231 INFO L334 CegarLoopForPetriNet]: 145 programPoint places, 31 predicate places. [2022-01-19 11:12:54,232 INFO L470 AbstractCegarLoop]: Abstraction has has 176 places, 152 transitions, 804 flow [2022-01-19 11:12:54,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 114.88888888888889) internal successors, (1034), 9 states have internal predecessors, (1034), 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-19 11:12:54,232 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:12:54,233 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] [2022-01-19 11:12:54,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 11:12:54,233 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:12:54,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:12:54,233 INFO L85 PathProgramCache]: Analyzing trace with hash 325975046, now seen corresponding path program 1 times [2022-01-19 11:12:54,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:12:54,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126321116] [2022-01-19 11:12:54,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:12:54,233 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:12:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:12:54,410 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-19 11:12:54,410 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:12:54,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126321116] [2022-01-19 11:12:54,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126321116] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:12:54,410 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:12:54,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 11:12:54,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563291108] [2022-01-19 11:12:54,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:12:54,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 11:12:54,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:12:54,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 11:12:54,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-01-19 11:12:54,412 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 138 [2022-01-19 11:12:54,413 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 152 transitions, 804 flow. Second operand has 12 states, 12 states have (on average 111.75) internal successors, (1341), 12 states have internal predecessors, (1341), 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-19 11:12:54,413 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:12:54,413 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 138 [2022-01-19 11:12:54,413 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:12:54,788 INFO L129 PetriNetUnfolder]: 497/1238 cut-off events. [2022-01-19 11:12:54,788 INFO L130 PetriNetUnfolder]: For 17459/18127 co-relation queries the response was YES. [2022-01-19 11:12:54,796 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7525 conditions, 1238 events. 497/1238 cut-off events. For 17459/18127 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 7611 event pairs, 84 based on Foata normal form. 44/1216 useless extension candidates. Maximal degree in co-relation 7423. Up to 581 conditions per place. [2022-01-19 11:12:54,803 INFO L132 encePairwiseOnDemand]: 125/138 looper letters, 50 selfloop transitions, 17 changer transitions 19/181 dead transitions. [2022-01-19 11:12:54,803 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 181 transitions, 1486 flow [2022-01-19 11:12:54,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 11:12:54,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 11:12:54,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1490 transitions. [2022-01-19 11:12:54,806 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.830546265328874 [2022-01-19 11:12:54,806 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1490 transitions. [2022-01-19 11:12:54,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1490 transitions. [2022-01-19 11:12:54,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:12:54,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1490 transitions. [2022-01-19 11:12:54,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 114.61538461538461) internal successors, (1490), 13 states have internal predecessors, (1490), 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-19 11:12:54,813 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 138.0) internal successors, (1932), 14 states have internal predecessors, (1932), 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-19 11:12:54,813 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 138.0) internal successors, (1932), 14 states have internal predecessors, (1932), 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-19 11:12:54,813 INFO L186 Difference]: Start difference. First operand has 176 places, 152 transitions, 804 flow. Second operand 13 states and 1490 transitions. [2022-01-19 11:12:54,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 181 transitions, 1486 flow [2022-01-19 11:12:54,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 181 transitions, 1301 flow, removed 86 selfloop flow, removed 9 redundant places. [2022-01-19 11:12:54,833 INFO L242 Difference]: Finished difference. Result has 180 places, 154 transitions, 840 flow [2022-01-19 11:12:54,833 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=731, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=840, PETRI_PLACES=180, PETRI_TRANSITIONS=154} [2022-01-19 11:12:54,833 INFO L334 CegarLoopForPetriNet]: 145 programPoint places, 35 predicate places. [2022-01-19 11:12:54,833 INFO L470 AbstractCegarLoop]: Abstraction has has 180 places, 154 transitions, 840 flow [2022-01-19 11:12:54,834 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 111.75) internal successors, (1341), 12 states have internal predecessors, (1341), 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-19 11:12:54,834 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:12:54,834 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] [2022-01-19 11:12:54,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 11:12:54,834 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:12:54,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:12:54,834 INFO L85 PathProgramCache]: Analyzing trace with hash -688373104, now seen corresponding path program 2 times [2022-01-19 11:12:54,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:12:54,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219478448] [2022-01-19 11:12:54,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:12:54,835 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:12:54,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:12:55,029 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-19 11:12:55,029 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:12:55,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219478448] [2022-01-19 11:12:55,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219478448] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:12:55,029 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:12:55,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-19 11:12:55,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374064591] [2022-01-19 11:12:55,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:12:55,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-19 11:12:55,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:12:55,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-19 11:12:55,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2022-01-19 11:12:55,031 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 138 [2022-01-19 11:12:55,032 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 154 transitions, 840 flow. Second operand has 13 states, 13 states have (on average 112.53846153846153) internal successors, (1463), 13 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-19 11:12:55,032 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:12:55,032 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 138 [2022-01-19 11:12:55,032 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:12:55,412 INFO L129 PetriNetUnfolder]: 501/1296 cut-off events. [2022-01-19 11:12:55,413 INFO L130 PetriNetUnfolder]: For 17870/18339 co-relation queries the response was YES. [2022-01-19 11:12:55,420 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7662 conditions, 1296 events. 501/1296 cut-off events. For 17870/18339 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 8258 event pairs, 86 based on Foata normal form. 41/1267 useless extension candidates. Maximal degree in co-relation 7559. Up to 554 conditions per place. [2022-01-19 11:12:55,427 INFO L132 encePairwiseOnDemand]: 126/138 looper letters, 48 selfloop transitions, 21 changer transitions 19/184 dead transitions. [2022-01-19 11:12:55,428 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 184 transitions, 1558 flow [2022-01-19 11:12:55,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 11:12:55,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 11:12:55,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1612 transitions. [2022-01-19 11:12:55,430 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8343685300207039 [2022-01-19 11:12:55,430 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1612 transitions. [2022-01-19 11:12:55,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1612 transitions. [2022-01-19 11:12:55,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:12:55,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1612 transitions. [2022-01-19 11:12:55,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 115.14285714285714) internal successors, (1612), 14 states have internal predecessors, (1612), 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-19 11:12:55,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 138.0) internal successors, (2070), 15 states have internal predecessors, (2070), 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-19 11:12:55,434 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 138.0) internal successors, (2070), 15 states have internal predecessors, (2070), 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-19 11:12:55,434 INFO L186 Difference]: Start difference. First operand has 180 places, 154 transitions, 840 flow. Second operand 14 states and 1612 transitions. [2022-01-19 11:12:55,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 184 transitions, 1558 flow [2022-01-19 11:12:55,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 184 transitions, 1375 flow, removed 77 selfloop flow, removed 11 redundant places. [2022-01-19 11:12:55,451 INFO L242 Difference]: Finished difference. Result has 183 places, 156 transitions, 892 flow [2022-01-19 11:12:55,451 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=763, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=892, PETRI_PLACES=183, PETRI_TRANSITIONS=156} [2022-01-19 11:12:55,452 INFO L334 CegarLoopForPetriNet]: 145 programPoint places, 38 predicate places. [2022-01-19 11:12:55,452 INFO L470 AbstractCegarLoop]: Abstraction has has 183 places, 156 transitions, 892 flow [2022-01-19 11:12:55,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 112.53846153846153) internal successors, (1463), 13 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-19 11:12:55,452 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:12:55,452 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] [2022-01-19 11:12:55,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-19 11:12:55,453 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:12:55,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:12:55,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1190206754, now seen corresponding path program 1 times [2022-01-19 11:12:55,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:12:55,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132328120] [2022-01-19 11:12:55,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:12:55,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:12:55,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:12:55,514 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-19 11:12:55,515 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:12:55,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132328120] [2022-01-19 11:12:55,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132328120] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:12:55,515 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:12:55,515 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 11:12:55,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171842172] [2022-01-19 11:12:55,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:12:55,515 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 11:12:55,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:12:55,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 11:12:55,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 11:12:55,516 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 138 [2022-01-19 11:12:55,516 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 156 transitions, 892 flow. Second operand has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 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-19 11:12:55,516 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:12:55,516 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 138 [2022-01-19 11:12:55,516 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:12:56,882 INFO L129 PetriNetUnfolder]: 6080/10446 cut-off events. [2022-01-19 11:12:56,883 INFO L130 PetriNetUnfolder]: For 164337/166517 co-relation queries the response was YES. [2022-01-19 11:12:56,937 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52906 conditions, 10446 events. 6080/10446 cut-off events. For 164337/166517 co-relation queries the response was YES. Maximal size of possible extension queue 716. Compared 80944 event pairs, 264 based on Foata normal form. 517/10529 useless extension candidates. Maximal degree in co-relation 52806. Up to 3609 conditions per place. [2022-01-19 11:12:56,986 INFO L132 encePairwiseOnDemand]: 127/138 looper letters, 235 selfloop transitions, 20 changer transitions 15/371 dead transitions. [2022-01-19 11:12:56,986 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 371 transitions, 3989 flow [2022-01-19 11:12:56,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 11:12:56,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 11:12:56,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1212 transitions. [2022-01-19 11:12:56,988 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8782608695652174 [2022-01-19 11:12:56,988 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1212 transitions. [2022-01-19 11:12:56,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1212 transitions. [2022-01-19 11:12:56,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:12:56,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1212 transitions. [2022-01-19 11:12:56,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 121.2) internal successors, (1212), 10 states have internal predecessors, (1212), 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-19 11:12:56,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 138.0) internal successors, (1518), 11 states have internal predecessors, (1518), 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-19 11:12:56,992 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 138.0) internal successors, (1518), 11 states have internal predecessors, (1518), 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-19 11:12:56,992 INFO L186 Difference]: Start difference. First operand has 183 places, 156 transitions, 892 flow. Second operand 10 states and 1212 transitions. [2022-01-19 11:12:56,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 371 transitions, 3989 flow [2022-01-19 11:12:57,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 371 transitions, 3605 flow, removed 132 selfloop flow, removed 12 redundant places. [2022-01-19 11:12:57,198 INFO L242 Difference]: Finished difference. Result has 180 places, 174 transitions, 952 flow [2022-01-19 11:12:57,198 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=809, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=952, PETRI_PLACES=180, PETRI_TRANSITIONS=174} [2022-01-19 11:12:57,198 INFO L334 CegarLoopForPetriNet]: 145 programPoint places, 35 predicate places. [2022-01-19 11:12:57,198 INFO L470 AbstractCegarLoop]: Abstraction has has 180 places, 174 transitions, 952 flow [2022-01-19 11:12:57,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 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-19 11:12:57,199 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:12:57,199 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-19 11:12:57,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-19 11:12:57,199 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:12:57,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:12:57,199 INFO L85 PathProgramCache]: Analyzing trace with hash 872031625, now seen corresponding path program 1 times [2022-01-19 11:12:57,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:12:57,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535274112] [2022-01-19 11:12:57,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:12:57,200 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:12:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:12:57,363 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-19 11:12:57,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:12:57,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535274112] [2022-01-19 11:12:57,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535274112] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:12:57,363 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:12:57,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 11:12:57,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562122148] [2022-01-19 11:12:57,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:12:57,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 11:12:57,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:12:57,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 11:12:57,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-01-19 11:12:57,365 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 138 [2022-01-19 11:12:57,366 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 174 transitions, 952 flow. Second operand has 12 states, 12 states have (on average 112.66666666666667) internal successors, (1352), 12 states have internal predecessors, (1352), 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-19 11:12:57,366 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:12:57,366 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 138 [2022-01-19 11:12:57,366 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:12:58,195 INFO L129 PetriNetUnfolder]: 1347/4328 cut-off events. [2022-01-19 11:12:58,195 INFO L130 PetriNetUnfolder]: For 23965/25710 co-relation queries the response was YES. [2022-01-19 11:12:58,271 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17228 conditions, 4328 events. 1347/4328 cut-off events. For 23965/25710 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 43872 event pairs, 373 based on Foata normal form. 99/4122 useless extension candidates. Maximal degree in co-relation 17125. Up to 930 conditions per place. [2022-01-19 11:12:58,290 INFO L132 encePairwiseOnDemand]: 127/138 looper letters, 64 selfloop transitions, 27 changer transitions 0/205 dead transitions. [2022-01-19 11:12:58,291 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 205 transitions, 1582 flow [2022-01-19 11:12:58,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 11:12:58,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 11:12:58,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1500 transitions. [2022-01-19 11:12:58,292 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8361204013377926 [2022-01-19 11:12:58,293 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1500 transitions. [2022-01-19 11:12:58,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1500 transitions. [2022-01-19 11:12:58,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:12:58,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1500 transitions. [2022-01-19 11:12:58,295 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 115.38461538461539) internal successors, (1500), 13 states have internal predecessors, (1500), 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-19 11:12:58,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 138.0) internal successors, (1932), 14 states have internal predecessors, (1932), 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-19 11:12:58,296 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 138.0) internal successors, (1932), 14 states have internal predecessors, (1932), 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-19 11:12:58,296 INFO L186 Difference]: Start difference. First operand has 180 places, 174 transitions, 952 flow. Second operand 13 states and 1500 transitions. [2022-01-19 11:12:58,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 205 transitions, 1582 flow [2022-01-19 11:12:58,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 205 transitions, 1580 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 11:12:58,315 INFO L242 Difference]: Finished difference. Result has 198 places, 187 transitions, 1294 flow [2022-01-19 11:12:58,316 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=950, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1294, PETRI_PLACES=198, PETRI_TRANSITIONS=187} [2022-01-19 11:12:58,316 INFO L334 CegarLoopForPetriNet]: 145 programPoint places, 53 predicate places. [2022-01-19 11:12:58,316 INFO L470 AbstractCegarLoop]: Abstraction has has 198 places, 187 transitions, 1294 flow [2022-01-19 11:12:58,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 112.66666666666667) internal successors, (1352), 12 states have internal predecessors, (1352), 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-19 11:12:58,317 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:12:58,317 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-19 11:12:58,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-19 11:12:58,317 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:12:58,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:12:58,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1513315443, now seen corresponding path program 1 times [2022-01-19 11:12:58,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:12:58,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023372017] [2022-01-19 11:12:58,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:12:58,317 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:12:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:12:58,384 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-19 11:12:58,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:12:58,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023372017] [2022-01-19 11:12:58,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023372017] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:12:58,385 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:12:58,385 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 11:12:58,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594073107] [2022-01-19 11:12:58,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:12:58,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 11:12:58,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:12:58,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 11:12:58,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 11:12:58,386 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 138 [2022-01-19 11:12:58,386 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 187 transitions, 1294 flow. Second operand has 7 states, 7 states have (on average 114.28571428571429) internal successors, (800), 7 states have internal predecessors, (800), 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-19 11:12:58,386 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:12:58,386 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 138 [2022-01-19 11:12:58,387 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:13:00,327 INFO L129 PetriNetUnfolder]: 6918/13059 cut-off events. [2022-01-19 11:13:00,327 INFO L130 PetriNetUnfolder]: For 184945/187087 co-relation queries the response was YES. [2022-01-19 11:13:00,396 INFO L84 FinitePrefix]: Finished finitePrefix Result has 70039 conditions, 13059 events. 6918/13059 cut-off events. For 184945/187087 co-relation queries the response was YES. Maximal size of possible extension queue 903. Compared 114864 event pairs, 161 based on Foata normal form. 807/13650 useless extension candidates. Maximal degree in co-relation 69931. Up to 3237 conditions per place. [2022-01-19 11:13:00,438 INFO L132 encePairwiseOnDemand]: 127/138 looper letters, 276 selfloop transitions, 38 changer transitions 54/468 dead transitions. [2022-01-19 11:13:00,438 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 468 transitions, 5878 flow [2022-01-19 11:13:00,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 11:13:00,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 11:13:00,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1579 transitions. [2022-01-19 11:13:00,440 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8801560758082497 [2022-01-19 11:13:00,441 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1579 transitions. [2022-01-19 11:13:00,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1579 transitions. [2022-01-19 11:13:00,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:13:00,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1579 transitions. [2022-01-19 11:13:00,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 121.46153846153847) internal successors, (1579), 13 states have internal predecessors, (1579), 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-19 11:13:00,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 138.0) internal successors, (1932), 14 states have internal predecessors, (1932), 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-19 11:13:00,445 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 138.0) internal successors, (1932), 14 states have internal predecessors, (1932), 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-19 11:13:00,445 INFO L186 Difference]: Start difference. First operand has 198 places, 187 transitions, 1294 flow. Second operand 13 states and 1579 transitions. [2022-01-19 11:13:00,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 468 transitions, 5878 flow [2022-01-19 11:13:00,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 468 transitions, 5586 flow, removed 123 selfloop flow, removed 4 redundant places. [2022-01-19 11:13:00,608 INFO L242 Difference]: Finished difference. Result has 212 places, 191 transitions, 1283 flow [2022-01-19 11:13:00,609 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=1078, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1283, PETRI_PLACES=212, PETRI_TRANSITIONS=191} [2022-01-19 11:13:00,609 INFO L334 CegarLoopForPetriNet]: 145 programPoint places, 67 predicate places. [2022-01-19 11:13:00,609 INFO L470 AbstractCegarLoop]: Abstraction has has 212 places, 191 transitions, 1283 flow [2022-01-19 11:13:00,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.28571428571429) internal successors, (800), 7 states have internal predecessors, (800), 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-19 11:13:00,609 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:13:00,609 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] [2022-01-19 11:13:00,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-19 11:13:00,610 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:13:00,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:13:00,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1627305200, now seen corresponding path program 1 times [2022-01-19 11:13:00,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:13:00,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464124041] [2022-01-19 11:13:00,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:13:00,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:13:00,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:13:00,686 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-19 11:13:00,687 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:13:00,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464124041] [2022-01-19 11:13:00,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464124041] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:13:00,688 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:13:00,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 11:13:00,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542236321] [2022-01-19 11:13:00,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:13:00,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 11:13:00,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:13:00,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 11:13:00,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 11:13:00,691 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 138 [2022-01-19 11:13:00,691 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 191 transitions, 1283 flow. Second operand has 7 states, 7 states have (on average 116.42857142857143) internal successors, (815), 7 states have internal predecessors, (815), 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-19 11:13:00,691 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:13:00,691 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 138 [2022-01-19 11:13:00,691 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:13:02,029 INFO L129 PetriNetUnfolder]: 2410/7898 cut-off events. [2022-01-19 11:13:02,030 INFO L130 PetriNetUnfolder]: For 56622/68765 co-relation queries the response was YES. [2022-01-19 11:13:02,080 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34648 conditions, 7898 events. 2410/7898 cut-off events. For 56622/68765 co-relation queries the response was YES. Maximal size of possible extension queue 856. Compared 92761 event pairs, 345 based on Foata normal form. 189/7428 useless extension candidates. Maximal degree in co-relation 34534. Up to 2106 conditions per place. [2022-01-19 11:13:02,111 INFO L132 encePairwiseOnDemand]: 132/138 looper letters, 97 selfloop transitions, 6 changer transitions 15/260 dead transitions. [2022-01-19 11:13:02,111 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 260 transitions, 2631 flow [2022-01-19 11:13:02,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 11:13:02,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 11:13:02,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 844 transitions. [2022-01-19 11:13:02,112 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8737060041407867 [2022-01-19 11:13:02,112 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 844 transitions. [2022-01-19 11:13:02,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 844 transitions. [2022-01-19 11:13:02,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:13:02,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 844 transitions. [2022-01-19 11:13:02,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.57142857142857) internal successors, (844), 7 states have internal predecessors, (844), 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-19 11:13:02,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 138.0) internal successors, (1104), 8 states have internal predecessors, (1104), 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-19 11:13:02,115 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 138.0) internal successors, (1104), 8 states have internal predecessors, (1104), 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-19 11:13:02,115 INFO L186 Difference]: Start difference. First operand has 212 places, 191 transitions, 1283 flow. Second operand 7 states and 844 transitions. [2022-01-19 11:13:02,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 260 transitions, 2631 flow [2022-01-19 11:13:02,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 260 transitions, 2444 flow, removed 84 selfloop flow, removed 10 redundant places. [2022-01-19 11:13:02,382 INFO L242 Difference]: Finished difference. Result has 207 places, 196 transitions, 1251 flow [2022-01-19 11:13:02,382 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=1164, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1251, PETRI_PLACES=207, PETRI_TRANSITIONS=196} [2022-01-19 11:13:02,382 INFO L334 CegarLoopForPetriNet]: 145 programPoint places, 62 predicate places. [2022-01-19 11:13:02,382 INFO L470 AbstractCegarLoop]: Abstraction has has 207 places, 196 transitions, 1251 flow [2022-01-19 11:13:02,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.42857142857143) internal successors, (815), 7 states have internal predecessors, (815), 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-19 11:13:02,383 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:13:02,383 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] [2022-01-19 11:13:02,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-19 11:13:02,383 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:13:02,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:13:02,383 INFO L85 PathProgramCache]: Analyzing trace with hash 2088285924, now seen corresponding path program 2 times [2022-01-19 11:13:02,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:13:02,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317455529] [2022-01-19 11:13:02,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:13:02,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:13:02,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:13:02,437 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-19 11:13:02,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:13:02,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317455529] [2022-01-19 11:13:02,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317455529] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:13:02,438 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:13:02,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 11:13:02,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128571591] [2022-01-19 11:13:02,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:13:02,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 11:13:02,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:13:02,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 11:13:02,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 11:13:02,439 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 138 [2022-01-19 11:13:02,440 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 196 transitions, 1251 flow. Second operand has 6 states, 6 states have (on average 117.5) internal successors, (705), 6 states have internal predecessors, (705), 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-19 11:13:02,440 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:13:02,440 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 138 [2022-01-19 11:13:02,440 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:13:04,531 INFO L129 PetriNetUnfolder]: 4423/15352 cut-off events. [2022-01-19 11:13:04,531 INFO L130 PetriNetUnfolder]: For 88062/94264 co-relation queries the response was YES. [2022-01-19 11:13:04,718 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58465 conditions, 15352 events. 4423/15352 cut-off events. For 88062/94264 co-relation queries the response was YES. Maximal size of possible extension queue 1442. Compared 205179 event pairs, 644 based on Foata normal form. 279/14640 useless extension candidates. Maximal degree in co-relation 58354. Up to 2377 conditions per place. [2022-01-19 11:13:04,761 INFO L132 encePairwiseOnDemand]: 132/138 looper letters, 119 selfloop transitions, 18 changer transitions 25/304 dead transitions. [2022-01-19 11:13:04,761 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 304 transitions, 3235 flow [2022-01-19 11:13:04,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 11:13:04,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 11:13:04,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1096 transitions. [2022-01-19 11:13:04,763 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8824476650563607 [2022-01-19 11:13:04,763 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1096 transitions. [2022-01-19 11:13:04,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1096 transitions. [2022-01-19 11:13:04,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:13:04,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1096 transitions. [2022-01-19 11:13:04,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 121.77777777777777) internal successors, (1096), 9 states have internal predecessors, (1096), 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-19 11:13:04,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 138.0) internal successors, (1380), 10 states have internal predecessors, (1380), 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-19 11:13:04,765 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 138.0) internal successors, (1380), 10 states have internal predecessors, (1380), 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-19 11:13:04,766 INFO L186 Difference]: Start difference. First operand has 207 places, 196 transitions, 1251 flow. Second operand 9 states and 1096 transitions. [2022-01-19 11:13:04,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 304 transitions, 3235 flow [2022-01-19 11:13:05,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 304 transitions, 3218 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-01-19 11:13:05,170 INFO L242 Difference]: Finished difference. Result has 221 places, 211 transitions, 1525 flow [2022-01-19 11:13:05,170 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=1244, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1525, PETRI_PLACES=221, PETRI_TRANSITIONS=211} [2022-01-19 11:13:05,171 INFO L334 CegarLoopForPetriNet]: 145 programPoint places, 76 predicate places. [2022-01-19 11:13:05,171 INFO L470 AbstractCegarLoop]: Abstraction has has 221 places, 211 transitions, 1525 flow [2022-01-19 11:13:05,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.5) internal successors, (705), 6 states have internal predecessors, (705), 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-19 11:13:05,171 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:13:05,171 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] [2022-01-19 11:13:05,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-19 11:13:05,171 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:13:05,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:13:05,171 INFO L85 PathProgramCache]: Analyzing trace with hash 408935883, now seen corresponding path program 1 times [2022-01-19 11:13:05,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:13:05,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338661727] [2022-01-19 11:13:05,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:13:05,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:13:05,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:13:05,243 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-19 11:13:05,244 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:13:05,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338661727] [2022-01-19 11:13:05,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338661727] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:13:05,244 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:13:05,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 11:13:05,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770982890] [2022-01-19 11:13:05,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:13:05,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 11:13:05,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:13:05,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 11:13:05,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-19 11:13:05,245 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 138 [2022-01-19 11:13:05,245 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 211 transitions, 1525 flow. Second operand has 8 states, 8 states have (on average 114.25) internal successors, (914), 8 states have internal predecessors, (914), 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-19 11:13:05,245 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:13:05,246 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 138 [2022-01-19 11:13:05,246 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:13:09,391 INFO L129 PetriNetUnfolder]: 15178/28809 cut-off events. [2022-01-19 11:13:09,392 INFO L130 PetriNetUnfolder]: For 369543/379064 co-relation queries the response was YES. [2022-01-19 11:13:09,649 INFO L84 FinitePrefix]: Finished finitePrefix Result has 156437 conditions, 28809 events. 15178/28809 cut-off events. For 369543/379064 co-relation queries the response was YES. Maximal size of possible extension queue 2293. Compared 294899 event pairs, 263 based on Foata normal form. 1814/29520 useless extension candidates. Maximal degree in co-relation 156319. Up to 7080 conditions per place. [2022-01-19 11:13:09,677 INFO L132 encePairwiseOnDemand]: 127/138 looper letters, 90 selfloop transitions, 15 changer transitions 299/503 dead transitions. [2022-01-19 11:13:09,677 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 503 transitions, 6248 flow [2022-01-19 11:13:09,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 11:13:09,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 11:13:09,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1944 transitions. [2022-01-19 11:13:09,679 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8804347826086957 [2022-01-19 11:13:09,680 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1944 transitions. [2022-01-19 11:13:09,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1944 transitions. [2022-01-19 11:13:09,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:13:09,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1944 transitions. [2022-01-19 11:13:09,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 121.5) internal successors, (1944), 16 states have internal predecessors, (1944), 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-19 11:13:09,840 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 138.0) internal successors, (2346), 17 states have internal predecessors, (2346), 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-19 11:13:09,841 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 138.0) internal successors, (2346), 17 states have internal predecessors, (2346), 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-19 11:13:09,841 INFO L186 Difference]: Start difference. First operand has 221 places, 211 transitions, 1525 flow. Second operand 16 states and 1944 transitions. [2022-01-19 11:13:09,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 503 transitions, 6248 flow [2022-01-19 11:13:11,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 503 transitions, 5950 flow, removed 74 selfloop flow, removed 5 redundant places. [2022-01-19 11:13:11,344 INFO L242 Difference]: Finished difference. Result has 237 places, 150 transitions, 952 flow [2022-01-19 11:13:11,344 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=1326, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=952, PETRI_PLACES=237, PETRI_TRANSITIONS=150} [2022-01-19 11:13:11,345 INFO L334 CegarLoopForPetriNet]: 145 programPoint places, 92 predicate places. [2022-01-19 11:13:11,345 INFO L470 AbstractCegarLoop]: Abstraction has has 237 places, 150 transitions, 952 flow [2022-01-19 11:13:11,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 114.25) internal successors, (914), 8 states have internal predecessors, (914), 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-19 11:13:11,345 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:13:11,345 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, 1] [2022-01-19 11:13:11,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-19 11:13:11,345 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:13:11,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:13:11,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1372736630, now seen corresponding path program 1 times [2022-01-19 11:13:11,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:13:11,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580270259] [2022-01-19 11:13:11,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:13:11,346 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:13:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:13:11,458 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-19 11:13:11,458 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:13:11,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580270259] [2022-01-19 11:13:11,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580270259] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:13:11,459 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:13:11,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 11:13:11,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480015738] [2022-01-19 11:13:11,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:13:11,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 11:13:11,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:13:11,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 11:13:11,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-19 11:13:11,461 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 138 [2022-01-19 11:13:11,461 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 150 transitions, 952 flow. Second operand has 9 states, 9 states have (on average 114.22222222222223) internal successors, (1028), 9 states have internal predecessors, (1028), 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-19 11:13:11,462 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:13:11,462 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 138 [2022-01-19 11:13:11,462 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:13:12,109 INFO L129 PetriNetUnfolder]: 1218/3289 cut-off events. [2022-01-19 11:13:12,109 INFO L130 PetriNetUnfolder]: For 37527/38294 co-relation queries the response was YES. [2022-01-19 11:13:12,127 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17134 conditions, 3289 events. 1218/3289 cut-off events. For 37527/38294 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 28573 event pairs, 22 based on Foata normal form. 160/3332 useless extension candidates. Maximal degree in co-relation 17070. Up to 666 conditions per place. [2022-01-19 11:13:12,131 INFO L132 encePairwiseOnDemand]: 128/138 looper letters, 76 selfloop transitions, 19 changer transitions 35/229 dead transitions. [2022-01-19 11:13:12,132 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 229 transitions, 2348 flow [2022-01-19 11:13:12,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 11:13:12,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 11:13:12,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1420 transitions. [2022-01-19 11:13:12,133 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.857487922705314 [2022-01-19 11:13:12,133 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1420 transitions. [2022-01-19 11:13:12,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1420 transitions. [2022-01-19 11:13:12,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:13:12,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1420 transitions. [2022-01-19 11:13:12,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 118.33333333333333) internal successors, (1420), 12 states have internal predecessors, (1420), 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-19 11:13:12,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 138.0) internal successors, (1794), 13 states have internal predecessors, (1794), 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-19 11:13:12,136 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 138.0) internal successors, (1794), 13 states have internal predecessors, (1794), 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-19 11:13:12,137 INFO L186 Difference]: Start difference. First operand has 237 places, 150 transitions, 952 flow. Second operand 12 states and 1420 transitions. [2022-01-19 11:13:12,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 229 transitions, 2348 flow [2022-01-19 11:13:12,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 229 transitions, 1836 flow, removed 200 selfloop flow, removed 38 redundant places. [2022-01-19 11:13:12,228 INFO L242 Difference]: Finished difference. Result has 187 places, 149 transitions, 733 flow [2022-01-19 11:13:12,228 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=733, PETRI_PLACES=187, PETRI_TRANSITIONS=149} [2022-01-19 11:13:12,229 INFO L334 CegarLoopForPetriNet]: 145 programPoint places, 42 predicate places. [2022-01-19 11:13:12,229 INFO L470 AbstractCegarLoop]: Abstraction has has 187 places, 149 transitions, 733 flow [2022-01-19 11:13:12,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 114.22222222222223) internal successors, (1028), 9 states have internal predecessors, (1028), 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-19 11:13:12,229 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:13:12,229 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, 1, 1, 1, 1, 1] [2022-01-19 11:13:12,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-19 11:13:12,229 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:13:12,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:13:12,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1245737500, now seen corresponding path program 1 times [2022-01-19 11:13:12,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:13:12,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871443833] [2022-01-19 11:13:12,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:13:12,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:13:12,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 11:13:12,352 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-19 11:13:12,352 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 11:13:12,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871443833] [2022-01-19 11:13:12,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871443833] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 11:13:12,353 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 11:13:12,353 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 11:13:12,353 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656051929] [2022-01-19 11:13:12,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 11:13:12,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 11:13:12,353 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 11:13:12,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 11:13:12,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-01-19 11:13:12,354 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 138 [2022-01-19 11:13:12,355 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 149 transitions, 733 flow. Second operand has 12 states, 12 states have (on average 112.83333333333333) internal successors, (1354), 12 states have internal predecessors, (1354), 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-19 11:13:12,355 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 11:13:12,355 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 138 [2022-01-19 11:13:12,355 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 11:13:13,220 INFO L129 PetriNetUnfolder]: 1406/5333 cut-off events. [2022-01-19 11:13:13,220 INFO L130 PetriNetUnfolder]: For 16257/17507 co-relation queries the response was YES. [2022-01-19 11:13:13,241 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17997 conditions, 5333 events. 1406/5333 cut-off events. For 16257/17507 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 60037 event pairs, 42 based on Foata normal form. 84/5063 useless extension candidates. Maximal degree in co-relation 17896. Up to 977 conditions per place. [2022-01-19 11:13:13,245 INFO L132 encePairwiseOnDemand]: 128/138 looper letters, 29 selfloop transitions, 2 changer transitions 115/254 dead transitions. [2022-01-19 11:13:13,245 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 254 transitions, 2007 flow [2022-01-19 11:13:13,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-19 11:13:13,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-01-19 11:13:13,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2178 transitions. [2022-01-19 11:13:13,247 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8306636155606407 [2022-01-19 11:13:13,247 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2178 transitions. [2022-01-19 11:13:13,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2178 transitions. [2022-01-19 11:13:13,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 11:13:13,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2178 transitions. [2022-01-19 11:13:13,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 114.63157894736842) internal successors, (2178), 19 states have internal predecessors, (2178), 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-19 11:13:13,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 138.0) internal successors, (2760), 20 states have internal predecessors, (2760), 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-19 11:13:13,251 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 138.0) internal successors, (2760), 20 states have internal predecessors, (2760), 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-19 11:13:13,252 INFO L186 Difference]: Start difference. First operand has 187 places, 149 transitions, 733 flow. Second operand 19 states and 2178 transitions. [2022-01-19 11:13:13,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 254 transitions, 2007 flow [2022-01-19 11:13:13,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 254 transitions, 1654 flow, removed 141 selfloop flow, removed 25 redundant places. [2022-01-19 11:13:13,390 INFO L242 Difference]: Finished difference. Result has 192 places, 137 transitions, 516 flow [2022-01-19 11:13:13,390 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=516, PETRI_PLACES=192, PETRI_TRANSITIONS=137} [2022-01-19 11:13:13,391 INFO L334 CegarLoopForPetriNet]: 145 programPoint places, 47 predicate places. [2022-01-19 11:13:13,391 INFO L470 AbstractCegarLoop]: Abstraction has has 192 places, 137 transitions, 516 flow [2022-01-19 11:13:13,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 112.83333333333333) internal successors, (1354), 12 states have internal predecessors, (1354), 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-19 11:13:13,391 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 11:13:13,391 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, 1, 1, 1, 1, 1] [2022-01-19 11:13:13,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-19 11:13:13,391 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2022-01-19 11:13:13,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 11:13:13,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1413550522, now seen corresponding path program 2 times [2022-01-19 11:13:13,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 11:13:13,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980823386] [2022-01-19 11:13:13,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 11:13:13,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 11:13:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 11:13:13,426 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-19 11:13:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 11:13:13,513 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-19 11:13:13,513 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-19 11:13:13,514 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-01-19 11:13:13,515 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-01-19 11:13:13,516 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2022-01-19 11:13:13,516 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2022-01-19 11:13:13,516 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2022-01-19 11:13:13,516 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2022-01-19 11:13:13,516 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-01-19 11:13:13,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-19 11:13:13,519 INFO L732 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 11:13:13,522 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 11:13:13,523 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 11:13:13,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 11:13:13 BasicIcfg [2022-01-19 11:13:13,627 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 11:13:13,627 INFO L158 Benchmark]: Toolchain (without parser) took 26786.16ms. Allocated memory was 390.1MB in the beginning and 9.3GB in the end (delta: 8.9GB). Free memory was 330.9MB in the beginning and 8.0GB in the end (delta: -7.7GB). Peak memory consumption was 1.3GB. Max. memory is 16.0GB. [2022-01-19 11:13:13,627 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 390.1MB. Free memory is still 349.0MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 11:13:13,627 INFO L158 Benchmark]: CACSL2BoogieTranslator took 329.02ms. Allocated memory was 390.1MB in the beginning and 547.4MB in the end (delta: 157.3MB). Free memory was 330.7MB in the beginning and 503.3MB in the end (delta: -172.5MB). Peak memory consumption was 7.0MB. Max. memory is 16.0GB. [2022-01-19 11:13:13,628 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.18ms. Allocated memory is still 547.4MB. Free memory was 503.3MB in the beginning and 500.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 11:13:13,628 INFO L158 Benchmark]: Boogie Preprocessor took 38.98ms. Allocated memory is still 547.4MB. Free memory was 500.2MB in the beginning and 498.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 11:13:13,628 INFO L158 Benchmark]: RCFGBuilder took 823.39ms. Allocated memory is still 547.4MB. Free memory was 498.1MB in the beginning and 413.2MB in the end (delta: 84.9MB). Peak memory consumption was 86.0MB. Max. memory is 16.0GB. [2022-01-19 11:13:13,628 INFO L158 Benchmark]: TraceAbstraction took 25532.98ms. Allocated memory was 547.4MB in the beginning and 9.3GB in the end (delta: 8.8GB). Free memory was 412.1MB in the beginning and 8.0GB in the end (delta: -7.6GB). Peak memory consumption was 1.2GB. Max. memory is 16.0GB. [2022-01-19 11:13:13,629 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.09ms. Allocated memory is still 390.1MB. Free memory is still 349.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 329.02ms. Allocated memory was 390.1MB in the beginning and 547.4MB in the end (delta: 157.3MB). Free memory was 330.7MB in the beginning and 503.3MB in the end (delta: -172.5MB). Peak memory consumption was 7.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 55.18ms. Allocated memory is still 547.4MB. Free memory was 503.3MB in the beginning and 500.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 38.98ms. Allocated memory is still 547.4MB. Free memory was 500.2MB in the beginning and 498.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 823.39ms. Allocated memory is still 547.4MB. Free memory was 498.1MB in the beginning and 413.2MB in the end (delta: 84.9MB). Peak memory consumption was 86.0MB. Max. memory is 16.0GB. * TraceAbstraction took 25532.98ms. Allocated memory was 547.4MB in the beginning and 9.3GB in the end (delta: 8.8GB). Free memory was 412.1MB in the beginning and 8.0GB in the end (delta: -7.6GB). Peak memory consumption was 1.2GB. 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_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L714] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L716] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L718] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L720] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0] [L721] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0] [L722] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L724] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L726] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L727] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L728] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L729] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L730] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L731] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L732] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L733] 0 _Bool y$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0] [L734] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0] [L735] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L736] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L737] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L738] 0 _Bool y$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0] [L739] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0] [L740] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L741] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L742] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L743] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L744] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L746] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L747] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L748] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L851] 0 pthread_t t1081; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1081={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L852] FCALL, FORK 0 pthread_create(&t1081, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1081, ((void *)0), P0, ((void *)0))=-3, t1081={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L853] 0 pthread_t t1082; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1081={5:0}, t1082={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L854] FCALL, FORK 0 pthread_create(&t1082, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1082, ((void *)0), P1, ((void *)0))=-2, t1081={5:0}, t1082={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L855] 0 pthread_t t1083; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1081={5:0}, t1082={6:0}, t1083={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L856] FCALL, FORK 0 pthread_create(&t1083, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1083, ((void *)0), P2, ((void *)0))=-1, t1081={5:0}, t1082={6:0}, t1083={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L857] 0 pthread_t t1084; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1081={5:0}, t1082={6:0}, t1083={7:0}, t1084={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L858] FCALL, FORK 0 pthread_create(&t1084, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1084, ((void *)0), P3, ((void *)0))=0, t1081={5:0}, t1082={6:0}, t1083={7:0}, t1084={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L787] 3 y$w_buff1 = y$w_buff0 [L788] 3 y$w_buff0 = 2 [L789] 3 y$w_buff1_used = y$w_buff0_used [L790] 3 y$w_buff0_used = (_Bool)1 [L791] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L791] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L792] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L793] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L794] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L795] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L796] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L797] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L800] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L823] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L826] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L803] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L804] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L805] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L806] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L806] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L807] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L807] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L773] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L773] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L774] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L775] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L776] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L777] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L777] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L829] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L829] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L829] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L829] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L830] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L830] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L831] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L831] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L832] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L832] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L833] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L833] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L780] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1081={5:0}, t1082={6:0}, t1083={7:0}, t1084={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L864] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L865] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L866] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L867] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L868] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 y$flush_delayed = weak$$choice2 [L874] 0 y$mem_tmp = y [L875] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L876] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L877] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L877] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L878] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L878] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L879] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L880] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L881] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L883] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L883] 0 y = y$flush_delayed ? y$mem_tmp : y [L884] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1081={5:0}, t1082={6:0}, t1083={7:0}, t1084={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - 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: 854]: 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: 852]: 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: 858]: 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: 856]: 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, 175 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: 25.3s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 22.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1166 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1166 mSDsluCounter, 930 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1754 mSDsCounter, 466 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3188 IncrementalHoareTripleChecker+Invalid, 3654 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 466 mSolverCounterUnsat, 171 mSDtfsCounter, 3188 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 316 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1525occurred in iteration=17, InterpolantAutomatonStates: 243, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1994 NumberOfCodeBlocks, 1994 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1867 ConstructedInterpolants, 0 QuantifiedInterpolants, 10068 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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-19 11:13:13,659 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...