/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe013_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-7cd14b8b9f04096d8ddfd3d9cd8a4ac590fe5404-7cd14b8 [2021-03-11 20:23:14,392 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-11 20:23:14,394 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-11 20:23:14,423 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-11 20:23:14,423 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-11 20:23:14,426 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-11 20:23:14,428 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-11 20:23:14,432 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-11 20:23:14,434 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-11 20:23:14,437 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-11 20:23:14,437 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-11 20:23:14,438 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-11 20:23:14,439 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-11 20:23:14,440 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-11 20:23:14,441 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-11 20:23:14,442 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-11 20:23:14,444 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-11 20:23:14,445 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-11 20:23:14,447 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-11 20:23:14,453 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-11 20:23:14,454 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-11 20:23:14,455 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-11 20:23:14,456 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-11 20:23:14,457 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-11 20:23:14,462 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-11 20:23:14,462 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-11 20:23:14,462 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-11 20:23:14,463 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-11 20:23:14,464 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-11 20:23:14,464 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-11 20:23:14,464 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-11 20:23:14,465 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-11 20:23:14,466 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-11 20:23:14,467 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-11 20:23:14,467 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-11 20:23:14,468 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-11 20:23:14,468 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-11 20:23:14,468 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-11 20:23:14,468 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-11 20:23:14,469 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-11 20:23:14,469 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-11 20:23:14,472 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-SemanticLbe.epf [2021-03-11 20:23:14,500 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-11 20:23:14,500 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-11 20:23:14,503 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-11 20:23:14,503 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-11 20:23:14,503 INFO L138 SettingsManager]: * Use SBE=true [2021-03-11 20:23:14,503 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-11 20:23:14,503 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-11 20:23:14,504 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-11 20:23:14,504 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-11 20:23:14,504 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-11 20:23:14,505 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-11 20:23:14,505 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-11 20:23:14,505 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-11 20:23:14,505 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-11 20:23:14,505 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-11 20:23:14,505 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-11 20:23:14,505 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-11 20:23:14,505 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-11 20:23:14,506 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-11 20:23:14,506 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-11 20:23:14,506 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-11 20:23:14,506 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-11 20:23:14,506 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-11 20:23:14,506 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-11 20:23:14,507 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-11 20:23:14,507 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-11 20:23:14,507 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-11 20:23:14,507 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-11 20:23:14,507 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-03-11 20:23:14,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-11 20:23:14,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-11 20:23:14,755 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-11 20:23:14,756 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-11 20:23:14,759 INFO L275 PluginConnector]: CDTParser initialized [2021-03-11 20:23:14,760 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe013_power.oepc.i [2021-03-11 20:23:14,802 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fabaa612/8fb9a711e7634e27b9c4188c4d25bd59/FLAGffc74aef6 [2021-03-11 20:23:15,484 INFO L306 CDTParser]: Found 1 translation units. [2021-03-11 20:23:15,485 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe013_power.oepc.i [2021-03-11 20:23:15,497 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fabaa612/8fb9a711e7634e27b9c4188c4d25bd59/FLAGffc74aef6 [2021-03-11 20:23:15,829 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fabaa612/8fb9a711e7634e27b9c4188c4d25bd59 [2021-03-11 20:23:15,831 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-11 20:23:15,834 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-11 20:23:15,835 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-11 20:23:15,835 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-11 20:23:15,837 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-11 20:23:15,837 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:23:15" (1/1) ... [2021-03-11 20:23:15,838 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b363861 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:23:15, skipping insertion in model container [2021-03-11 20:23:15,838 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 08:23:15" (1/1) ... [2021-03-11 20:23:15,842 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-11 20:23:15,882 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-11 20:23:16,020 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe013_power.oepc.i[995,1008] [2021-03-11 20:23:16,198 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:23:16,206 INFO L203 MainTranslator]: Completed pre-run [2021-03-11 20:23:16,222 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe013_power.oepc.i[995,1008] [2021-03-11 20:23:16,260 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-11 20:23:16,307 INFO L208 MainTranslator]: Completed translation [2021-03-11 20:23:16,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:23:16 WrapperNode [2021-03-11 20:23:16,308 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-11 20:23:16,309 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-11 20:23:16,309 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-11 20:23:16,309 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-11 20:23:16,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:23:16" (1/1) ... [2021-03-11 20:23:16,341 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:23:16" (1/1) ... [2021-03-11 20:23:16,360 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-11 20:23:16,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-11 20:23:16,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-11 20:23:16,360 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-11 20:23:16,373 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:23:16" (1/1) ... [2021-03-11 20:23:16,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:23:16" (1/1) ... [2021-03-11 20:23:16,377 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:23:16" (1/1) ... [2021-03-11 20:23:16,377 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:23:16" (1/1) ... [2021-03-11 20:23:16,383 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:23:16" (1/1) ... [2021-03-11 20:23:16,386 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:23:16" (1/1) ... [2021-03-11 20:23:16,388 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:23:16" (1/1) ... [2021-03-11 20:23:16,391 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-11 20:23:16,391 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-11 20:23:16,391 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-11 20:23:16,391 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-11 20:23:16,392 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:23:16" (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-03-11 20:23:16,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-11 20:23:16,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-11 20:23:16,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-11 20:23:16,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-11 20:23:16,449 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-11 20:23:16,449 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-11 20:23:16,449 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-11 20:23:16,450 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-11 20:23:16,450 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-11 20:23:16,450 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-11 20:23:16,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-11 20:23:16,450 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-11 20:23:16,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-11 20:23:16,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-11 20:23:16,451 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-11 20:23:17,755 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-11 20:23:17,756 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-11 20:23:17,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:23:17 BoogieIcfgContainer [2021-03-11 20:23:17,757 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-11 20:23:17,758 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-11 20:23:17,759 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-11 20:23:17,760 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-11 20:23:17,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 08:23:15" (1/3) ... [2021-03-11 20:23:17,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57e76257 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:23:17, skipping insertion in model container [2021-03-11 20:23:17,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 08:23:16" (2/3) ... [2021-03-11 20:23:17,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57e76257 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 08:23:17, skipping insertion in model container [2021-03-11 20:23:17,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 08:23:17" (3/3) ... [2021-03-11 20:23:17,763 INFO L111 eAbstractionObserver]: Analyzing ICFG safe013_power.oepc.i [2021-03-11 20:23:17,767 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-11 20:23:17,770 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-11 20:23:17,771 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-11 20:23:17,801 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,802 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,802 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,802 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,802 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,802 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,802 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,802 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,802 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,802 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,802 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,802 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,802 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,803 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,803 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,803 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,803 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,803 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,803 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,803 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,803 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,803 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,803 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,803 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,803 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,804 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,804 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,804 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,804 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,804 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,805 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,805 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,805 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,805 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,805 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,805 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,805 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,806 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,806 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,806 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,806 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,806 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,807 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,807 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,807 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,807 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,808 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,808 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,808 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,808 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,808 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,808 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,808 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,808 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,809 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,809 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,809 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,809 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,809 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,809 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,809 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,809 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,809 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,809 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,809 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,809 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,809 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,810 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,810 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,810 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,810 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,810 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,810 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,810 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,810 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,810 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,810 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,810 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,811 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,811 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,811 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,811 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,811 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,811 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,813 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,813 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,814 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,814 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,814 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,814 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,814 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,814 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,814 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,814 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,814 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,814 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,814 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,814 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,815 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,815 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,816 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,817 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,817 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,817 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,817 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,817 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,818 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,818 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,818 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,818 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,818 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,818 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,818 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,818 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,818 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,819 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,819 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,819 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,819 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,820 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,820 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,820 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,820 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,820 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,821 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,821 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,822 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,822 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,822 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,822 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,822 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,822 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,822 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,822 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,822 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,824 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,824 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,824 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,824 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,825 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,825 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,826 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,826 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,826 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-11 20:23:17,827 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-11 20:23:17,838 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-11 20:23:17,851 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-11 20:23:17,851 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-11 20:23:17,851 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-11 20:23:17,851 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-11 20:23:17,851 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-11 20:23:17,851 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-11 20:23:17,851 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-11 20:23:17,851 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-11 20:23:17,858 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2021-03-11 20:23:17,881 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-11 20:23:17,882 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:23:17,886 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-03-11 20:23:17,886 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 97 transitions, 209 flow [2021-03-11 20:23:17,889 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 94 transitions, 197 flow [2021-03-11 20:23:17,891 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-11 20:23:17,897 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-11 20:23:17,898 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-11 20:23:17,899 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 197 flow [2021-03-11 20:23:17,910 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-11 20:23:17,911 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:23:17,911 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-03-11 20:23:17,913 INFO L116 LiptonReduction]: Number of co-enabled transitions 1586 [2021-03-11 20:23:18,640 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-11 20:23:19,005 WARN L205 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-11 20:23:19,108 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-11 20:23:19,919 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-11 20:23:20,034 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-11 20:23:21,581 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-11 20:23:21,690 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-11 20:23:21,834 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-11 20:23:21,945 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-11 20:23:22,212 WARN L205 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 112 [2021-03-11 20:23:22,338 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-11 20:23:22,588 WARN L205 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 112 [2021-03-11 20:23:22,755 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-03-11 20:23:22,757 INFO L131 LiptonReduction]: Checked pairs total: 3949 [2021-03-11 20:23:22,757 INFO L133 LiptonReduction]: Total number of compositions: 82 [2021-03-11 20:23:22,758 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4869 [2021-03-11 20:23:22,768 INFO L129 PetriNetUnfolder]: 0/7 cut-off events. [2021-03-11 20:23:22,768 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:23:22,769 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:23:22,769 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2021-03-11 20:23:22,769 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:23:22,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:23:22,772 INFO L82 PathProgramCache]: Analyzing trace with hash 928806256, now seen corresponding path program 1 times [2021-03-11 20:23:22,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:23:22,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916481311] [2021-03-11 20:23:22,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:23:22,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:23:22,946 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:23:22,947 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:23:22,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:23:22,954 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916481311] [2021-03-11 20:23:22,954 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:23:22,954 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-11 20:23:22,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693709039] [2021-03-11 20:23:22,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-11 20:23:22,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:23:22,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-11 20:23:22,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-11 20:23:22,972 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 179 [2021-03-11 20:23:22,977 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 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-03-11 20:23:22,977 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:23:22,977 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 179 [2021-03-11 20:23:22,977 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:23:23,046 INFO L129 PetriNetUnfolder]: 29/103 cut-off events. [2021-03-11 20:23:23,046 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:23:23,048 INFO L84 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 103 events. 29/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 407 event pairs, 15 based on Foata normal form. 11/98 useless extension candidates. Maximal degree in co-relation 157. Up to 41 conditions per place. [2021-03-11 20:23:23,049 INFO L132 encePairwiseOnDemand]: 175/179 looper letters, 7 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2021-03-11 20:23:23,049 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 25 transitions, 77 flow [2021-03-11 20:23:23,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-11 20:23:23,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-11 20:23:23,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 465 transitions. [2021-03-11 20:23:23,063 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8659217877094972 [2021-03-11 20:23:23,064 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 465 transitions. [2021-03-11 20:23:23,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 465 transitions. [2021-03-11 20:23:23,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:23:23,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 465 transitions. [2021-03-11 20:23:23,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 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-03-11 20:23:23,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 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-03-11 20:23:23,080 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 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-03-11 20:23:23,081 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 57 flow. Second operand 3 states and 465 transitions. [2021-03-11 20:23:23,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 25 transitions, 77 flow [2021-03-11 20:23:23,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 25 transitions, 74 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-11 20:23:23,084 INFO L241 Difference]: Finished difference. Result has 31 places, 22 transitions, 54 flow [2021-03-11 20:23:23,086 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=31, PETRI_TRANSITIONS=22} [2021-03-11 20:23:23,086 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2021-03-11 20:23:23,086 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 54 flow [2021-03-11 20:23:23,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 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-03-11 20:23:23,087 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:23:23,087 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:23:23,087 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-11 20:23:23,087 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:23:23,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:23:23,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1146839567, now seen corresponding path program 1 times [2021-03-11 20:23:23,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:23:23,089 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062330465] [2021-03-11 20:23:23,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:23:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:23:23,153 INFO L142 QuantifierPusher]: treesize reduction 3, result has 81.3 percent of original size [2021-03-11 20:23:23,154 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:23:23,159 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 20:23:23,160 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:23:23,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:23:23,169 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062330465] [2021-03-11 20:23:23,169 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:23:23,169 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 20:23:23,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809538403] [2021-03-11 20:23:23,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:23:23,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:23:23,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:23:23,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:23:23,172 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 179 [2021-03-11 20:23:23,172 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 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-03-11 20:23:23,172 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:23:23,173 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 179 [2021-03-11 20:23:23,173 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:23:23,247 INFO L129 PetriNetUnfolder]: 51/141 cut-off events. [2021-03-11 20:23:23,247 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-11 20:23:23,248 INFO L84 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 141 events. 51/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 584 event pairs, 13 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 247. Up to 41 conditions per place. [2021-03-11 20:23:23,249 INFO L132 encePairwiseOnDemand]: 171/179 looper letters, 6 selfloop transitions, 5 changer transitions 12/37 dead transitions. [2021-03-11 20:23:23,250 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 130 flow [2021-03-11 20:23:23,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:23:23,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:23:23,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 715 transitions. [2021-03-11 20:23:23,252 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7988826815642458 [2021-03-11 20:23:23,252 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 715 transitions. [2021-03-11 20:23:23,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 715 transitions. [2021-03-11 20:23:23,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:23:23,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 715 transitions. [2021-03-11 20:23:23,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.0) internal successors, (715), 5 states have internal predecessors, (715), 0 states have call successors, (0), 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-03-11 20:23:23,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 0 states have call successors, (0), 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-03-11 20:23:23,256 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 0 states have call successors, (0), 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-03-11 20:23:23,257 INFO L185 Difference]: Start difference. First operand has 31 places, 22 transitions, 54 flow. Second operand 5 states and 715 transitions. [2021-03-11 20:23:23,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 130 flow [2021-03-11 20:23:23,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 37 transitions, 126 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-11 20:23:23,260 INFO L241 Difference]: Finished difference. Result has 36 places, 24 transitions, 87 flow [2021-03-11 20:23:23,260 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=87, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2021-03-11 20:23:23,260 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2021-03-11 20:23:23,260 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 87 flow [2021-03-11 20:23:23,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 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-03-11 20:23:23,261 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:23:23,261 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:23:23,261 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-11 20:23:23,261 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:23:23,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:23:23,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1192293050, now seen corresponding path program 1 times [2021-03-11 20:23:23,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:23:23,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979491264] [2021-03-11 20:23:23,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:23:23,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:23:23,309 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:23:23,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:23:23,312 INFO L142 QuantifierPusher]: treesize reduction 3, result has 81.3 percent of original size [2021-03-11 20:23:23,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:23:23,322 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 20:23:23,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:23:23,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:23:23,327 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979491264] [2021-03-11 20:23:23,327 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:23:23,327 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:23:23,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009693783] [2021-03-11 20:23:23,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:23:23,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:23:23,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:23:23,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:23:23,331 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 179 [2021-03-11 20:23:23,332 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 87 flow. Second operand has 5 states, 5 states have (on average 138.8) internal successors, (694), 5 states have internal predecessors, (694), 0 states have call successors, (0), 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-03-11 20:23:23,332 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:23:23,332 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 179 [2021-03-11 20:23:23,332 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:23:23,380 INFO L129 PetriNetUnfolder]: 18/89 cut-off events. [2021-03-11 20:23:23,381 INFO L130 PetriNetUnfolder]: For 65/94 co-relation queries the response was YES. [2021-03-11 20:23:23,381 INFO L84 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 89 events. 18/89 cut-off events. For 65/94 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 350 event pairs, 4 based on Foata normal form. 8/94 useless extension candidates. Maximal degree in co-relation 226. Up to 33 conditions per place. [2021-03-11 20:23:23,381 INFO L132 encePairwiseOnDemand]: 172/179 looper letters, 7 selfloop transitions, 6 changer transitions 6/33 dead transitions. [2021-03-11 20:23:23,381 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 33 transitions, 174 flow [2021-03-11 20:23:23,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:23:23,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:23:23,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 987 transitions. [2021-03-11 20:23:23,384 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7877094972067039 [2021-03-11 20:23:23,384 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 987 transitions. [2021-03-11 20:23:23,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 987 transitions. [2021-03-11 20:23:23,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:23:23,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 987 transitions. [2021-03-11 20:23:23,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 141.0) internal successors, (987), 7 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-03-11 20:23:23,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 179.0) internal successors, (1432), 8 states have internal predecessors, (1432), 0 states have call successors, (0), 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-03-11 20:23:23,388 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 179.0) internal successors, (1432), 8 states have internal predecessors, (1432), 0 states have call successors, (0), 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-03-11 20:23:23,388 INFO L185 Difference]: Start difference. First operand has 36 places, 24 transitions, 87 flow. Second operand 7 states and 987 transitions. [2021-03-11 20:23:23,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 33 transitions, 174 flow [2021-03-11 20:23:23,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 33 transitions, 162 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-11 20:23:23,390 INFO L241 Difference]: Finished difference. Result has 42 places, 25 transitions, 112 flow [2021-03-11 20:23:23,390 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=112, PETRI_PLACES=42, PETRI_TRANSITIONS=25} [2021-03-11 20:23:23,390 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 9 predicate places. [2021-03-11 20:23:23,390 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 25 transitions, 112 flow [2021-03-11 20:23:23,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 138.8) internal successors, (694), 5 states have internal predecessors, (694), 0 states have call successors, (0), 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-03-11 20:23:23,391 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:23:23,391 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:23:23,391 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-11 20:23:23,391 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:23:23,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:23:23,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1192308426, now seen corresponding path program 1 times [2021-03-11 20:23:23,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:23:23,392 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144366148] [2021-03-11 20:23:23,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:23:23,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:23:23,426 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:23:23,426 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:23:23,429 INFO L142 QuantifierPusher]: treesize reduction 3, result has 81.3 percent of original size [2021-03-11 20:23:23,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-11 20:23:23,438 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 20:23:23,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:23:23,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:23:23,444 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144366148] [2021-03-11 20:23:23,444 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:23:23,444 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:23:23,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107573765] [2021-03-11 20:23:23,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:23:23,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:23:23,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:23:23,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:23:23,446 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 179 [2021-03-11 20:23:23,446 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 25 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 136.8) internal successors, (684), 5 states have internal predecessors, (684), 0 states have call successors, (0), 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-03-11 20:23:23,446 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:23:23,446 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 179 [2021-03-11 20:23:23,447 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:23:23,540 INFO L129 PetriNetUnfolder]: 72/219 cut-off events. [2021-03-11 20:23:23,541 INFO L130 PetriNetUnfolder]: For 465/531 co-relation queries the response was YES. [2021-03-11 20:23:23,541 INFO L84 FinitePrefix]: Finished finitePrefix Result has 658 conditions, 219 events. 72/219 cut-off events. For 465/531 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1156 event pairs, 0 based on Foata normal form. 25/241 useless extension candidates. Maximal degree in co-relation 641. Up to 67 conditions per place. [2021-03-11 20:23:23,542 INFO L132 encePairwiseOnDemand]: 171/179 looper letters, 13 selfloop transitions, 17 changer transitions 18/61 dead transitions. [2021-03-11 20:23:23,542 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 61 transitions, 441 flow [2021-03-11 20:23:23,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-11 20:23:23,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-11 20:23:23,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1266 transitions. [2021-03-11 20:23:23,545 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.7858472998137802 [2021-03-11 20:23:23,545 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1266 transitions. [2021-03-11 20:23:23,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1266 transitions. [2021-03-11 20:23:23,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:23:23,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1266 transitions. [2021-03-11 20:23:23,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 140.66666666666666) internal successors, (1266), 9 states have internal predecessors, (1266), 0 states have call successors, (0), 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-03-11 20:23:23,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 179.0) internal successors, (1790), 10 states have internal predecessors, (1790), 0 states have call successors, (0), 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-03-11 20:23:23,551 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 179.0) internal successors, (1790), 10 states have internal predecessors, (1790), 0 states have call successors, (0), 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-03-11 20:23:23,551 INFO L185 Difference]: Start difference. First operand has 42 places, 25 transitions, 112 flow. Second operand 9 states and 1266 transitions. [2021-03-11 20:23:23,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 61 transitions, 441 flow [2021-03-11 20:23:23,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 61 transitions, 391 flow, removed 12 selfloop flow, removed 5 redundant places. [2021-03-11 20:23:23,553 INFO L241 Difference]: Finished difference. Result has 50 places, 37 transitions, 267 flow [2021-03-11 20:23:23,553 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=267, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2021-03-11 20:23:23,554 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 17 predicate places. [2021-03-11 20:23:23,554 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 267 flow [2021-03-11 20:23:23,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 136.8) internal successors, (684), 5 states have internal predecessors, (684), 0 states have call successors, (0), 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-03-11 20:23:23,554 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:23:23,554 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:23:23,554 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-11 20:23:23,554 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:23:23,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:23:23,555 INFO L82 PathProgramCache]: Analyzing trace with hash 270552097, now seen corresponding path program 1 times [2021-03-11 20:23:23,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:23:23,555 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091754419] [2021-03-11 20:23:23,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:23:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:23:23,580 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:23:23,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:23:23,583 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:23:23,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:23:23,586 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 20:23:23,586 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:23:23,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:23:23,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091754419] [2021-03-11 20:23:23,590 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:23:23,590 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:23:23,590 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509177907] [2021-03-11 20:23:23,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:23:23,590 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:23:23,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:23:23,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:23:23,591 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 179 [2021-03-11 20:23:23,592 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 267 flow. Second operand has 5 states, 5 states have (on average 143.8) internal successors, (719), 5 states have internal predecessors, (719), 0 states have call successors, (0), 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-03-11 20:23:23,592 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:23:23,592 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 179 [2021-03-11 20:23:23,592 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:23:23,632 INFO L129 PetriNetUnfolder]: 34/148 cut-off events. [2021-03-11 20:23:23,632 INFO L130 PetriNetUnfolder]: For 516/608 co-relation queries the response was YES. [2021-03-11 20:23:23,633 INFO L84 FinitePrefix]: Finished finitePrefix Result has 572 conditions, 148 events. 34/148 cut-off events. For 516/608 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 781 event pairs, 5 based on Foata normal form. 20/165 useless extension candidates. Maximal degree in co-relation 550. Up to 55 conditions per place. [2021-03-11 20:23:23,633 INFO L132 encePairwiseOnDemand]: 174/179 looper letters, 2 selfloop transitions, 5 changer transitions 14/41 dead transitions. [2021-03-11 20:23:23,633 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 41 transitions, 325 flow [2021-03-11 20:23:23,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-11 20:23:23,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-11 20:23:23,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 869 transitions. [2021-03-11 20:23:23,635 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8091247672253259 [2021-03-11 20:23:23,635 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 869 transitions. [2021-03-11 20:23:23,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 869 transitions. [2021-03-11 20:23:23,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:23:23,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 869 transitions. [2021-03-11 20:23:23,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 144.83333333333334) internal successors, (869), 6 states have internal predecessors, (869), 0 states have call successors, (0), 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-03-11 20:23:23,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 179.0) internal successors, (1253), 7 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-03-11 20:23:23,639 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 179.0) internal successors, (1253), 7 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-03-11 20:23:23,639 INFO L185 Difference]: Start difference. First operand has 50 places, 37 transitions, 267 flow. Second operand 6 states and 869 transitions. [2021-03-11 20:23:23,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 41 transitions, 325 flow [2021-03-11 20:23:23,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 41 transitions, 307 flow, removed 9 selfloop flow, removed 3 redundant places. [2021-03-11 20:23:23,642 INFO L241 Difference]: Finished difference. Result has 52 places, 27 transitions, 178 flow [2021-03-11 20:23:23,642 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=178, PETRI_PLACES=52, PETRI_TRANSITIONS=27} [2021-03-11 20:23:23,642 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 19 predicate places. [2021-03-11 20:23:23,642 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 27 transitions, 178 flow [2021-03-11 20:23:23,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 143.8) internal successors, (719), 5 states have internal predecessors, (719), 0 states have call successors, (0), 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-03-11 20:23:23,642 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:23:23,642 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:23:23,642 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-11 20:23:23,643 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:23:23,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:23:23,643 INFO L82 PathProgramCache]: Analyzing trace with hash 973231245, now seen corresponding path program 1 times [2021-03-11 20:23:23,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:23:23,643 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628810273] [2021-03-11 20:23:23,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:23:23,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:23:23,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:23:23,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:23:23,669 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 20:23:23,670 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:23:23,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:23:23,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628810273] [2021-03-11 20:23:23,672 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:23:23,672 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-11 20:23:23,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107844175] [2021-03-11 20:23:23,673 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:23:23,673 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:23:23,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:23:23,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:23:23,674 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 179 [2021-03-11 20:23:23,674 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 27 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 149.75) internal successors, (599), 4 states have internal predecessors, (599), 0 states have call successors, (0), 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-03-11 20:23:23,674 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:23:23,674 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 179 [2021-03-11 20:23:23,674 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:23:23,695 INFO L129 PetriNetUnfolder]: 11/80 cut-off events. [2021-03-11 20:23:23,696 INFO L130 PetriNetUnfolder]: For 249/256 co-relation queries the response was YES. [2021-03-11 20:23:23,696 INFO L84 FinitePrefix]: Finished finitePrefix Result has 314 conditions, 80 events. 11/80 cut-off events. For 249/256 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 318 event pairs, 6 based on Foata normal form. 10/89 useless extension candidates. Maximal degree in co-relation 298. Up to 27 conditions per place. [2021-03-11 20:23:23,696 INFO L132 encePairwiseOnDemand]: 174/179 looper letters, 4 selfloop transitions, 5 changer transitions 5/33 dead transitions. [2021-03-11 20:23:23,696 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 33 transitions, 268 flow [2021-03-11 20:23:23,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:23:23,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:23:23,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 759 transitions. [2021-03-11 20:23:23,698 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8480446927374302 [2021-03-11 20:23:23,698 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 759 transitions. [2021-03-11 20:23:23,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 759 transitions. [2021-03-11 20:23:23,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:23:23,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 759 transitions. [2021-03-11 20:23:23,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 151.8) internal successors, (759), 5 states have internal predecessors, (759), 0 states have call successors, (0), 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-03-11 20:23:23,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 0 states have call successors, (0), 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-03-11 20:23:23,701 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 0 states have call successors, (0), 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-03-11 20:23:23,701 INFO L185 Difference]: Start difference. First operand has 52 places, 27 transitions, 178 flow. Second operand 5 states and 759 transitions. [2021-03-11 20:23:23,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 33 transitions, 268 flow [2021-03-11 20:23:23,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 33 transitions, 186 flow, removed 16 selfloop flow, removed 11 redundant places. [2021-03-11 20:23:23,703 INFO L241 Difference]: Finished difference. Result has 46 places, 28 transitions, 150 flow [2021-03-11 20:23:23,703 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=150, PETRI_PLACES=46, PETRI_TRANSITIONS=28} [2021-03-11 20:23:23,704 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 13 predicate places. [2021-03-11 20:23:23,704 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 28 transitions, 150 flow [2021-03-11 20:23:23,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 149.75) internal successors, (599), 4 states have internal predecessors, (599), 0 states have call successors, (0), 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-03-11 20:23:23,704 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:23:23,704 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:23:23,704 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-11 20:23:23,705 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:23:23,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:23:23,705 INFO L82 PathProgramCache]: Analyzing trace with hash 243922996, now seen corresponding path program 1 times [2021-03-11 20:23:23,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:23:23,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858330642] [2021-03-11 20:23:23,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:23:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:23:23,766 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:23:23,767 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:23:23,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:23:23,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:23:23,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:23:23,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:23:23,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:23:23,776 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858330642] [2021-03-11 20:23:23,776 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:23:23,776 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:23:23,776 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795059480] [2021-03-11 20:23:23,777 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:23:23,777 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:23:23,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:23:23,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:23:23,777 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 179 [2021-03-11 20:23:23,778 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 28 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 143.75) internal successors, (575), 4 states have internal predecessors, (575), 0 states have call successors, (0), 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-03-11 20:23:23,778 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:23:23,778 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 179 [2021-03-11 20:23:23,778 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:23:23,854 INFO L129 PetriNetUnfolder]: 89/227 cut-off events. [2021-03-11 20:23:23,854 INFO L130 PetriNetUnfolder]: For 191/213 co-relation queries the response was YES. [2021-03-11 20:23:23,855 INFO L84 FinitePrefix]: Finished finitePrefix Result has 581 conditions, 227 events. 89/227 cut-off events. For 191/213 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1187 event pairs, 37 based on Foata normal form. 21/233 useless extension candidates. Maximal degree in co-relation 569. Up to 121 conditions per place. [2021-03-11 20:23:23,856 INFO L132 encePairwiseOnDemand]: 173/179 looper letters, 8 selfloop transitions, 8 changer transitions 0/38 dead transitions. [2021-03-11 20:23:23,856 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 38 transitions, 202 flow [2021-03-11 20:23:23,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-11 20:23:23,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-11 20:23:23,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 733 transitions. [2021-03-11 20:23:23,859 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8189944134078212 [2021-03-11 20:23:23,859 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 733 transitions. [2021-03-11 20:23:23,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 733 transitions. [2021-03-11 20:23:23,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:23:23,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 733 transitions. [2021-03-11 20:23:23,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 146.6) internal successors, (733), 5 states have internal predecessors, (733), 0 states have call successors, (0), 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-03-11 20:23:23,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 0 states have call successors, (0), 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-03-11 20:23:23,862 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 179.0) internal successors, (1074), 6 states have internal predecessors, (1074), 0 states have call successors, (0), 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-03-11 20:23:23,862 INFO L185 Difference]: Start difference. First operand has 46 places, 28 transitions, 150 flow. Second operand 5 states and 733 transitions. [2021-03-11 20:23:23,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 38 transitions, 202 flow [2021-03-11 20:23:23,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 38 transitions, 189 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-03-11 20:23:23,864 INFO L241 Difference]: Finished difference. Result has 48 places, 35 transitions, 197 flow [2021-03-11 20:23:23,864 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=197, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2021-03-11 20:23:23,864 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 15 predicate places. [2021-03-11 20:23:23,865 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 197 flow [2021-03-11 20:23:23,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 143.75) internal successors, (575), 4 states have internal predecessors, (575), 0 states have call successors, (0), 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-03-11 20:23:23,865 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:23:23,865 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:23:23,865 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-11 20:23:23,865 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:23:23,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:23:23,866 INFO L82 PathProgramCache]: Analyzing trace with hash -949259178, now seen corresponding path program 1 times [2021-03-11 20:23:23,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:23:23,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992886228] [2021-03-11 20:23:23,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:23:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:23:23,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:23:23,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:23:23,914 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:23:23,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:23:23,918 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:23:23,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:23:23,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:23:23,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:23:23,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-03-11 20:23:23,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992886228] [2021-03-11 20:23:23,925 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:23:23,925 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-11 20:23:23,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691702177] [2021-03-11 20:23:23,925 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-11 20:23:23,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:23:23,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-11 20:23:23,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-11 20:23:23,927 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 179 [2021-03-11 20:23:23,927 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 197 flow. Second operand has 5 states, 5 states have (on average 143.8) internal successors, (719), 5 states have internal predecessors, (719), 0 states have call successors, (0), 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-03-11 20:23:23,927 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:23:23,927 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 179 [2021-03-11 20:23:23,927 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:23:23,983 INFO L129 PetriNetUnfolder]: 55/170 cut-off events. [2021-03-11 20:23:23,983 INFO L130 PetriNetUnfolder]: For 221/375 co-relation queries the response was YES. [2021-03-11 20:23:23,984 INFO L84 FinitePrefix]: Finished finitePrefix Result has 634 conditions, 170 events. 55/170 cut-off events. For 221/375 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 815 event pairs, 6 based on Foata normal form. 65/225 useless extension candidates. Maximal degree in co-relation 621. Up to 107 conditions per place. [2021-03-11 20:23:23,984 INFO L132 encePairwiseOnDemand]: 173/179 looper letters, 5 selfloop transitions, 15 changer transitions 3/45 dead transitions. [2021-03-11 20:23:23,984 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 45 transitions, 301 flow [2021-03-11 20:23:23,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-11 20:23:23,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-11 20:23:23,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1026 transitions. [2021-03-11 20:23:23,987 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8188347964884277 [2021-03-11 20:23:23,987 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1026 transitions. [2021-03-11 20:23:23,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1026 transitions. [2021-03-11 20:23:23,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:23:23,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1026 transitions. [2021-03-11 20:23:23,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 146.57142857142858) internal successors, (1026), 7 states have internal predecessors, (1026), 0 states have call successors, (0), 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-03-11 20:23:23,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 179.0) internal successors, (1432), 8 states have internal predecessors, (1432), 0 states have call successors, (0), 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-03-11 20:23:23,991 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 179.0) internal successors, (1432), 8 states have internal predecessors, (1432), 0 states have call successors, (0), 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-03-11 20:23:23,991 INFO L185 Difference]: Start difference. First operand has 48 places, 35 transitions, 197 flow. Second operand 7 states and 1026 transitions. [2021-03-11 20:23:23,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 45 transitions, 301 flow [2021-03-11 20:23:23,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 45 transitions, 297 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-11 20:23:23,993 INFO L241 Difference]: Finished difference. Result has 56 places, 42 transitions, 292 flow [2021-03-11 20:23:23,993 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=292, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2021-03-11 20:23:23,994 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 23 predicate places. [2021-03-11 20:23:23,994 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 292 flow [2021-03-11 20:23:23,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 143.8) internal successors, (719), 5 states have internal predecessors, (719), 0 states have call successors, (0), 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-03-11 20:23:23,994 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:23:23,994 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:23:23,994 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-11 20:23:23,994 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:23:23,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:23:23,994 INFO L82 PathProgramCache]: Analyzing trace with hash -564507190, now seen corresponding path program 1 times [2021-03-11 20:23:23,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:23:23,996 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849478801] [2021-03-11 20:23:23,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:23:24,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:23:24,074 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:23:24,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:23:24,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:23:24,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:23:24,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:23:24,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:23:24,085 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:23:24,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-11 20:23:24,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:23:24,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:23:24,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:23:24,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849478801] [2021-03-11 20:23:24,097 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:23:24,097 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-11 20:23:24,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14335305] [2021-03-11 20:23:24,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-11 20:23:24,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:23:24,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-11 20:23:24,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-11 20:23:24,098 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 179 [2021-03-11 20:23:24,104 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 292 flow. Second operand has 6 states, 6 states have (on average 143.83333333333334) internal successors, (863), 6 states have internal predecessors, (863), 0 states have call successors, (0), 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-03-11 20:23:24,104 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:23:24,104 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 179 [2021-03-11 20:23:24,104 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:23:24,173 INFO L129 PetriNetUnfolder]: 36/127 cut-off events. [2021-03-11 20:23:24,174 INFO L130 PetriNetUnfolder]: For 498/732 co-relation queries the response was YES. [2021-03-11 20:23:24,174 INFO L84 FinitePrefix]: Finished finitePrefix Result has 622 conditions, 127 events. 36/127 cut-off events. For 498/732 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 591 event pairs, 1 based on Foata normal form. 75/192 useless extension candidates. Maximal degree in co-relation 606. Up to 88 conditions per place. [2021-03-11 20:23:24,175 INFO L132 encePairwiseOnDemand]: 173/179 looper letters, 2 selfloop transitions, 17 changer transitions 5/46 dead transitions. [2021-03-11 20:23:24,175 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 46 transitions, 370 flow [2021-03-11 20:23:24,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-11 20:23:24,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-11 20:23:24,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1313 transitions. [2021-03-11 20:23:24,177 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8150217256362507 [2021-03-11 20:23:24,177 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1313 transitions. [2021-03-11 20:23:24,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1313 transitions. [2021-03-11 20:23:24,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:23:24,178 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1313 transitions. [2021-03-11 20:23:24,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 145.88888888888889) internal successors, (1313), 9 states have internal predecessors, (1313), 0 states have call successors, (0), 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-03-11 20:23:24,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 179.0) internal successors, (1790), 10 states have internal predecessors, (1790), 0 states have call successors, (0), 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-03-11 20:23:24,182 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 179.0) internal successors, (1790), 10 states have internal predecessors, (1790), 0 states have call successors, (0), 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-03-11 20:23:24,183 INFO L185 Difference]: Start difference. First operand has 56 places, 42 transitions, 292 flow. Second operand 9 states and 1313 transitions. [2021-03-11 20:23:24,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 46 transitions, 370 flow [2021-03-11 20:23:24,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 46 transitions, 322 flow, removed 18 selfloop flow, removed 4 redundant places. [2021-03-11 20:23:24,186 INFO L241 Difference]: Finished difference. Result has 63 places, 41 transitions, 286 flow [2021-03-11 20:23:24,186 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=286, PETRI_PLACES=63, PETRI_TRANSITIONS=41} [2021-03-11 20:23:24,186 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 30 predicate places. [2021-03-11 20:23:24,186 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 41 transitions, 286 flow [2021-03-11 20:23:24,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 143.83333333333334) internal successors, (863), 6 states have internal predecessors, (863), 0 states have call successors, (0), 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-03-11 20:23:24,187 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:23:24,187 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:23:24,187 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-11 20:23:24,187 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:23:24,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:23:24,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1443105683, now seen corresponding path program 1 times [2021-03-11 20:23:24,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:23:24,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476268898] [2021-03-11 20:23:24,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:23:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-11 20:23:24,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:23:24,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-11 20:23:24,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-11 20:23:24,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-11 20:23:24,254 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-11 20:23:24,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-11 20:23:24,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-11 20:23:24,258 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476268898] [2021-03-11 20:23:24,258 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-11 20:23:24,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-11 20:23:24,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27936073] [2021-03-11 20:23:24,258 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-11 20:23:24,258 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-11 20:23:24,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-11 20:23:24,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-11 20:23:24,260 INFO L500 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 179 [2021-03-11 20:23:24,260 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 41 transitions, 286 flow. Second operand has 4 states, 4 states have (on average 150.25) internal successors, (601), 4 states have internal predecessors, (601), 0 states have call successors, (0), 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-03-11 20:23:24,260 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-11 20:23:24,260 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 179 [2021-03-11 20:23:24,261 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-11 20:23:24,281 INFO L129 PetriNetUnfolder]: 25/119 cut-off events. [2021-03-11 20:23:24,281 INFO L130 PetriNetUnfolder]: For 332/357 co-relation queries the response was YES. [2021-03-11 20:23:24,282 INFO L84 FinitePrefix]: Finished finitePrefix Result has 504 conditions, 119 events. 25/119 cut-off events. For 332/357 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 587 event pairs, 1 based on Foata normal form. 3/116 useless extension candidates. Maximal degree in co-relation 486. Up to 43 conditions per place. [2021-03-11 20:23:24,282 INFO L132 encePairwiseOnDemand]: 175/179 looper letters, 3 selfloop transitions, 2 changer transitions 15/42 dead transitions. [2021-03-11 20:23:24,282 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 42 transitions, 310 flow [2021-03-11 20:23:24,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-11 20:23:24,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-11 20:23:24,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 604 transitions. [2021-03-11 20:23:24,283 INFO L545 CegarLoopForPetriNet]: DFA transition density 0.8435754189944135 [2021-03-11 20:23:24,283 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 604 transitions. [2021-03-11 20:23:24,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 604 transitions. [2021-03-11 20:23:24,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-11 20:23:24,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 604 transitions. [2021-03-11 20:23:24,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 151.0) internal successors, (604), 4 states have internal predecessors, (604), 0 states have call successors, (0), 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-03-11 20:23:24,286 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 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-03-11 20:23:24,286 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 179.0) internal successors, (895), 5 states have internal predecessors, (895), 0 states have call successors, (0), 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-03-11 20:23:24,286 INFO L185 Difference]: Start difference. First operand has 63 places, 41 transitions, 286 flow. Second operand 4 states and 604 transitions. [2021-03-11 20:23:24,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 42 transitions, 310 flow [2021-03-11 20:23:24,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 42 transitions, 250 flow, removed 15 selfloop flow, removed 9 redundant places. [2021-03-11 20:23:24,289 INFO L241 Difference]: Finished difference. Result has 58 places, 27 transitions, 142 flow [2021-03-11 20:23:24,290 INFO L318 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=58, PETRI_TRANSITIONS=27} [2021-03-11 20:23:24,290 INFO L335 CegarLoopForPetriNet]: 33 programPoint places, 25 predicate places. [2021-03-11 20:23:24,290 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 27 transitions, 142 flow [2021-03-11 20:23:24,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 150.25) internal successors, (601), 4 states have internal predecessors, (601), 0 states have call successors, (0), 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-03-11 20:23:24,290 INFO L247 CegarLoopForPetriNet]: Found error trace [2021-03-11 20:23:24,290 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-11 20:23:24,290 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-11 20:23:24,290 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-11 20:23:24,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-11 20:23:24,291 INFO L82 PathProgramCache]: Analyzing trace with hash 516693379, now seen corresponding path program 2 times [2021-03-11 20:23:24,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-11 20:23:24,291 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532059039] [2021-03-11 20:23:24,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-11 20:23:24,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:23:24,327 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:23:24,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-11 20:23:24,375 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-11 20:23:24,405 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-11 20:23:24,405 INFO L620 BasicCegarLoop]: Counterexample might be feasible [2021-03-11 20:23:24,405 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-11 20:23:24,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.03 08:23:24 BasicIcfg [2021-03-11 20:23:24,469 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-11 20:23:24,469 INFO L168 Benchmark]: Toolchain (without parser) took 8637.74 ms. Allocated memory was 255.9 MB in the beginning and 490.7 MB in the end (delta: 234.9 MB). Free memory was 234.6 MB in the beginning and 310.0 MB in the end (delta: -75.4 MB). Peak memory consumption was 159.3 MB. Max. memory is 16.0 GB. [2021-03-11 20:23:24,470 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 255.9 MB. Free memory is still 237.4 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-11 20:23:24,470 INFO L168 Benchmark]: CACSL2BoogieTranslator took 473.28 ms. Allocated memory was 255.9 MB in the beginning and 339.7 MB in the end (delta: 83.9 MB). Free memory was 234.0 MB in the beginning and 299.6 MB in the end (delta: -65.6 MB). Peak memory consumption was 19.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:23:24,470 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.11 ms. Allocated memory is still 339.7 MB. Free memory was 298.9 MB in the beginning and 296.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:23:24,470 INFO L168 Benchmark]: Boogie Preprocessor took 30.56 ms. Allocated memory is still 339.7 MB. Free memory was 296.8 MB in the beginning and 294.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-11 20:23:24,471 INFO L168 Benchmark]: RCFGBuilder took 1365.78 ms. Allocated memory is still 339.7 MB. Free memory was 294.7 MB in the beginning and 317.1 MB in the end (delta: -22.3 MB). Peak memory consumption was 70.0 MB. Max. memory is 16.0 GB. [2021-03-11 20:23:24,471 INFO L168 Benchmark]: TraceAbstraction took 6710.43 ms. Allocated memory was 339.7 MB in the beginning and 490.7 MB in the end (delta: 151.0 MB). Free memory was 316.3 MB in the beginning and 310.0 MB in the end (delta: 6.3 MB). Peak memory consumption was 158.3 MB. Max. memory is 16.0 GB. [2021-03-11 20:23:24,472 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.09 ms. Allocated memory is still 255.9 MB. Free memory is still 237.4 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 473.28 ms. Allocated memory was 255.9 MB in the beginning and 339.7 MB in the end (delta: 83.9 MB). Free memory was 234.0 MB in the beginning and 299.6 MB in the end (delta: -65.6 MB). Peak memory consumption was 19.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 51.11 ms. Allocated memory is still 339.7 MB. Free memory was 298.9 MB in the beginning and 296.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 30.56 ms. Allocated memory is still 339.7 MB. Free memory was 296.8 MB in the beginning and 294.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1365.78 ms. Allocated memory is still 339.7 MB. Free memory was 294.7 MB in the beginning and 317.1 MB in the end (delta: -22.3 MB). Peak memory consumption was 70.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 6710.43 ms. Allocated memory was 339.7 MB in the beginning and 490.7 MB in the end (delta: 151.0 MB). Free memory was 316.3 MB in the beginning and 310.0 MB in the end (delta: 6.3 MB). Peak memory consumption was 158.3 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4858.8ms, 102 PlacesBefore, 33 PlacesAfterwards, 94 TransitionsBefore, 24 TransitionsAfterwards, 1586 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 82 TotalNumberOfCompositions, 3949 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2143, positive: 1995, positive conditional: 0, positive unconditional: 1995, negative: 148, negative conditional: 0, negative unconditional: 148, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1073, positive: 1036, positive conditional: 0, positive unconditional: 1036, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1073, positive: 1016, positive conditional: 0, positive unconditional: 1016, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 57, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 460, positive: 46, positive conditional: 0, positive unconditional: 46, negative: 414, negative conditional: 0, negative unconditional: 414, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2143, positive: 959, positive conditional: 0, positive unconditional: 959, negative: 111, negative conditional: 0, negative unconditional: 111, unknown: 1073, unknown conditional: 0, unknown unconditional: 1073] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 117, Positive conditional cache size: 0, Positive unconditional cache size: 117, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L738] 0 int z = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L831] 0 pthread_t t2073; [L832] FCALL, FORK 0 pthread_create(&t2073, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L833] 0 pthread_t t2074; [L834] FCALL, FORK 0 pthread_create(&t2074, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L835] 0 pthread_t t2075; [L836] FCALL, FORK 0 pthread_create(&t2075, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L744] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 2 return 0; [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L842] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L842] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L842] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L842] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L843] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L844] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L845] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L849] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, 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=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.3ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 6557.0ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 735.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 4913.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 67 SDtfs, 67 SDslu, 68 SDs, 0 SdLazy, 166 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 158.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 188.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=292occurred in iteration=8, InterpolantAutomatonStates: 60, 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: 31.6ms SsaConstructionTime, 248.4ms SatisfiabilityAnalysisTime, 389.2ms InterpolantComputationTime, 152 NumberOfCodeBlocks, 152 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 121 ConstructedInterpolants, 0 QuantifiedInterpolants, 449 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...