/usr/bin/java -Xmx8000000000 -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-OGIterative.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-2cf4d3f9dd5fed411db405f577e28237a543b59a-2cf4d3f [2021-08-13 00:56:32,300 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-13 00:56:32,302 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-13 00:56:32,330 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-13 00:56:32,331 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-13 00:56:32,334 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-13 00:56:32,335 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-13 00:56:32,340 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-13 00:56:32,342 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-13 00:56:32,346 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-13 00:56:32,347 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-13 00:56:32,348 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-13 00:56:32,348 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-13 00:56:32,349 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-13 00:56:32,350 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-13 00:56:32,351 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-13 00:56:32,354 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-13 00:56:32,355 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-13 00:56:32,357 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-13 00:56:32,363 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-13 00:56:32,364 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-13 00:56:32,366 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-13 00:56:32,366 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-13 00:56:32,367 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-13 00:56:32,375 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-13 00:56:32,375 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-13 00:56:32,376 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-13 00:56:32,377 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-13 00:56:32,377 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-13 00:56:32,378 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-13 00:56:32,378 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-13 00:56:32,378 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-13 00:56:32,379 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-13 00:56:32,380 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-13 00:56:32,381 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-13 00:56:32,381 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-13 00:56:32,381 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-13 00:56:32,381 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-13 00:56:32,382 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-13 00:56:32,382 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-13 00:56:32,383 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-13 00:56:32,383 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-OGIterative.epf [2021-08-13 00:56:32,410 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-13 00:56:32,410 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-13 00:56:32,413 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-13 00:56:32,414 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-13 00:56:32,414 INFO L138 SettingsManager]: * Use SBE=true [2021-08-13 00:56:32,414 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-13 00:56:32,414 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-13 00:56:32,414 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-13 00:56:32,414 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-13 00:56:32,414 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-13 00:56:32,415 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-13 00:56:32,415 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-13 00:56:32,415 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-13 00:56:32,415 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-13 00:56:32,415 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-13 00:56:32,415 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-13 00:56:32,415 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-13 00:56:32,416 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-13 00:56:32,416 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-13 00:56:32,416 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-13 00:56:32,416 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-13 00:56:32,416 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-13 00:56:32,416 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-13 00:56:32,416 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-13 00:56:32,416 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-13 00:56:32,416 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-13 00:56:32,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-13 00:56:32,417 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-13 00:56:32,417 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-08-13 00:56:32,417 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-13 00:56:32,417 INFO L138 SettingsManager]: * Compute cosets for OwickiGries annotation iteratively=true [2021-08-13 00:56:32,417 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 [2021-08-13 00:56:32,670 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-13 00:56:32,684 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-13 00:56:32,685 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-13 00:56:32,686 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-13 00:56:32,686 INFO L275 PluginConnector]: CDTParser initialized [2021-08-13 00:56:32,687 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc.i [2021-08-13 00:56:32,733 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3942a63b6/604e6e5e7b724fc7974b6405159e82a8/FLAG4de66a79f [2021-08-13 00:56:33,154 INFO L306 CDTParser]: Found 1 translation units. [2021-08-13 00:56:33,154 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc.i [2021-08-13 00:56:33,162 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3942a63b6/604e6e5e7b724fc7974b6405159e82a8/FLAG4de66a79f [2021-08-13 00:56:33,488 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3942a63b6/604e6e5e7b724fc7974b6405159e82a8 [2021-08-13 00:56:33,490 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-13 00:56:33,491 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-13 00:56:33,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-13 00:56:33,492 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-13 00:56:33,508 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-13 00:56:33,508 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 12:56:33" (1/1) ... [2021-08-13 00:56:33,511 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59b561ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 12:56:33, skipping insertion in model container [2021-08-13 00:56:33,511 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 12:56:33" (1/1) ... [2021-08-13 00:56:33,516 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-13 00:56:33,552 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-13 00:56:33,643 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc.i[952,965] [2021-08-13 00:56:33,809 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-13 00:56:33,820 INFO L203 MainTranslator]: Completed pre-run [2021-08-13 00:56:33,829 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc.i[952,965] [2021-08-13 00:56:33,879 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-13 00:56:33,923 INFO L208 MainTranslator]: Completed translation [2021-08-13 00:56:33,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 12:56:33 WrapperNode [2021-08-13 00:56:33,923 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-13 00:56:33,924 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-13 00:56:33,924 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-13 00:56:33,924 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-13 00:56:33,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 12:56:33" (1/1) ... [2021-08-13 00:56:33,939 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 12:56:33" (1/1) ... [2021-08-13 00:56:33,970 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-13 00:56:33,970 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-13 00:56:33,971 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-13 00:56:33,971 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-13 00:56:33,976 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 12:56:33" (1/1) ... [2021-08-13 00:56:33,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 12:56:33" (1/1) ... [2021-08-13 00:56:33,979 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 12:56:33" (1/1) ... [2021-08-13 00:56:33,979 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 12:56:33" (1/1) ... [2021-08-13 00:56:33,985 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 12:56:33" (1/1) ... [2021-08-13 00:56:33,987 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 12:56:33" (1/1) ... [2021-08-13 00:56:33,989 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 12:56:33" (1/1) ... [2021-08-13 00:56:33,994 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-13 00:56:33,994 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-13 00:56:33,994 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-13 00:56:33,994 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-13 00:56:33,995 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 12:56:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-13 00:56:34,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-13 00:56:34,050 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-13 00:56:34,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-13 00:56:34,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-13 00:56:34,050 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-13 00:56:34,050 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-13 00:56:34,050 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-13 00:56:34,050 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-13 00:56:34,050 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-13 00:56:34,050 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-13 00:56:34,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-13 00:56:34,050 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-13 00:56:34,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-13 00:56:34,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-13 00:56:34,051 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-13 00:56:35,456 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-13 00:56:35,457 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-13 00:56:35,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 12:56:35 BoogieIcfgContainer [2021-08-13 00:56:35,458 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-13 00:56:35,459 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-13 00:56:35,459 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-13 00:56:35,461 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-13 00:56:35,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.08 12:56:33" (1/3) ... [2021-08-13 00:56:35,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a97d73a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 12:56:35, skipping insertion in model container [2021-08-13 00:56:35,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 12:56:33" (2/3) ... [2021-08-13 00:56:35,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a97d73a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 12:56:35, skipping insertion in model container [2021-08-13 00:56:35,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 12:56:35" (3/3) ... [2021-08-13 00:56:35,463 INFO L111 eAbstractionObserver]: Analyzing ICFG safe017_power.oepc.i [2021-08-13 00:56:35,467 INFO L206 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-13 00:56:35,467 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-13 00:56:35,468 INFO L445 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-13 00:56:35,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,489 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,489 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,489 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,490 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,490 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,490 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,490 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,490 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,490 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,490 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,490 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,490 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,492 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,492 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,492 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,492 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,492 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,492 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,492 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,492 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,492 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,493 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,493 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,493 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,493 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,495 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,495 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,496 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,496 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,497 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,498 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,499 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,499 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,501 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,501 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,502 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,502 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,504 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,504 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,504 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,504 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,504 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,504 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,504 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,504 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,504 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,504 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,504 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,505 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-13 00:56:35,505 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-13 00:56:35,520 INFO L255 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-08-13 00:56:35,533 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-08-13 00:56:35,533 INFO L379 AbstractCegarLoop]: Hoare is false [2021-08-13 00:56:35,533 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-08-13 00:56:35,533 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-13 00:56:35,533 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-13 00:56:35,533 INFO L383 AbstractCegarLoop]: Difference is false [2021-08-13 00:56:35,533 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-13 00:56:35,533 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-08-13 00:56:35,540 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 223 flow [2021-08-13 00:56:35,587 INFO L129 PetriNetUnfolder]: 2/101 cut-off events. [2021-08-13 00:56:35,587 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 00:56:35,593 INFO L84 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 101 events. 2/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2021-08-13 00:56:35,593 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 104 transitions, 223 flow [2021-08-13 00:56:35,596 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 101 transitions, 211 flow [2021-08-13 00:56:35,607 INFO L129 PetriNetUnfolder]: 0/41 cut-off events. [2021-08-13 00:56:35,607 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 00:56:35,607 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 00:56:35,608 INFO L266 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] [2021-08-13 00:56:35,608 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 00:56:35,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 00:56:35,612 INFO L82 PathProgramCache]: Analyzing trace with hash -857883359, now seen corresponding path program 1 times [2021-08-13 00:56:35,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 00:56:35,617 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903578012] [2021-08-13 00:56:35,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 00:56:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 00:56:35,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:35,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:56:35,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:35,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 00:56:35,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 00:56:35,803 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 00:56:35,803 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903578012] [2021-08-13 00:56:35,804 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903578012] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 00:56:35,804 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 00:56:35,804 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-13 00:56:35,805 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680626092] [2021-08-13 00:56:35,810 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-08-13 00:56:35,811 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 00:56:35,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-13 00:56:35,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-13 00:56:35,823 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 104 [2021-08-13 00:56:35,826 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 101 transitions, 211 flow. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:56:35,826 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 00:56:35,826 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 104 [2021-08-13 00:56:35,827 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 00:56:35,959 INFO L129 PetriNetUnfolder]: 49/391 cut-off events. [2021-08-13 00:56:35,959 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-13 00:56:35,961 INFO L84 FinitePrefix]: Finished finitePrefix Result has 487 conditions, 391 events. 49/391 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1971 event pairs, 38 based on Foata normal form. 17/383 useless extension candidates. Maximal degree in co-relation 441. Up to 65 conditions per place. [2021-08-13 00:56:35,963 INFO L132 encePairwiseOnDemand]: 99/104 looper letters, 9 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2021-08-13 00:56:35,963 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 101 transitions, 233 flow [2021-08-13 00:56:35,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-13 00:56:35,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-08-13 00:56:35,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 295 transitions. [2021-08-13 00:56:35,972 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9455128205128205 [2021-08-13 00:56:35,972 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 295 transitions. [2021-08-13 00:56:35,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 295 transitions. [2021-08-13 00:56:35,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 00:56:35,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 295 transitions. [2021-08-13 00:56:35,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:56:35,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:56:35,982 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:56:35,982 INFO L348 CegarLoopForPetriNet]: 109 programPoint places, 0 predicate places. [2021-08-13 00:56:35,983 INFO L482 AbstractCegarLoop]: Abstraction has has 109 places, 101 transitions, 233 flow [2021-08-13 00:56:35,983 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:56:35,983 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 00:56:35,983 INFO L266 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] [2021-08-13 00:56:35,983 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-13 00:56:35,983 INFO L430 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 00:56:35,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 00:56:35,984 INFO L82 PathProgramCache]: Analyzing trace with hash -247046329, now seen corresponding path program 1 times [2021-08-13 00:56:35,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 00:56:35,984 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965511290] [2021-08-13 00:56:35,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 00:56:36,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 00:56:36,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:36,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:56:36,089 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:36,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 00:56:36,096 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 00:56:36,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 00:56:36,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:36,108 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:56:36,114 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:36,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:56:36,121 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:36,121 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:56:36,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 00:56:36,121 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 00:56:36,122 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965511290] [2021-08-13 00:56:36,122 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965511290] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 00:56:36,122 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 00:56:36,122 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 00:56:36,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141663049] [2021-08-13 00:56:36,123 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 00:56:36,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 00:56:36,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 00:56:36,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 00:56:36,124 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 104 [2021-08-13 00:56:36,125 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 101 transitions, 233 flow. Second operand has 6 states, 6 states have (on average 91.16666666666667) internal successors, (547), 6 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:56:36,125 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 00:56:36,125 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 104 [2021-08-13 00:56:36,125 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 00:56:36,350 INFO L129 PetriNetUnfolder]: 286/1104 cut-off events. [2021-08-13 00:56:36,350 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2021-08-13 00:56:36,354 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1704 conditions, 1104 events. 286/1104 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8402 event pairs, 124 based on Foata normal form. 0/1035 useless extension candidates. Maximal degree in co-relation 1655. Up to 254 conditions per place. [2021-08-13 00:56:36,356 INFO L132 encePairwiseOnDemand]: 97/104 looper letters, 12 selfloop transitions, 3 changer transitions 28/132 dead transitions. [2021-08-13 00:56:36,356 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 132 transitions, 385 flow [2021-08-13 00:56:36,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-13 00:56:36,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-13 00:56:36,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 853 transitions. [2021-08-13 00:56:36,360 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9113247863247863 [2021-08-13 00:56:36,360 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 853 transitions. [2021-08-13 00:56:36,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 853 transitions. [2021-08-13 00:56:36,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 00:56:36,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 853 transitions. [2021-08-13 00:56:36,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 94.77777777777777) internal successors, (853), 9 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:56:36,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 104.0) internal successors, (1040), 10 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:56:36,367 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 104.0) internal successors, (1040), 10 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:56:36,367 INFO L348 CegarLoopForPetriNet]: 109 programPoint places, 8 predicate places. [2021-08-13 00:56:36,367 INFO L482 AbstractCegarLoop]: Abstraction has has 117 places, 132 transitions, 385 flow [2021-08-13 00:56:36,368 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 91.16666666666667) internal successors, (547), 6 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:56:36,368 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 00:56:36,368 INFO L266 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] [2021-08-13 00:56:36,368 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-13 00:56:36,368 INFO L430 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 00:56:36,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 00:56:36,374 INFO L82 PathProgramCache]: Analyzing trace with hash 611273928, now seen corresponding path program 1 times [2021-08-13 00:56:36,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 00:56:36,374 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060030575] [2021-08-13 00:56:36,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 00:56:36,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 00:56:36,514 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:36,514 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:56:36,515 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:36,515 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 00:56:36,519 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 00:56:36,522 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 00:56:36,533 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:36,533 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:56:36,538 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:36,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:56:36,545 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:36,545 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:56:36,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 00:56:36,546 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 00:56:36,546 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060030575] [2021-08-13 00:56:36,546 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060030575] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 00:56:36,546 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 00:56:36,547 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 00:56:36,547 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198708613] [2021-08-13 00:56:36,547 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 00:56:36,547 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 00:56:36,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 00:56:36,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 00:56:36,551 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 104 [2021-08-13 00:56:36,551 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 132 transitions, 385 flow. Second operand has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:56:36,551 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 00:56:36,551 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 104 [2021-08-13 00:56:36,551 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 00:56:36,784 INFO L129 PetriNetUnfolder]: 347/1538 cut-off events. [2021-08-13 00:56:36,785 INFO L130 PetriNetUnfolder]: For 131/151 co-relation queries the response was YES. [2021-08-13 00:56:36,821 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2598 conditions, 1538 events. 347/1538 cut-off events. For 131/151 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 13690 event pairs, 116 based on Foata normal form. 0/1469 useless extension candidates. Maximal degree in co-relation 2546. Up to 274 conditions per place. [2021-08-13 00:56:36,824 INFO L132 encePairwiseOnDemand]: 98/104 looper letters, 8 selfloop transitions, 3 changer transitions 59/163 dead transitions. [2021-08-13 00:56:36,824 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 163 transitions, 633 flow [2021-08-13 00:56:36,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-13 00:56:36,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-08-13 00:56:36,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 851 transitions. [2021-08-13 00:56:36,827 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9091880341880342 [2021-08-13 00:56:36,827 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 851 transitions. [2021-08-13 00:56:36,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 851 transitions. [2021-08-13 00:56:36,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 00:56:36,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 851 transitions. [2021-08-13 00:56:36,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 94.55555555555556) internal successors, (851), 9 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:56:36,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 104.0) internal successors, (1040), 10 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:56:36,831 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 104.0) internal successors, (1040), 10 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:56:36,831 INFO L348 CegarLoopForPetriNet]: 109 programPoint places, 16 predicate places. [2021-08-13 00:56:36,831 INFO L482 AbstractCegarLoop]: Abstraction has has 125 places, 163 transitions, 633 flow [2021-08-13 00:56:36,832 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 93.16666666666667) internal successors, (559), 6 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:56:36,832 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 00:56:36,832 INFO L266 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] [2021-08-13 00:56:36,832 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-13 00:56:36,832 INFO L430 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 00:56:36,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 00:56:36,832 INFO L82 PathProgramCache]: Analyzing trace with hash -70408665, now seen corresponding path program 1 times [2021-08-13 00:56:36,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 00:56:36,833 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762070805] [2021-08-13 00:56:36,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 00:56:36,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 00:56:36,939 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:36,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:56:36,940 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:36,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 00:56:36,943 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:36,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 00:56:36,950 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:36,950 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 00:56:36,957 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:36,957 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 00:56:36,965 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:36,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-08-13 00:56:36,980 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:36,980 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 00:56:36,988 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 00:56:36,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 00:56:37,001 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:37,002 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:56:37,013 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:37,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:56:37,021 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:37,021 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:56:37,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 00:56:37,022 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 00:56:37,022 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762070805] [2021-08-13 00:56:37,022 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762070805] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 00:56:37,022 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 00:56:37,023 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-13 00:56:37,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057851262] [2021-08-13 00:56:37,023 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-08-13 00:56:37,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 00:56:37,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-13 00:56:37,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-08-13 00:56:37,025 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 104 [2021-08-13 00:56:37,026 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 163 transitions, 633 flow. Second operand has 11 states, 11 states have (on average 83.0909090909091) internal successors, (914), 11 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) [2021-08-13 00:56:37,026 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 00:56:37,026 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 104 [2021-08-13 00:56:37,026 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 00:56:38,102 INFO L129 PetriNetUnfolder]: 2621/7180 cut-off events. [2021-08-13 00:56:38,102 INFO L130 PetriNetUnfolder]: For 2456/2821 co-relation queries the response was YES. [2021-08-13 00:56:38,122 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15582 conditions, 7180 events. 2621/7180 cut-off events. For 2456/2821 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 72559 event pairs, 671 based on Foata normal form. 16/7079 useless extension candidates. Maximal degree in co-relation 15523. Up to 1606 conditions per place. [2021-08-13 00:56:38,133 INFO L132 encePairwiseOnDemand]: 90/104 looper letters, 18 selfloop transitions, 12 changer transitions 217/320 dead transitions. [2021-08-13 00:56:38,133 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 320 transitions, 1905 flow [2021-08-13 00:56:38,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-13 00:56:38,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-08-13 00:56:38,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1388 transitions. [2021-08-13 00:56:38,136 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8341346153846154 [2021-08-13 00:56:38,136 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1388 transitions. [2021-08-13 00:56:38,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1388 transitions. [2021-08-13 00:56:38,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 00:56:38,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1388 transitions. [2021-08-13 00:56:38,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 86.75) internal successors, (1388), 16 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:56:38,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 104.0) internal successors, (1768), 17 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:56:38,146 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 104.0) internal successors, (1768), 17 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:56:38,146 INFO L348 CegarLoopForPetriNet]: 109 programPoint places, 31 predicate places. [2021-08-13 00:56:38,147 INFO L482 AbstractCegarLoop]: Abstraction has has 140 places, 320 transitions, 1905 flow [2021-08-13 00:56:38,148 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 83.0909090909091) internal successors, (914), 11 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) [2021-08-13 00:56:38,148 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 00:56:38,148 INFO L266 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] [2021-08-13 00:56:38,148 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-13 00:56:38,148 INFO L430 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 00:56:38,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 00:56:38,149 INFO L82 PathProgramCache]: Analyzing trace with hash -500206445, now seen corresponding path program 1 times [2021-08-13 00:56:38,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 00:56:38,149 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526025761] [2021-08-13 00:56:38,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 00:56:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 00:56:38,229 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:38,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:56:38,230 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:38,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 00:56:38,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:38,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 00:56:38,237 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 00:56:38,238 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 00:56:38,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:38,250 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:56:38,256 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:38,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:56:38,272 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:38,272 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:56:38,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 00:56:38,273 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 00:56:38,273 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526025761] [2021-08-13 00:56:38,273 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526025761] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 00:56:38,273 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 00:56:38,273 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 00:56:38,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914543707] [2021-08-13 00:56:38,273 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 00:56:38,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 00:56:38,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 00:56:38,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-13 00:56:38,274 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 104 [2021-08-13 00:56:38,275 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 320 transitions, 1905 flow. Second operand has 7 states, 7 states have (on average 90.42857142857143) internal successors, (633), 7 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:56:38,275 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 00:56:38,275 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 104 [2021-08-13 00:56:38,275 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 00:56:40,000 INFO L129 PetriNetUnfolder]: 4644/13503 cut-off events. [2021-08-13 00:56:40,001 INFO L130 PetriNetUnfolder]: For 7832/8943 co-relation queries the response was YES. [2021-08-13 00:56:40,039 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32849 conditions, 13503 events. 4644/13503 cut-off events. For 7832/8943 co-relation queries the response was YES. Maximal size of possible extension queue 899. Compared 158284 event pairs, 1313 based on Foata normal form. 30/13320 useless extension candidates. Maximal degree in co-relation 32786. Up to 4028 conditions per place. [2021-08-13 00:56:40,056 INFO L132 encePairwiseOnDemand]: 97/104 looper letters, 17 selfloop transitions, 5 changer transitions 387/496 dead transitions. [2021-08-13 00:56:40,056 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 496 transitions, 3985 flow [2021-08-13 00:56:40,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-13 00:56:40,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-08-13 00:56:40,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1576 transitions. [2021-08-13 00:56:40,059 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8914027149321267 [2021-08-13 00:56:40,059 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1576 transitions. [2021-08-13 00:56:40,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1576 transitions. [2021-08-13 00:56:40,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 00:56:40,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1576 transitions. [2021-08-13 00:56:40,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 92.70588235294117) internal successors, (1576), 17 states have internal predecessors, (1576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:56:40,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 104.0) internal successors, (1872), 18 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:56:40,064 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 104.0) internal successors, (1872), 18 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:56:40,065 INFO L348 CegarLoopForPetriNet]: 109 programPoint places, 47 predicate places. [2021-08-13 00:56:40,065 INFO L482 AbstractCegarLoop]: Abstraction has has 156 places, 496 transitions, 3985 flow [2021-08-13 00:56:40,066 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 90.42857142857143) internal successors, (633), 7 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:56:40,066 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 00:56:40,066 INFO L266 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] [2021-08-13 00:56:40,066 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-13 00:56:40,066 INFO L430 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 00:56:40,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 00:56:40,066 INFO L82 PathProgramCache]: Analyzing trace with hash -311223039, now seen corresponding path program 1 times [2021-08-13 00:56:40,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 00:56:40,067 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247172043] [2021-08-13 00:56:40,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 00:56:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 00:56:40,155 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:40,156 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:56:40,156 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:40,156 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 00:56:40,158 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:40,159 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 00:56:40,184 INFO L142 QuantifierPusher]: treesize reduction 36, result has 64.4 percent of original size [2021-08-13 00:56:40,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 65 [2021-08-13 00:56:40,209 INFO L142 QuantifierPusher]: treesize reduction 36, result has 65.4 percent of original size [2021-08-13 00:56:40,210 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 68 [2021-08-13 00:56:40,230 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 00:56:40,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 00:56:40,248 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:40,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:56:40,255 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:40,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:56:40,264 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:40,264 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:56:40,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 00:56:40,265 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 00:56:40,265 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247172043] [2021-08-13 00:56:40,266 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247172043] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 00:56:40,266 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 00:56:40,266 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-13 00:56:40,266 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272109537] [2021-08-13 00:56:40,267 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-08-13 00:56:40,267 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 00:56:40,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-13 00:56:40,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-08-13 00:56:40,268 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 104 [2021-08-13 00:56:40,269 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 496 transitions, 3985 flow. Second operand has 9 states, 9 states have (on average 85.22222222222223) internal successors, (767), 9 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:56:40,269 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 00:56:40,269 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 104 [2021-08-13 00:56:40,269 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 00:56:42,123 INFO L129 PetriNetUnfolder]: 4922/14257 cut-off events. [2021-08-13 00:56:42,123 INFO L130 PetriNetUnfolder]: For 9122/11745 co-relation queries the response was YES. [2021-08-13 00:56:42,171 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41803 conditions, 14257 events. 4922/14257 cut-off events. For 9122/11745 co-relation queries the response was YES. Maximal size of possible extension queue 903. Compared 167900 event pairs, 1299 based on Foata normal form. 72/14139 useless extension candidates. Maximal degree in co-relation 41735. Up to 5984 conditions per place. [2021-08-13 00:56:42,183 INFO L132 encePairwiseOnDemand]: 94/104 looper letters, 32 selfloop transitions, 8 changer transitions 526/643 dead transitions. [2021-08-13 00:56:42,183 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 643 transitions, 6329 flow [2021-08-13 00:56:42,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-13 00:56:42,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-08-13 00:56:42,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1253 transitions. [2021-08-13 00:56:42,186 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8605769230769231 [2021-08-13 00:56:42,186 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1253 transitions. [2021-08-13 00:56:42,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1253 transitions. [2021-08-13 00:56:42,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 00:56:42,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1253 transitions. [2021-08-13 00:56:42,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 89.5) internal successors, (1253), 14 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:56:42,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 104.0) internal successors, (1560), 15 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:56:42,191 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 104.0) internal successors, (1560), 15 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:56:42,191 INFO L348 CegarLoopForPetriNet]: 109 programPoint places, 60 predicate places. [2021-08-13 00:56:42,192 INFO L482 AbstractCegarLoop]: Abstraction has has 169 places, 643 transitions, 6329 flow [2021-08-13 00:56:42,192 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 85.22222222222223) internal successors, (767), 9 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:56:42,192 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 00:56:42,193 INFO L266 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] [2021-08-13 00:56:42,193 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-13 00:56:42,193 INFO L430 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 00:56:42,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 00:56:42,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1656214005, now seen corresponding path program 1 times [2021-08-13 00:56:42,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 00:56:42,193 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625614646] [2021-08-13 00:56:42,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 00:56:42,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 00:56:42,260 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:42,261 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:56:42,262 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:42,262 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 00:56:42,264 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:42,265 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 00:56:42,268 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 00:56:42,269 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 00:56:42,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:42,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:56:42,290 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:42,290 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:56:42,297 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:42,297 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:56:42,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 00:56:42,297 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 00:56:42,297 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625614646] [2021-08-13 00:56:42,297 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625614646] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 00:56:42,298 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 00:56:42,298 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 00:56:42,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230913693] [2021-08-13 00:56:42,298 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 00:56:42,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 00:56:42,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 00:56:42,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-13 00:56:42,299 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 104 [2021-08-13 00:56:42,299 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 643 transitions, 6329 flow. Second operand has 7 states, 7 states have (on average 90.42857142857143) internal successors, (633), 7 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:56:42,299 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 00:56:42,299 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 104 [2021-08-13 00:56:42,299 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 00:56:44,669 INFO L129 PetriNetUnfolder]: 6416/18813 cut-off events. [2021-08-13 00:56:44,670 INFO L130 PetriNetUnfolder]: For 16409/20836 co-relation queries the response was YES. [2021-08-13 00:56:44,716 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58962 conditions, 18813 events. 6416/18813 cut-off events. For 16409/20836 co-relation queries the response was YES. Maximal size of possible extension queue 1211. Compared 232846 event pairs, 1724 based on Foata normal form. 156/18688 useless extension candidates. Maximal degree in co-relation 58890. Up to 7819 conditions per place. [2021-08-13 00:56:44,732 INFO L132 encePairwiseOnDemand]: 95/104 looper letters, 20 selfloop transitions, 6 changer transitions 642/759 dead transitions. [2021-08-13 00:56:44,732 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 759 transitions, 8825 flow [2021-08-13 00:56:44,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-13 00:56:44,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-13 00:56:44,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1213 transitions. [2021-08-13 00:56:44,740 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.897189349112426 [2021-08-13 00:56:44,740 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1213 transitions. [2021-08-13 00:56:44,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1213 transitions. [2021-08-13 00:56:44,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 00:56:44,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1213 transitions. [2021-08-13 00:56:44,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 93.3076923076923) internal successors, (1213), 13 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:56:44,744 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 104.0) internal successors, (1456), 14 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:56:44,744 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 104.0) internal successors, (1456), 14 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:56:44,744 INFO L348 CegarLoopForPetriNet]: 109 programPoint places, 72 predicate places. [2021-08-13 00:56:44,744 INFO L482 AbstractCegarLoop]: Abstraction has has 181 places, 759 transitions, 8825 flow [2021-08-13 00:56:44,745 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 90.42857142857143) internal successors, (633), 7 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:56:44,745 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 00:56:44,745 INFO L266 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] [2021-08-13 00:56:44,745 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-13 00:56:44,745 INFO L430 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 00:56:44,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 00:56:44,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1582903835, now seen corresponding path program 2 times [2021-08-13 00:56:44,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 00:56:44,745 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045345444] [2021-08-13 00:56:44,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 00:56:44,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 00:56:44,800 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:44,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:56:44,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:44,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 00:56:44,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:44,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 00:56:44,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:44,810 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 00:56:44,818 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.8 percent of original size [2021-08-13 00:56:44,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-08-13 00:56:44,838 INFO L142 QuantifierPusher]: treesize reduction 36, result has 66.7 percent of original size [2021-08-13 00:56:44,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 72 [2021-08-13 00:56:44,861 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 00:56:44,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 00:56:44,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:44,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:56:44,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:44,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:56:44,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:44,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:56:44,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 00:56:44,894 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 00:56:44,894 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045345444] [2021-08-13 00:56:44,894 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045345444] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 00:56:44,894 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 00:56:44,894 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-13 00:56:44,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003487622] [2021-08-13 00:56:44,895 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-08-13 00:56:44,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 00:56:44,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-13 00:56:44,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-08-13 00:56:44,896 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 104 [2021-08-13 00:56:44,896 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 759 transitions, 8825 flow. Second operand has 10 states, 10 states have (on average 83.3) internal successors, (833), 10 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:56:44,896 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 00:56:44,896 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 104 [2021-08-13 00:56:44,897 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 00:56:48,620 INFO L129 PetriNetUnfolder]: 9430/27687 cut-off events. [2021-08-13 00:56:48,620 INFO L130 PetriNetUnfolder]: For 25795/33909 co-relation queries the response was YES. [2021-08-13 00:56:48,722 INFO L84 FinitePrefix]: Finished finitePrefix Result has 100239 conditions, 27687 events. 9430/27687 cut-off events. For 25795/33909 co-relation queries the response was YES. Maximal size of possible extension queue 1788. Compared 363638 event pairs, 1832 based on Foata normal form. 96/27505 useless extension candidates. Maximal degree in co-relation 100160. Up to 12154 conditions per place. [2021-08-13 00:56:48,745 INFO L132 encePairwiseOnDemand]: 91/104 looper letters, 41 selfloop transitions, 16 changer transitions 1040/1172 dead transitions. [2021-08-13 00:56:48,745 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 1172 transitions, 16417 flow [2021-08-13 00:56:48,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-13 00:56:48,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-08-13 00:56:48,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1389 transitions. [2021-08-13 00:56:48,752 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8347355769230769 [2021-08-13 00:56:48,752 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1389 transitions. [2021-08-13 00:56:48,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1389 transitions. [2021-08-13 00:56:48,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 00:56:48,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1389 transitions. [2021-08-13 00:56:48,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 86.8125) internal successors, (1389), 16 states have internal predecessors, (1389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:56:48,757 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 104.0) internal successors, (1768), 17 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:56:48,758 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 104.0) internal successors, (1768), 17 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:56:48,758 INFO L348 CegarLoopForPetriNet]: 109 programPoint places, 87 predicate places. [2021-08-13 00:56:48,758 INFO L482 AbstractCegarLoop]: Abstraction has has 196 places, 1172 transitions, 16417 flow [2021-08-13 00:56:48,758 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 83.3) internal successors, (833), 10 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:56:48,758 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 00:56:48,758 INFO L266 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] [2021-08-13 00:56:48,758 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-13 00:56:48,758 INFO L430 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 00:56:48,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 00:56:48,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1221903127, now seen corresponding path program 3 times [2021-08-13 00:56:48,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 00:56:48,759 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005851622] [2021-08-13 00:56:48,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 00:56:48,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 00:56:48,837 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:48,837 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:56:48,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:48,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 00:56:48,840 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:48,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 00:56:48,845 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:48,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 00:56:48,857 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:48,858 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-08-13 00:56:48,871 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:48,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 00:56:48,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:48,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-08-13 00:56:48,912 INFO L142 QuantifierPusher]: treesize reduction 43, result has 56.6 percent of original size [2021-08-13 00:56:48,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 56 [2021-08-13 00:56:48,935 INFO L142 QuantifierPusher]: treesize reduction 26, result has 61.2 percent of original size [2021-08-13 00:56:48,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-08-13 00:56:48,958 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 00:56:48,959 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 00:56:48,974 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:48,975 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:56:48,983 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:48,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:56:48,992 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:48,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:56:48,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 00:56:48,995 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 00:56:48,995 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005851622] [2021-08-13 00:56:48,995 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005851622] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 00:56:48,995 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 00:56:48,995 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-08-13 00:56:48,995 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890139137] [2021-08-13 00:56:48,995 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-08-13 00:56:48,995 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 00:56:48,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-13 00:56:48,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2021-08-13 00:56:48,997 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 104 [2021-08-13 00:56:48,997 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 1172 transitions, 16417 flow. Second operand has 13 states, 13 states have (on average 82.07692307692308) internal successors, (1067), 13 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:56:48,997 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 00:56:48,997 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 104 [2021-08-13 00:56:48,998 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 00:56:54,822 INFO L129 PetriNetUnfolder]: 11566/34308 cut-off events. [2021-08-13 00:56:54,822 INFO L130 PetriNetUnfolder]: For 32171/45648 co-relation queries the response was YES. [2021-08-13 00:56:54,963 INFO L84 FinitePrefix]: Finished finitePrefix Result has 141666 conditions, 34308 events. 11566/34308 cut-off events. For 32171/45648 co-relation queries the response was YES. Maximal size of possible extension queue 2150. Compared 466868 event pairs, 936 based on Foata normal form. 466/34554 useless extension candidates. Maximal degree in co-relation 141579. Up to 15491 conditions per place. [2021-08-13 00:56:54,993 INFO L132 encePairwiseOnDemand]: 90/104 looper letters, 38 selfloop transitions, 20 changer transitions 1396/1528 dead transitions. [2021-08-13 00:56:54,994 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 1528 transitions, 24647 flow [2021-08-13 00:56:54,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-13 00:56:54,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-08-13 00:56:54,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1534 transitions. [2021-08-13 00:56:54,996 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8194444444444444 [2021-08-13 00:56:54,996 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1534 transitions. [2021-08-13 00:56:54,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1534 transitions. [2021-08-13 00:56:54,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 00:56:54,997 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1534 transitions. [2021-08-13 00:56:54,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 85.22222222222223) internal successors, (1534), 18 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:56:55,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 104.0) internal successors, (1976), 19 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:56:55,002 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 104.0) internal successors, (1976), 19 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:56:55,002 INFO L348 CegarLoopForPetriNet]: 109 programPoint places, 104 predicate places. [2021-08-13 00:56:55,002 INFO L482 AbstractCegarLoop]: Abstraction has has 213 places, 1528 transitions, 24647 flow [2021-08-13 00:56:55,002 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 82.07692307692308) internal successors, (1067), 13 states have internal predecessors, (1067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:56:55,002 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 00:56:55,002 INFO L266 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] [2021-08-13 00:56:55,002 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-13 00:56:55,003 INFO L430 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 00:56:55,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 00:56:55,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1455564328, now seen corresponding path program 1 times [2021-08-13 00:56:55,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 00:56:55,003 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714462841] [2021-08-13 00:56:55,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 00:56:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 00:56:55,064 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:55,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:56:55,064 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:55,065 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 00:56:55,067 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:55,067 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 00:56:55,071 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:55,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 00:56:55,077 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:55,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 00:56:55,085 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:55,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-08-13 00:56:55,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:55,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 00:56:55,114 INFO L142 QuantifierPusher]: treesize reduction 37, result has 45.6 percent of original size [2021-08-13 00:56:55,114 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-08-13 00:56:55,130 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 00:56:55,130 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 00:56:55,142 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:55,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:56:55,151 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:55,151 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:56:55,160 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:56:55,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:56:55,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 00:56:55,161 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 00:56:55,161 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714462841] [2021-08-13 00:56:55,161 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714462841] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 00:56:55,161 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 00:56:55,161 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-13 00:56:55,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62231116] [2021-08-13 00:56:55,162 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-08-13 00:56:55,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 00:56:55,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-13 00:56:55,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-08-13 00:56:55,162 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 104 [2021-08-13 00:56:55,163 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 1528 transitions, 24647 flow. Second operand has 12 states, 12 states have (on average 83.16666666666667) internal successors, (998), 12 states have internal predecessors, (998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:56:55,163 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 00:56:55,163 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 104 [2021-08-13 00:56:55,163 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 00:57:02,121 INFO L129 PetriNetUnfolder]: 11652/34766 cut-off events. [2021-08-13 00:57:02,121 INFO L130 PetriNetUnfolder]: For 38375/52352 co-relation queries the response was YES. [2021-08-13 00:57:02,254 INFO L84 FinitePrefix]: Finished finitePrefix Result has 160515 conditions, 34766 events. 11652/34766 cut-off events. For 38375/52352 co-relation queries the response was YES. Maximal size of possible extension queue 2183. Compared 475514 event pairs, 919 based on Foata normal form. 186/34741 useless extension candidates. Maximal degree in co-relation 160421. Up to 15691 conditions per place. [2021-08-13 00:57:02,283 INFO L132 encePairwiseOnDemand]: 94/104 looper letters, 42 selfloop transitions, 10 changer transitions 1446/1573 dead transitions. [2021-08-13 00:57:02,284 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 1573 transitions, 28217 flow [2021-08-13 00:57:02,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-13 00:57:02,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-13 00:57:02,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1129 transitions. [2021-08-13 00:57:02,286 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8350591715976331 [2021-08-13 00:57:02,286 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1129 transitions. [2021-08-13 00:57:02,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1129 transitions. [2021-08-13 00:57:02,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 00:57:02,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1129 transitions. [2021-08-13 00:57:02,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 86.84615384615384) internal successors, (1129), 13 states have internal predecessors, (1129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:57:02,290 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 104.0) internal successors, (1456), 14 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:57:02,290 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 104.0) internal successors, (1456), 14 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:57:02,290 INFO L348 CegarLoopForPetriNet]: 109 programPoint places, 116 predicate places. [2021-08-13 00:57:02,290 INFO L482 AbstractCegarLoop]: Abstraction has has 225 places, 1573 transitions, 28217 flow [2021-08-13 00:57:02,290 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 83.16666666666667) internal successors, (998), 12 states have internal predecessors, (998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:57:02,290 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 00:57:02,290 INFO L266 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] [2021-08-13 00:57:02,291 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-13 00:57:02,291 INFO L430 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 00:57:02,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 00:57:02,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1612315373, now seen corresponding path program 1 times [2021-08-13 00:57:02,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 00:57:02,291 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930650434] [2021-08-13 00:57:02,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 00:57:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 00:57:02,340 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:57:02,340 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:57:02,341 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:57:02,341 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 00:57:02,343 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:57:02,343 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 00:57:02,347 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:57:02,347 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 00:57:02,352 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:57:02,352 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-08-13 00:57:02,359 INFO L142 QuantifierPusher]: treesize reduction 10, result has 84.8 percent of original size [2021-08-13 00:57:02,360 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 56 [2021-08-13 00:57:02,381 INFO L142 QuantifierPusher]: treesize reduction 7, result has 75.0 percent of original size [2021-08-13 00:57:02,382 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-08-13 00:57:02,395 INFO L142 QuantifierPusher]: treesize reduction 31, result has 75.2 percent of original size [2021-08-13 00:57:02,395 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 94 [2021-08-13 00:57:02,415 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 00:57:02,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 00:57:02,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:57:02,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:57:02,435 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:57:02,436 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:57:02,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:57:02,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:57:02,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 00:57:02,448 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 00:57:02,448 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930650434] [2021-08-13 00:57:02,448 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930650434] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 00:57:02,448 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 00:57:02,448 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-08-13 00:57:02,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406926987] [2021-08-13 00:57:02,448 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-08-13 00:57:02,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 00:57:02,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-13 00:57:02,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-08-13 00:57:02,449 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 104 [2021-08-13 00:57:02,450 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 1573 transitions, 28217 flow. Second operand has 12 states, 12 states have (on average 82.25) internal successors, (987), 12 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:57:02,450 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 00:57:02,450 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 104 [2021-08-13 00:57:02,450 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 00:57:10,211 INFO L129 PetriNetUnfolder]: 11864/35729 cut-off events. [2021-08-13 00:57:10,211 INFO L130 PetriNetUnfolder]: For 46384/62177 co-relation queries the response was YES. [2021-08-13 00:57:10,453 INFO L84 FinitePrefix]: Finished finitePrefix Result has 182118 conditions, 35729 events. 11864/35729 cut-off events. For 46384/62177 co-relation queries the response was YES. Maximal size of possible extension queue 2253. Compared 492787 event pairs, 761 based on Foata normal form. 477/36050 useless extension candidates. Maximal degree in co-relation 182016. Up to 16116 conditions per place. [2021-08-13 00:57:10,483 INFO L132 encePairwiseOnDemand]: 92/104 looper letters, 38 selfloop transitions, 18 changer transitions 1899/2029 dead transitions. [2021-08-13 00:57:10,483 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 2029 transitions, 40887 flow [2021-08-13 00:57:10,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-08-13 00:57:10,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-08-13 00:57:10,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1453 transitions. [2021-08-13 00:57:10,484 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8218325791855203 [2021-08-13 00:57:10,484 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1453 transitions. [2021-08-13 00:57:10,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1453 transitions. [2021-08-13 00:57:10,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 00:57:10,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1453 transitions. [2021-08-13 00:57:10,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 85.47058823529412) internal successors, (1453), 17 states have internal predecessors, (1453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:57:10,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 104.0) internal successors, (1872), 18 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:57:10,489 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 104.0) internal successors, (1872), 18 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:57:10,489 INFO L348 CegarLoopForPetriNet]: 109 programPoint places, 132 predicate places. [2021-08-13 00:57:10,489 INFO L482 AbstractCegarLoop]: Abstraction has has 241 places, 2029 transitions, 40887 flow [2021-08-13 00:57:10,490 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 82.25) internal successors, (987), 12 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:57:10,490 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 00:57:10,490 INFO L266 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] [2021-08-13 00:57:10,490 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-13 00:57:10,490 INFO L430 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 00:57:10,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 00:57:10,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1638932159, now seen corresponding path program 1 times [2021-08-13 00:57:10,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 00:57:10,490 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945262564] [2021-08-13 00:57:10,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 00:57:10,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 00:57:10,548 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:57:10,548 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:57:10,548 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:57:10,548 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 00:57:10,551 INFO L142 QuantifierPusher]: treesize reduction 37, result has 38.3 percent of original size [2021-08-13 00:57:10,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 00:57:10,557 INFO L142 QuantifierPusher]: treesize reduction 37, result has 52.6 percent of original size [2021-08-13 00:57:10,557 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-08-13 00:57:10,574 INFO L142 QuantifierPusher]: treesize reduction 37, result has 54.3 percent of original size [2021-08-13 00:57:10,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-08-13 00:57:10,593 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 00:57:10,593 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 00:57:10,604 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:57:10,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:57:10,610 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:57:10,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:57:10,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:57:10,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:57:10,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 00:57:10,618 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 00:57:10,618 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945262564] [2021-08-13 00:57:10,618 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945262564] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 00:57:10,618 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 00:57:10,618 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-13 00:57:10,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671210713] [2021-08-13 00:57:10,618 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-13 00:57:10,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 00:57:10,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-13 00:57:10,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-08-13 00:57:10,619 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 104 [2021-08-13 00:57:10,620 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 2029 transitions, 40887 flow. Second operand has 8 states, 8 states have (on average 86.5) internal successors, (692), 8 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:57:10,620 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 00:57:10,620 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 104 [2021-08-13 00:57:10,620 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 00:57:22,615 INFO L129 PetriNetUnfolder]: 14315/43791 cut-off events. [2021-08-13 00:57:22,616 INFO L130 PetriNetUnfolder]: For 65203/85771 co-relation queries the response was YES. [2021-08-13 00:57:22,816 INFO L84 FinitePrefix]: Finished finitePrefix Result has 244490 conditions, 43791 events. 14315/43791 cut-off events. For 65203/85771 co-relation queries the response was YES. Maximal size of possible extension queue 2885. Compared 626328 event pairs, 442 based on Foata normal form. 439/44107 useless extension candidates. Maximal degree in co-relation 244383. Up to 20046 conditions per place. [2021-08-13 00:57:22,856 INFO L132 encePairwiseOnDemand]: 94/104 looper letters, 43 selfloop transitions, 18 changer transitions 2439/2577 dead transitions. [2021-08-13 00:57:22,856 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 2577 transitions, 57445 flow [2021-08-13 00:57:22,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-13 00:57:22,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-08-13 00:57:22,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 996 transitions. [2021-08-13 00:57:22,858 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8706293706293706 [2021-08-13 00:57:22,858 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 996 transitions. [2021-08-13 00:57:22,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 996 transitions. [2021-08-13 00:57:22,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 00:57:22,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 996 transitions. [2021-08-13 00:57:22,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 90.54545454545455) internal successors, (996), 11 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:57:22,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 104.0) internal successors, (1248), 12 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:57:22,861 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 104.0) internal successors, (1248), 12 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:57:22,861 INFO L348 CegarLoopForPetriNet]: 109 programPoint places, 142 predicate places. [2021-08-13 00:57:22,861 INFO L482 AbstractCegarLoop]: Abstraction has has 251 places, 2577 transitions, 57445 flow [2021-08-13 00:57:22,861 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 86.5) internal successors, (692), 8 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:57:22,861 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 00:57:22,862 INFO L266 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] [2021-08-13 00:57:22,862 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-13 00:57:22,862 INFO L430 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 00:57:22,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 00:57:22,862 INFO L82 PathProgramCache]: Analyzing trace with hash 677242540, now seen corresponding path program 1 times [2021-08-13 00:57:22,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 00:57:22,862 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040761291] [2021-08-13 00:57:22,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 00:57:22,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 00:57:22,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:57:22,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:57:22,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:57:22,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 00:57:22,900 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 00:57:22,900 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 00:57:22,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:57:22,911 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 00:57:22,917 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 00:57:22,917 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:57:22,923 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:57:22,924 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:57:22,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 00:57:22,925 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 00:57:22,925 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040761291] [2021-08-13 00:57:22,925 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040761291] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 00:57:22,925 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 00:57:22,925 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-13 00:57:22,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395154146] [2021-08-13 00:57:22,925 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-08-13 00:57:22,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 00:57:22,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-13 00:57:22,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-13 00:57:22,926 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 104 [2021-08-13 00:57:22,927 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 2577 transitions, 57445 flow. Second operand has 6 states, 6 states have (on average 91.16666666666667) internal successors, (547), 6 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:57:22,927 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 00:57:22,927 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 104 [2021-08-13 00:57:22,927 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 00:57:30,750 INFO L129 PetriNetUnfolder]: 4958/17002 cut-off events. [2021-08-13 00:57:30,750 INFO L130 PetriNetUnfolder]: For 28051/32802 co-relation queries the response was YES. [2021-08-13 00:57:30,813 INFO L84 FinitePrefix]: Finished finitePrefix Result has 82597 conditions, 17002 events. 4958/17002 cut-off events. For 28051/32802 co-relation queries the response was YES. Maximal size of possible extension queue 983. Compared 220016 event pairs, 732 based on Foata normal form. 79/16446 useless extension candidates. Maximal degree in co-relation 82487. Up to 6528 conditions per place. [2021-08-13 00:57:30,835 INFO L132 encePairwiseOnDemand]: 94/104 looper letters, 24 selfloop transitions, 17 changer transitions 856/1120 dead transitions. [2021-08-13 00:57:30,835 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 1120 transitions, 22873 flow [2021-08-13 00:57:30,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-13 00:57:30,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-08-13 00:57:30,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 943 transitions. [2021-08-13 00:57:30,836 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9067307692307692 [2021-08-13 00:57:30,836 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 943 transitions. [2021-08-13 00:57:30,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 943 transitions. [2021-08-13 00:57:30,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 00:57:30,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 943 transitions. [2021-08-13 00:57:30,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 94.3) internal successors, (943), 10 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:57:30,839 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 104.0) internal successors, (1144), 11 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:57:30,839 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 104.0) internal successors, (1144), 11 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:57:30,839 INFO L348 CegarLoopForPetriNet]: 109 programPoint places, 142 predicate places. [2021-08-13 00:57:30,839 INFO L482 AbstractCegarLoop]: Abstraction has has 251 places, 1120 transitions, 22873 flow [2021-08-13 00:57:30,840 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 91.16666666666667) internal successors, (547), 6 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:57:30,840 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 00:57:30,840 INFO L266 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] [2021-08-13 00:57:30,840 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-13 00:57:30,840 INFO L430 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 00:57:30,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 00:57:30,840 INFO L82 PathProgramCache]: Analyzing trace with hash 778330415, now seen corresponding path program 1 times [2021-08-13 00:57:30,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 00:57:30,840 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205302076] [2021-08-13 00:57:30,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 00:57:30,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 00:57:30,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:57:30,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:57:30,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:57:30,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 00:57:30,872 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:57:30,872 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 00:57:30,875 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 00:57:30,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 00:57:30,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:57:30,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 00:57:30,890 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 00:57:30,891 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:57:30,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:57:30,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:57:30,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 00:57:30,896 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 00:57:30,897 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205302076] [2021-08-13 00:57:30,897 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205302076] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 00:57:30,897 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 00:57:30,897 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-13 00:57:30,897 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985878299] [2021-08-13 00:57:30,897 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-08-13 00:57:30,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 00:57:30,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-13 00:57:30,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-13 00:57:30,898 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 104 [2021-08-13 00:57:30,899 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 1120 transitions, 22873 flow. Second operand has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:57:30,899 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 00:57:30,899 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 104 [2021-08-13 00:57:30,899 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 00:57:32,302 INFO L129 PetriNetUnfolder]: 1652/5537 cut-off events. [2021-08-13 00:57:32,302 INFO L130 PetriNetUnfolder]: For 6040/10264 co-relation queries the response was YES. [2021-08-13 00:57:32,324 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20355 conditions, 5537 events. 1652/5537 cut-off events. For 6040/10264 co-relation queries the response was YES. Maximal size of possible extension queue 643. Compared 60503 event pairs, 92 based on Foata normal form. 676/5806 useless extension candidates. Maximal degree in co-relation 20242. Up to 1111 conditions per place. [2021-08-13 00:57:32,332 INFO L132 encePairwiseOnDemand]: 94/104 looper letters, 22 selfloop transitions, 44 changer transitions 206/397 dead transitions. [2021-08-13 00:57:32,332 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 397 transitions, 5925 flow [2021-08-13 00:57:32,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-13 00:57:32,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-08-13 00:57:32,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1227 transitions. [2021-08-13 00:57:32,333 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.9075443786982249 [2021-08-13 00:57:32,333 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1227 transitions. [2021-08-13 00:57:32,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1227 transitions. [2021-08-13 00:57:32,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 00:57:32,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1227 transitions. [2021-08-13 00:57:32,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 94.38461538461539) internal successors, (1227), 13 states have internal predecessors, (1227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:57:32,336 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 104.0) internal successors, (1456), 14 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:57:32,336 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 104.0) internal successors, (1456), 14 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:57:32,336 INFO L348 CegarLoopForPetriNet]: 109 programPoint places, 109 predicate places. [2021-08-13 00:57:32,336 INFO L482 AbstractCegarLoop]: Abstraction has has 218 places, 397 transitions, 5925 flow [2021-08-13 00:57:32,337 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:57:32,337 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 00:57:32,337 INFO L266 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] [2021-08-13 00:57:32,337 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-13 00:57:32,337 INFO L430 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 00:57:32,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 00:57:32,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1005801976, now seen corresponding path program 1 times [2021-08-13 00:57:32,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 00:57:32,337 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874980220] [2021-08-13 00:57:32,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 00:57:32,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 00:57:32,371 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:57:32,371 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:57:32,371 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:57:32,371 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 00:57:32,373 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:57:32,373 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 00:57:32,376 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:57:32,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 00:57:32,379 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-08-13 00:57:32,379 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-08-13 00:57:32,390 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:57:32,390 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 00:57:32,396 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-08-13 00:57:32,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:57:32,402 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:57:32,402 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:57:32,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 00:57:32,402 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 00:57:32,403 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874980220] [2021-08-13 00:57:32,403 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874980220] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 00:57:32,403 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 00:57:32,403 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-13 00:57:32,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514382790] [2021-08-13 00:57:32,403 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-08-13 00:57:32,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 00:57:32,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-13 00:57:32,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-13 00:57:32,404 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 104 [2021-08-13 00:57:32,404 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 397 transitions, 5925 flow. Second operand has 8 states, 8 states have (on average 91.125) internal successors, (729), 8 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:57:32,404 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 00:57:32,404 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 104 [2021-08-13 00:57:32,404 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 00:57:33,108 INFO L129 PetriNetUnfolder]: 1338/4047 cut-off events. [2021-08-13 00:57:33,108 INFO L130 PetriNetUnfolder]: For 3260/8795 co-relation queries the response was YES. [2021-08-13 00:57:33,124 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14199 conditions, 4047 events. 1338/4047 cut-off events. For 3260/8795 co-relation queries the response was YES. Maximal size of possible extension queue 644. Compared 44498 event pairs, 6 based on Foata normal form. 763/4458 useless extension candidates. Maximal degree in co-relation 14083. Up to 1041 conditions per place. [2021-08-13 00:57:33,129 INFO L132 encePairwiseOnDemand]: 94/104 looper letters, 19 selfloop transitions, 48 changer transitions 94/250 dead transitions. [2021-08-13 00:57:33,129 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 250 transitions, 2477 flow [2021-08-13 00:57:33,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-08-13 00:57:33,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-08-13 00:57:33,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1496 transitions. [2021-08-13 00:57:33,130 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.8990384615384616 [2021-08-13 00:57:33,131 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1496 transitions. [2021-08-13 00:57:33,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1496 transitions. [2021-08-13 00:57:33,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 00:57:33,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1496 transitions. [2021-08-13 00:57:33,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 93.5) internal successors, (1496), 16 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:57:33,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 104.0) internal successors, (1768), 17 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:57:33,134 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 104.0) internal successors, (1768), 17 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:57:33,134 INFO L348 CegarLoopForPetriNet]: 109 programPoint places, 100 predicate places. [2021-08-13 00:57:33,134 INFO L482 AbstractCegarLoop]: Abstraction has has 209 places, 250 transitions, 2477 flow [2021-08-13 00:57:33,134 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 91.125) internal successors, (729), 8 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:57:33,134 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 00:57:33,134 INFO L266 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] [2021-08-13 00:57:33,134 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-13 00:57:33,134 INFO L430 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 00:57:33,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 00:57:33,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1728097101, now seen corresponding path program 1 times [2021-08-13 00:57:33,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 00:57:33,135 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346357739] [2021-08-13 00:57:33,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 00:57:33,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-13 00:57:33,190 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:57:33,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:57:33,191 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:57:33,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-08-13 00:57:33,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:57:33,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-08-13 00:57:33,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:57:33,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-08-13 00:57:33,204 INFO L142 QuantifierPusher]: treesize reduction 9, result has 75.0 percent of original size [2021-08-13 00:57:33,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-08-13 00:57:33,217 INFO L142 QuantifierPusher]: treesize reduction 37, result has 50.7 percent of original size [2021-08-13 00:57:33,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-08-13 00:57:33,239 INFO L142 QuantifierPusher]: treesize reduction 37, result has 53.2 percent of original size [2021-08-13 00:57:33,239 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-08-13 00:57:33,265 INFO L142 QuantifierPusher]: treesize reduction 37, result has 54.3 percent of original size [2021-08-13 00:57:33,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-08-13 00:57:33,295 INFO L142 QuantifierPusher]: treesize reduction 4, result has 81.0 percent of original size [2021-08-13 00:57:33,295 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-08-13 00:57:33,312 INFO L142 QuantifierPusher]: treesize reduction 140, result has 18.6 percent of original size [2021-08-13 00:57:33,315 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-08-13 00:57:33,334 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-08-13 00:57:33,334 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-08-13 00:57:33,348 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:57:33,348 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:57:33,356 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:57:33,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-08-13 00:57:33,366 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-08-13 00:57:33,366 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-08-13 00:57:33,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-13 00:57:33,366 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-13 00:57:33,367 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346357739] [2021-08-13 00:57:33,367 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346357739] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-13 00:57:33,367 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-13 00:57:33,367 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-08-13 00:57:33,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419036234] [2021-08-13 00:57:33,367 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-08-13 00:57:33,367 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-13 00:57:33,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-08-13 00:57:33,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-08-13 00:57:33,368 INFO L513 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 104 [2021-08-13 00:57:33,369 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 250 transitions, 2477 flow. Second operand has 14 states, 14 states have (on average 79.5) internal successors, (1113), 14 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:57:33,369 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-08-13 00:57:33,369 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 104 [2021-08-13 00:57:33,369 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-08-13 00:57:34,189 INFO L129 PetriNetUnfolder]: 2799/7910 cut-off events. [2021-08-13 00:57:34,189 INFO L130 PetriNetUnfolder]: For 5525/8975 co-relation queries the response was YES. [2021-08-13 00:57:34,225 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27698 conditions, 7910 events. 2799/7910 cut-off events. For 5525/8975 co-relation queries the response was YES. Maximal size of possible extension queue 1203. Compared 94548 event pairs, 0 based on Foata normal form. 72/7385 useless extension candidates. Maximal degree in co-relation 27571. Up to 2230 conditions per place. [2021-08-13 00:57:34,233 INFO L132 encePairwiseOnDemand]: 93/104 looper letters, 27 selfloop transitions, 10 changer transitions 168/321 dead transitions. [2021-08-13 00:57:34,233 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 321 transitions, 4427 flow [2021-08-13 00:57:34,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-13 00:57:34,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-08-13 00:57:34,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 904 transitions. [2021-08-13 00:57:34,234 INFO L558 CegarLoopForPetriNet]: DFA transition density 0.7902097902097902 [2021-08-13 00:57:34,234 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 904 transitions. [2021-08-13 00:57:34,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 904 transitions. [2021-08-13 00:57:34,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-13 00:57:34,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 904 transitions. [2021-08-13 00:57:34,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 82.18181818181819) internal successors, (904), 11 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:57:34,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 104.0) internal successors, (1248), 12 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:57:34,237 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 104.0) internal successors, (1248), 12 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:57:34,237 INFO L348 CegarLoopForPetriNet]: 109 programPoint places, 110 predicate places. [2021-08-13 00:57:34,237 INFO L482 AbstractCegarLoop]: Abstraction has has 219 places, 321 transitions, 4427 flow [2021-08-13 00:57:34,237 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 79.5) internal successors, (1113), 14 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-13 00:57:34,237 INFO L258 CegarLoopForPetriNet]: Found error trace [2021-08-13 00:57:34,237 INFO L266 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] [2021-08-13 00:57:34,237 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-13 00:57:34,237 INFO L430 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-08-13 00:57:34,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-13 00:57:34,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1614311059, now seen corresponding path program 2 times [2021-08-13 00:57:34,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-13 00:57:34,238 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232488545] [2021-08-13 00:57:34,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-13 00:57:34,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-13 00:57:34,265 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-13 00:57:34,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-13 00:57:34,291 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-13 00:57:34,315 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-13 00:57:34,316 INFO L651 BasicCegarLoop]: Counterexample might be feasible [2021-08-13 00:57:34,316 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-13 00:57:34,318 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-13 00:57:34,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.08 12:57:34 BasicIcfg [2021-08-13 00:57:34,408 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-13 00:57:34,408 INFO L168 Benchmark]: Toolchain (without parser) took 60917.40 ms. Allocated memory was 213.9 MB in the beginning and 4.6 GB in the end (delta: 4.4 GB). Free memory was 177.9 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.6 GB. Max. memory is 8.0 GB. [2021-08-13 00:57:34,408 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 213.9 MB. Free memory is still 195.7 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-13 00:57:34,409 INFO L168 Benchmark]: CACSL2BoogieTranslator took 431.35 ms. Allocated memory is still 213.9 MB. Free memory was 177.7 MB in the beginning and 175.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 17.6 MB. Max. memory is 8.0 GB. [2021-08-13 00:57:34,409 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.02 ms. Allocated memory is still 213.9 MB. Free memory was 175.8 MB in the beginning and 172.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-13 00:57:34,409 INFO L168 Benchmark]: Boogie Preprocessor took 23.19 ms. Allocated memory is still 213.9 MB. Free memory was 172.6 MB in the beginning and 170.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-13 00:57:34,409 INFO L168 Benchmark]: RCFGBuilder took 1463.80 ms. Allocated memory was 213.9 MB in the beginning and 256.9 MB in the end (delta: 43.0 MB). Free memory was 170.5 MB in the beginning and 109.1 MB in the end (delta: 61.5 MB). Peak memory consumption was 105.0 MB. Max. memory is 8.0 GB. [2021-08-13 00:57:34,409 INFO L168 Benchmark]: TraceAbstraction took 58948.99 ms. Allocated memory was 256.9 MB in the beginning and 4.6 GB in the end (delta: 4.3 GB). Free memory was 108.5 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.5 GB. Max. memory is 8.0 GB. [2021-08-13 00:57:34,409 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.12 ms. Allocated memory is still 213.9 MB. Free memory is still 195.7 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 431.35 ms. Allocated memory is still 213.9 MB. Free memory was 177.7 MB in the beginning and 175.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 17.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 46.02 ms. Allocated memory is still 213.9 MB. Free memory was 175.8 MB in the beginning and 172.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 23.19 ms. Allocated memory is still 213.9 MB. Free memory was 172.6 MB in the beginning and 170.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1463.80 ms. Allocated memory was 213.9 MB in the beginning and 256.9 MB in the end (delta: 43.0 MB). Free memory was 170.5 MB in the beginning and 109.1 MB in the end (delta: 61.5 MB). Peak memory consumption was 105.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 58948.99 ms. Allocated memory was 256.9 MB in the beginning and 4.6 GB in the end (delta: 4.3 GB). Free memory was 108.5 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.5 GB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L718] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L719] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L720] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L721] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L722] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L723] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L724] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0] [L725] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0] [L726] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L727] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L728] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L729] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L730] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L731] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L732] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L733] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L813] 0 pthread_t t2177; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L814] FCALL, FORK 0 pthread_create(&t2177, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L815] 0 pthread_t t2178; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L816] FCALL, FORK 0 pthread_create(&t2178, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0: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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L817] 0 pthread_t t2179; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0: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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L818] FCALL, FORK 0 pthread_create(&t2179, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L739] 1 y$w_buff1 = y$w_buff0 [L740] 1 y$w_buff0 = 2 [L741] 1 y$w_buff1_used = y$w_buff0_used [L742] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L744] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L785] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L771] 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) [L771] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L771] 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) [L771] 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) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] 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 [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 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 [L788] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L791] 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) [L791] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L791] 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) [L791] 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) [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] 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 [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L795] 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 [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L824] 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) [L824] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L824] 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) [L824] 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) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L826] 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 [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 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 [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] 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) [L835] 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) [L836] 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)) [L836] 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)) [L837] 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)) [L837] 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)) [L838] 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)) [L838] 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)) [L839] 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)) [L839] 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)) [L840] 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)) [L840] 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)) [L841] 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)) [L841] 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)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L843] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0: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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0: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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0: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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 130 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 10.9ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 58786.1ms, OverallIterations: 17, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 56208.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 63.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 221 SDtfs, 792 SDslu, 827 SDs, 0 SdLazy, 1608 SolverSat, 317 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1276.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 259 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 2578.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=57445occurred in iteration=12, InterpolantAutomatonStates: 206, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 49.7ms SsaConstructionTime, 473.4ms SatisfiabilityAnalysisTime, 1759.1ms InterpolantComputationTime, 1206 NumberOfCodeBlocks, 1206 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1110 ConstructedInterpolants, 0 QuantifiedInterpolants, 6568 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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! Received shutdown request...