/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe001_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 01:35:43,676 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 01:35:43,679 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 01:35:43,705 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 01:35:43,705 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 01:35:43,712 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 01:35:43,715 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 01:35:43,719 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 01:35:43,721 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 01:35:43,724 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 01:35:43,724 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 01:35:43,726 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 01:35:43,726 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 01:35:43,728 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 01:35:43,730 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 01:35:43,732 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 01:35:43,733 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 01:35:43,734 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 01:35:43,735 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 01:35:43,743 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 01:35:43,745 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 01:35:43,745 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 01:35:43,746 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 01:35:43,747 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 01:35:43,760 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 01:35:43,761 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 01:35:43,761 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 01:35:43,762 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 01:35:43,762 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 01:35:43,763 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 01:35:43,763 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 01:35:43,765 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 01:35:43,766 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 01:35:43,767 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 01:35:43,767 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 01:35:43,768 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 01:35:43,773 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 01:35:43,774 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 01:35:43,774 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 01:35:43,775 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 01:35:43,775 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 01:35:43,776 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 [2020-10-16 01:35:43,801 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 01:35:43,801 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 01:35:43,802 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 01:35:43,802 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 01:35:43,802 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 01:35:43,803 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 01:35:43,803 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 01:35:43,803 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 01:35:43,803 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 01:35:43,803 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 01:35:43,804 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 01:35:43,804 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 01:35:43,804 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 01:35:43,804 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 01:35:43,804 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 01:35:43,805 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 01:35:43,805 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 01:35:43,805 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 01:35:43,805 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 01:35:43,805 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 01:35:43,805 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 01:35:43,806 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:35:43,806 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 01:35:43,806 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 01:35:43,806 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 01:35:43,806 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 01:35:43,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 01:35:43,807 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 01:35:43,807 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 01:35:44,074 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 01:35:44,086 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 01:35:44,089 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 01:35:44,091 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 01:35:44,091 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 01:35:44,092 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe001_power.opt.i [2020-10-16 01:35:44,148 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42763dbdd/0b890b7768034e5899bbd5c1607b63db/FLAG283c944a6 [2020-10-16 01:35:44,671 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 01:35:44,672 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_power.opt.i [2020-10-16 01:35:44,685 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42763dbdd/0b890b7768034e5899bbd5c1607b63db/FLAG283c944a6 [2020-10-16 01:35:44,953 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42763dbdd/0b890b7768034e5899bbd5c1607b63db [2020-10-16 01:35:44,961 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 01:35:44,962 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 01:35:44,963 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 01:35:44,964 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 01:35:44,967 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 01:35:44,968 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:35:44" (1/1) ... [2020-10-16 01:35:44,971 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d1d40f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:44, skipping insertion in model container [2020-10-16 01:35:44,971 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:35:44" (1/1) ... [2020-10-16 01:35:44,979 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 01:35:45,044 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 01:35:45,565 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:35:45,579 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 01:35:45,639 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:35:45,711 INFO L208 MainTranslator]: Completed translation [2020-10-16 01:35:45,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:45 WrapperNode [2020-10-16 01:35:45,711 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 01:35:45,712 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 01:35:45,712 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 01:35:45,712 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 01:35:45,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:45" (1/1) ... [2020-10-16 01:35:45,764 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:45" (1/1) ... [2020-10-16 01:35:45,796 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 01:35:45,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 01:35:45,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 01:35:45,798 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 01:35:45,807 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:45" (1/1) ... [2020-10-16 01:35:45,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:45" (1/1) ... [2020-10-16 01:35:45,811 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:45" (1/1) ... [2020-10-16 01:35:45,811 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:45" (1/1) ... [2020-10-16 01:35:45,822 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:45" (1/1) ... [2020-10-16 01:35:45,825 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:45" (1/1) ... [2020-10-16 01:35:45,829 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:45" (1/1) ... [2020-10-16 01:35:45,834 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 01:35:45,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 01:35:45,835 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 01:35:45,835 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 01:35:45,835 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:45" (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 [2020-10-16 01:35:45,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 01:35:45,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 01:35:45,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 01:35:45,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 01:35:45,897 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 01:35:45,897 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 01:35:45,897 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 01:35:45,897 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 01:35:45,897 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 01:35:45,897 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 01:35:45,898 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 01:35:45,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 01:35:45,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 01:35:45,900 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 01:35:47,819 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 01:35:47,820 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 01:35:47,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:35:47 BoogieIcfgContainer [2020-10-16 01:35:47,822 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 01:35:47,824 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 01:35:47,824 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 01:35:47,827 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 01:35:47,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:35:44" (1/3) ... [2020-10-16 01:35:47,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31d6aef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:35:47, skipping insertion in model container [2020-10-16 01:35:47,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:35:45" (2/3) ... [2020-10-16 01:35:47,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31d6aef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:35:47, skipping insertion in model container [2020-10-16 01:35:47,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:35:47" (3/3) ... [2020-10-16 01:35:47,831 INFO L111 eAbstractionObserver]: Analyzing ICFG safe001_power.opt.i [2020-10-16 01:35:47,842 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 01:35:47,850 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 01:35:47,851 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 01:35:47,880 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,880 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,880 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,881 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,881 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,882 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,882 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,882 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,882 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,882 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,883 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,883 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,883 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,884 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,884 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,884 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,885 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,885 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,885 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,886 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,886 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,886 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,886 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,887 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,887 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,887 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,887 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,888 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,888 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,888 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,889 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,889 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,889 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,889 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,890 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,890 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,890 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,890 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,890 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,891 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,891 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,891 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,892 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,895 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,896 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,896 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,896 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,896 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,897 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,897 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,897 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,897 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,898 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,902 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,902 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,902 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,902 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,903 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,903 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,903 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,903 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,903 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,904 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,905 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,906 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,906 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,906 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,906 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,906 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,907 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,907 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,907 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,907 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,908 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,908 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:35:47,927 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 01:35:47,948 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 01:35:47,948 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 01:35:47,949 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 01:35:47,949 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 01:35:47,949 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 01:35:47,949 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 01:35:47,949 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 01:35:47,949 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 01:35:47,963 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 199 flow [2020-10-16 01:35:48,009 INFO L129 PetriNetUnfolder]: 2/89 cut-off events. [2020-10-16 01:35:48,010 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:35:48,042 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-16 01:35:48,045 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 92 transitions, 199 flow [2020-10-16 01:35:48,055 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 89 transitions, 187 flow [2020-10-16 01:35:48,057 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 01:35:48,060 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 89 transitions, 187 flow [2020-10-16 01:35:48,063 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 89 transitions, 187 flow [2020-10-16 01:35:48,064 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 97 places, 89 transitions, 187 flow [2020-10-16 01:35:48,104 INFO L129 PetriNetUnfolder]: 2/89 cut-off events. [2020-10-16 01:35:48,104 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:35:48,106 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-16 01:35:48,110 INFO L117 LiptonReduction]: Number of co-enabled transitions 1642 [2020-10-16 01:35:48,199 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:48,199 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:48,202 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:48,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:48,210 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:48,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:48,219 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:35:48,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:48,256 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:35:48,257 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:48,258 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:48,258 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:48,262 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:48,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:48,265 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:35:48,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:48,460 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:35:48,461 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:48,462 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:48,463 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:48,465 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:48,466 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:48,468 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:35:48,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:48,489 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:35:48,489 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:48,490 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:48,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:48,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:48,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:48,498 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:35:48,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:48,556 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:35:48,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:48,557 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:35:48,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:48,589 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:35:48,590 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:48,591 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:35:48,592 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:49,765 WARN L193 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-16 01:35:49,781 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-16 01:35:49,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:49,783 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:35:49,783 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:50,538 WARN L193 SmtUtils]: Spent 743.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 125 [2020-10-16 01:35:50,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:50,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:50,605 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:50,605 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:50,609 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:50,609 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:50,615 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:35:50,615 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:50,667 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:35:50,667 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:50,668 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:50,668 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:50,670 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:50,671 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:50,678 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:35:50,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:50,773 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:35:50,773 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:50,774 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:50,774 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:50,779 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:50,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:50,783 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:35:50,783 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:50,816 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:35:50,817 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:50,818 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:50,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:50,820 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:50,820 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:50,822 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:35:50,827 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:50,911 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:35:50,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:50,913 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:50,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:50,918 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:50,918 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:50,924 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:35:50,924 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:50,948 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:35:50,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:50,949 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:50,950 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:50,954 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:50,954 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:50,959 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:35:50,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:51,021 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:35:51,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:51,073 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:35:51,073 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:51,074 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:51,074 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:51,077 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:51,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:51,079 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:35:51,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:51,100 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:35:51,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:51,101 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:51,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:51,103 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:51,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:51,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:35:51,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:51,272 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2020-10-16 01:35:51,511 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:35:51,512 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:52,027 WARN L193 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 61 [2020-10-16 01:35:52,247 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:35:52,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:52,248 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:52,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:52,250 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:52,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:52,253 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:35:52,253 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:52,267 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:35:52,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:52,268 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:52,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:52,270 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:52,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:52,273 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:35:52,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:52,346 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:35:52,347 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:52,348 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:52,348 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:52,350 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:52,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:52,352 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:35:52,352 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:52,366 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:35:52,367 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:52,368 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:52,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:52,369 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:52,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:52,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:35:52,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:52,471 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:52,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:52,472 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:52,473 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:52,474 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:52,475 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:52,477 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:35:52,477 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:52,490 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:52,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:52,491 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:52,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:52,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:52,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:52,495 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:35:52,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:52,551 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:35:52,552 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:52,602 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:52,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:52,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:52,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:52,605 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:52,605 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:52,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:35:52,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:35:52,618 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:52,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:52,619 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:52,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:35:52,621 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:35:52,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:52,623 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:35:52,623 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:35:53,214 WARN L193 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2020-10-16 01:35:53,313 INFO L132 LiptonReduction]: Checked pairs total: 4446 [2020-10-16 01:35:53,313 INFO L134 LiptonReduction]: Total number of compositions: 76 [2020-10-16 01:35:53,327 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5272 [2020-10-16 01:35:53,333 INFO L129 PetriNetUnfolder]: 0/7 cut-off events. [2020-10-16 01:35:53,334 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:35:53,334 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:35:53,335 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 01:35:53,336 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:35:53,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:35:53,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1000628281, now seen corresponding path program 1 times [2020-10-16 01:35:53,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:35:53,351 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240676222] [2020-10-16 01:35:53,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:35:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:35:53,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:35:53,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240676222] [2020-10-16 01:35:53,568 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:35:53,569 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:35:53,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199237204] [2020-10-16 01:35:53,580 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:35:53,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:35:53,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:35:53,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:35:53,599 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 168 [2020-10-16 01:35:53,603 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states. [2020-10-16 01:35:53,603 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:35:53,604 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 168 [2020-10-16 01:35:53,605 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:35:53,687 INFO L129 PetriNetUnfolder]: 49/132 cut-off events. [2020-10-16 01:35:53,687 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:35:53,688 INFO L80 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 132 events. 49/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 568 event pairs, 27 based on Foata normal form. 11/125 useless extension candidates. Maximal degree in co-relation 218. Up to 65 conditions per place. [2020-10-16 01:35:53,690 INFO L132 encePairwiseOnDemand]: 164/168 looper letters, 9 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2020-10-16 01:35:53,690 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 27 transitions, 85 flow [2020-10-16 01:35:53,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:35:53,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:35:53,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 437 transitions. [2020-10-16 01:35:53,707 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8670634920634921 [2020-10-16 01:35:53,708 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 437 transitions. [2020-10-16 01:35:53,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 437 transitions. [2020-10-16 01:35:53,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:35:53,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 437 transitions. [2020-10-16 01:35:53,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:35:53,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:35:53,725 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:35:53,727 INFO L185 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 437 transitions. [2020-10-16 01:35:53,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 27 transitions, 85 flow [2020-10-16 01:35:53,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 27 transitions, 82 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-16 01:35:53,732 INFO L241 Difference]: Finished difference. Result has 32 places, 23 transitions, 56 flow [2020-10-16 01:35:53,735 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2020-10-16 01:35:53,736 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2020-10-16 01:35:53,736 INFO L481 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 56 flow [2020-10-16 01:35:53,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:35:53,736 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:35:53,736 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:35:53,736 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 01:35:53,737 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:35:53,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:35:53,737 INFO L82 PathProgramCache]: Analyzing trace with hash -439717798, now seen corresponding path program 1 times [2020-10-16 01:35:53,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:35:53,738 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270137210] [2020-10-16 01:35:53,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:35:53,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:35:53,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:35:53,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270137210] [2020-10-16 01:35:53,911 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:35:53,911 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:35:53,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965760749] [2020-10-16 01:35:53,912 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:35:53,913 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:35:53,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:35:53,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:35:53,915 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 168 [2020-10-16 01:35:53,915 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 56 flow. Second operand 4 states. [2020-10-16 01:35:53,916 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:35:53,916 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 168 [2020-10-16 01:35:53,916 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:35:53,953 INFO L129 PetriNetUnfolder]: 2/31 cut-off events. [2020-10-16 01:35:53,953 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:35:53,953 INFO L80 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 31 events. 2/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 48 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 43. Up to 4 conditions per place. [2020-10-16 01:35:53,954 INFO L132 encePairwiseOnDemand]: 163/168 looper letters, 2 selfloop transitions, 2 changer transitions 5/27 dead transitions. [2020-10-16 01:35:53,954 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 27 transitions, 82 flow [2020-10-16 01:35:53,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:35:53,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:35:53,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 711 transitions. [2020-10-16 01:35:53,958 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8464285714285714 [2020-10-16 01:35:53,958 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 711 transitions. [2020-10-16 01:35:53,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 711 transitions. [2020-10-16 01:35:53,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:35:53,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 711 transitions. [2020-10-16 01:35:53,961 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:35:53,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:35:53,964 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:35:53,964 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 56 flow. Second operand 5 states and 711 transitions. [2020-10-16 01:35:53,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 27 transitions, 82 flow [2020-10-16 01:35:53,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 27 transitions, 78 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:35:53,965 INFO L241 Difference]: Finished difference. Result has 37 places, 22 transitions, 62 flow [2020-10-16 01:35:53,965 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=62, PETRI_PLACES=37, PETRI_TRANSITIONS=22} [2020-10-16 01:35:53,966 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2020-10-16 01:35:53,966 INFO L481 AbstractCegarLoop]: Abstraction has has 37 places, 22 transitions, 62 flow [2020-10-16 01:35:53,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:35:53,967 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:35:53,967 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:35:53,967 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 01:35:53,967 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:35:53,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:35:53,968 INFO L82 PathProgramCache]: Analyzing trace with hash -869081014, now seen corresponding path program 1 times [2020-10-16 01:35:53,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:35:53,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496557058] [2020-10-16 01:35:53,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:35:54,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:35:54,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:35:54,079 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496557058] [2020-10-16 01:35:54,079 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:35:54,079 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:35:54,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802266313] [2020-10-16 01:35:54,080 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:35:54,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:35:54,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:35:54,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:35:54,082 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 168 [2020-10-16 01:35:54,083 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 22 transitions, 62 flow. Second operand 5 states. [2020-10-16 01:35:54,083 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:35:54,083 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 168 [2020-10-16 01:35:54,083 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:35:54,232 INFO L129 PetriNetUnfolder]: 143/287 cut-off events. [2020-10-16 01:35:54,232 INFO L130 PetriNetUnfolder]: For 70/70 co-relation queries the response was YES. [2020-10-16 01:35:54,234 INFO L80 FinitePrefix]: Finished finitePrefix Result has 583 conditions, 287 events. 143/287 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1403 event pairs, 28 based on Foata normal form. 18/297 useless extension candidates. Maximal degree in co-relation 571. Up to 167 conditions per place. [2020-10-16 01:35:54,236 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 16 selfloop transitions, 5 changer transitions 14/47 dead transitions. [2020-10-16 01:35:54,236 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 47 transitions, 186 flow [2020-10-16 01:35:54,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:35:54,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:35:54,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 829 transitions. [2020-10-16 01:35:54,240 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7049319727891157 [2020-10-16 01:35:54,240 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 829 transitions. [2020-10-16 01:35:54,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 829 transitions. [2020-10-16 01:35:54,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:35:54,241 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 829 transitions. [2020-10-16 01:35:54,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:35:54,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:35:54,245 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:35:54,246 INFO L185 Difference]: Start difference. First operand has 37 places, 22 transitions, 62 flow. Second operand 7 states and 829 transitions. [2020-10-16 01:35:54,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 47 transitions, 186 flow [2020-10-16 01:35:54,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 47 transitions, 178 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 01:35:54,249 INFO L241 Difference]: Finished difference. Result has 41 places, 25 transitions, 95 flow [2020-10-16 01:35:54,249 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=95, PETRI_PLACES=41, PETRI_TRANSITIONS=25} [2020-10-16 01:35:54,249 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 7 predicate places. [2020-10-16 01:35:54,249 INFO L481 AbstractCegarLoop]: Abstraction has has 41 places, 25 transitions, 95 flow [2020-10-16 01:35:54,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:35:54,249 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:35:54,250 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:35:54,250 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 01:35:54,250 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:35:54,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:35:54,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1661610015, now seen corresponding path program 1 times [2020-10-16 01:35:54,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:35:54,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843912134] [2020-10-16 01:35:54,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:35:54,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:35:54,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:35:54,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843912134] [2020-10-16 01:35:54,342 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:35:54,342 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:35:54,342 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853515202] [2020-10-16 01:35:54,343 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:35:54,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:35:54,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:35:54,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:35:54,345 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 168 [2020-10-16 01:35:54,346 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 25 transitions, 95 flow. Second operand 6 states. [2020-10-16 01:35:54,346 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:35:54,346 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 168 [2020-10-16 01:35:54,346 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:35:54,549 INFO L129 PetriNetUnfolder]: 276/545 cut-off events. [2020-10-16 01:35:54,550 INFO L130 PetriNetUnfolder]: For 711/721 co-relation queries the response was YES. [2020-10-16 01:35:54,552 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1539 conditions, 545 events. 276/545 cut-off events. For 711/721 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3147 event pairs, 21 based on Foata normal form. 31/573 useless extension candidates. Maximal degree in co-relation 1524. Up to 192 conditions per place. [2020-10-16 01:35:54,554 INFO L132 encePairwiseOnDemand]: 161/168 looper letters, 22 selfloop transitions, 7 changer transitions 26/66 dead transitions. [2020-10-16 01:35:54,555 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 66 transitions, 379 flow [2020-10-16 01:35:54,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 01:35:54,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 01:35:54,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1107 transitions. [2020-10-16 01:35:54,559 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7321428571428571 [2020-10-16 01:35:54,559 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1107 transitions. [2020-10-16 01:35:54,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1107 transitions. [2020-10-16 01:35:54,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:35:54,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1107 transitions. [2020-10-16 01:35:54,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 01:35:54,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 01:35:54,566 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 01:35:54,566 INFO L185 Difference]: Start difference. First operand has 41 places, 25 transitions, 95 flow. Second operand 9 states and 1107 transitions. [2020-10-16 01:35:54,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 66 transitions, 379 flow [2020-10-16 01:35:54,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 66 transitions, 366 flow, removed 4 selfloop flow, removed 3 redundant places. [2020-10-16 01:35:54,572 INFO L241 Difference]: Finished difference. Result has 49 places, 27 transitions, 137 flow [2020-10-16 01:35:54,572 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=137, PETRI_PLACES=49, PETRI_TRANSITIONS=27} [2020-10-16 01:35:54,572 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2020-10-16 01:35:54,573 INFO L481 AbstractCegarLoop]: Abstraction has has 49 places, 27 transitions, 137 flow [2020-10-16 01:35:54,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:35:54,573 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:35:54,573 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:35:54,573 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 01:35:54,574 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:35:54,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:35:54,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1922421081, now seen corresponding path program 1 times [2020-10-16 01:35:54,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:35:54,575 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048122868] [2020-10-16 01:35:54,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:35:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:35:54,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:35:54,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048122868] [2020-10-16 01:35:54,671 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:35:54,671 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:35:54,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532703385] [2020-10-16 01:35:54,672 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:35:54,672 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:35:54,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:35:54,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:35:54,675 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 168 [2020-10-16 01:35:54,676 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 27 transitions, 137 flow. Second operand 6 states. [2020-10-16 01:35:54,676 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:35:54,676 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 168 [2020-10-16 01:35:54,676 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:35:54,806 INFO L129 PetriNetUnfolder]: 82/215 cut-off events. [2020-10-16 01:35:54,806 INFO L130 PetriNetUnfolder]: For 760/794 co-relation queries the response was YES. [2020-10-16 01:35:54,808 INFO L80 FinitePrefix]: Finished finitePrefix Result has 789 conditions, 215 events. 82/215 cut-off events. For 760/794 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1122 event pairs, 29 based on Foata normal form. 12/211 useless extension candidates. Maximal degree in co-relation 769. Up to 92 conditions per place. [2020-10-16 01:35:54,809 INFO L132 encePairwiseOnDemand]: 163/168 looper letters, 12 selfloop transitions, 3 changer transitions 5/35 dead transitions. [2020-10-16 01:35:54,809 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 35 transitions, 218 flow [2020-10-16 01:35:54,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:35:54,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:35:54,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 607 transitions. [2020-10-16 01:35:54,812 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7226190476190476 [2020-10-16 01:35:54,812 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 607 transitions. [2020-10-16 01:35:54,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 607 transitions. [2020-10-16 01:35:54,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:35:54,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 607 transitions. [2020-10-16 01:35:54,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:35:54,815 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:35:54,815 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:35:54,815 INFO L185 Difference]: Start difference. First operand has 49 places, 27 transitions, 137 flow. Second operand 5 states and 607 transitions. [2020-10-16 01:35:54,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 35 transitions, 218 flow [2020-10-16 01:35:54,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 35 transitions, 190 flow, removed 9 selfloop flow, removed 5 redundant places. [2020-10-16 01:35:54,820 INFO L241 Difference]: Finished difference. Result has 47 places, 25 transitions, 115 flow [2020-10-16 01:35:54,820 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=47, PETRI_TRANSITIONS=25} [2020-10-16 01:35:54,820 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2020-10-16 01:35:54,821 INFO L481 AbstractCegarLoop]: Abstraction has has 47 places, 25 transitions, 115 flow [2020-10-16 01:35:54,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:35:54,821 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:35:54,821 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:35:54,821 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 01:35:54,821 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:35:54,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:35:54,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1043836845, now seen corresponding path program 2 times [2020-10-16 01:35:54,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:35:54,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590791362] [2020-10-16 01:35:54,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:35:54,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:35:54,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:35:54,885 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590791362] [2020-10-16 01:35:54,885 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:35:54,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:35:54,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415351963] [2020-10-16 01:35:54,885 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:35:54,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:35:54,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:35:54,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:35:54,887 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 168 [2020-10-16 01:35:54,888 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 25 transitions, 115 flow. Second operand 5 states. [2020-10-16 01:35:54,888 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:35:54,888 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 168 [2020-10-16 01:35:54,888 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:35:54,952 INFO L129 PetriNetUnfolder]: 26/87 cut-off events. [2020-10-16 01:35:54,952 INFO L130 PetriNetUnfolder]: For 283/296 co-relation queries the response was YES. [2020-10-16 01:35:54,953 INFO L80 FinitePrefix]: Finished finitePrefix Result has 308 conditions, 87 events. 26/87 cut-off events. For 283/296 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 344 event pairs, 15 based on Foata normal form. 15/97 useless extension candidates. Maximal degree in co-relation 289. Up to 43 conditions per place. [2020-10-16 01:35:54,953 INFO L132 encePairwiseOnDemand]: 163/168 looper letters, 6 selfloop transitions, 2 changer transitions 8/32 dead transitions. [2020-10-16 01:35:54,953 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 32 transitions, 193 flow [2020-10-16 01:35:54,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:35:54,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:35:54,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 932 transitions. [2020-10-16 01:35:54,957 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7925170068027211 [2020-10-16 01:35:54,957 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 932 transitions. [2020-10-16 01:35:54,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 932 transitions. [2020-10-16 01:35:54,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:35:54,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 932 transitions. [2020-10-16 01:35:54,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:35:54,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:35:54,961 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:35:54,961 INFO L185 Difference]: Start difference. First operand has 47 places, 25 transitions, 115 flow. Second operand 7 states and 932 transitions. [2020-10-16 01:35:54,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 32 transitions, 193 flow [2020-10-16 01:35:54,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 32 transitions, 158 flow, removed 8 selfloop flow, removed 8 redundant places. [2020-10-16 01:35:54,964 INFO L241 Difference]: Finished difference. Result has 48 places, 24 transitions, 103 flow [2020-10-16 01:35:54,964 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=103, PETRI_PLACES=48, PETRI_TRANSITIONS=24} [2020-10-16 01:35:54,964 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2020-10-16 01:35:54,965 INFO L481 AbstractCegarLoop]: Abstraction has has 48 places, 24 transitions, 103 flow [2020-10-16 01:35:54,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:35:54,965 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:35:54,965 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:35:54,965 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 01:35:54,965 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:35:54,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:35:54,966 INFO L82 PathProgramCache]: Analyzing trace with hash -2001253848, now seen corresponding path program 1 times [2020-10-16 01:35:54,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:35:54,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396675800] [2020-10-16 01:35:54,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:35:54,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:35:55,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:35:55,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396675800] [2020-10-16 01:35:55,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:35:55,076 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:35:55,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282719754] [2020-10-16 01:35:55,077 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:35:55,077 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:35:55,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:35:55,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:35:55,079 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 168 [2020-10-16 01:35:55,079 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 24 transitions, 103 flow. Second operand 6 states. [2020-10-16 01:35:55,079 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:35:55,080 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 168 [2020-10-16 01:35:55,080 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:35:55,229 INFO L129 PetriNetUnfolder]: 122/249 cut-off events. [2020-10-16 01:35:55,229 INFO L130 PetriNetUnfolder]: For 672/694 co-relation queries the response was YES. [2020-10-16 01:35:55,230 INFO L80 FinitePrefix]: Finished finitePrefix Result has 766 conditions, 249 events. 122/249 cut-off events. For 672/694 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1038 event pairs, 84 based on Foata normal form. 21/252 useless extension candidates. Maximal degree in co-relation 749. Up to 146 conditions per place. [2020-10-16 01:35:55,232 INFO L132 encePairwiseOnDemand]: 161/168 looper letters, 9 selfloop transitions, 5 changer transitions 8/37 dead transitions. [2020-10-16 01:35:55,232 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 37 transitions, 183 flow [2020-10-16 01:35:55,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:35:55,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:35:55,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 750 transitions. [2020-10-16 01:35:55,235 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7440476190476191 [2020-10-16 01:35:55,235 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 750 transitions. [2020-10-16 01:35:55,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 750 transitions. [2020-10-16 01:35:55,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:35:55,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 750 transitions. [2020-10-16 01:35:55,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:35:55,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:35:55,239 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:35:55,239 INFO L185 Difference]: Start difference. First operand has 48 places, 24 transitions, 103 flow. Second operand 6 states and 750 transitions. [2020-10-16 01:35:55,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 37 transitions, 183 flow [2020-10-16 01:35:55,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 37 transitions, 160 flow, removed 8 selfloop flow, removed 7 redundant places. [2020-10-16 01:35:55,243 INFO L241 Difference]: Finished difference. Result has 45 places, 27 transitions, 124 flow [2020-10-16 01:35:55,243 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=124, PETRI_PLACES=45, PETRI_TRANSITIONS=27} [2020-10-16 01:35:55,244 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2020-10-16 01:35:55,244 INFO L481 AbstractCegarLoop]: Abstraction has has 45 places, 27 transitions, 124 flow [2020-10-16 01:35:55,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:35:55,244 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:35:55,244 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:35:55,244 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 01:35:55,244 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:35:55,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:35:55,245 INFO L82 PathProgramCache]: Analyzing trace with hash -501157481, now seen corresponding path program 1 times [2020-10-16 01:35:55,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:35:55,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544891182] [2020-10-16 01:35:55,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:35:55,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:35:55,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:35:55,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544891182] [2020-10-16 01:35:55,312 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:35:55,312 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:35:55,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509658462] [2020-10-16 01:35:55,313 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:35:55,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:35:55,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:35:55,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:35:55,314 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 168 [2020-10-16 01:35:55,314 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 27 transitions, 124 flow. Second operand 4 states. [2020-10-16 01:35:55,315 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:35:55,315 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 168 [2020-10-16 01:35:55,315 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:35:55,377 INFO L129 PetriNetUnfolder]: 96/215 cut-off events. [2020-10-16 01:35:55,378 INFO L130 PetriNetUnfolder]: For 310/338 co-relation queries the response was YES. [2020-10-16 01:35:55,379 INFO L80 FinitePrefix]: Finished finitePrefix Result has 674 conditions, 215 events. 96/215 cut-off events. For 310/338 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 936 event pairs, 46 based on Foata normal form. 15/216 useless extension candidates. Maximal degree in co-relation 658. Up to 100 conditions per place. [2020-10-16 01:35:55,380 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 8 selfloop transitions, 10 changer transitions 0/38 dead transitions. [2020-10-16 01:35:55,380 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 38 transitions, 209 flow [2020-10-16 01:35:55,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:35:55,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:35:55,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 688 transitions. [2020-10-16 01:35:55,383 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.819047619047619 [2020-10-16 01:35:55,383 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 688 transitions. [2020-10-16 01:35:55,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 688 transitions. [2020-10-16 01:35:55,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:35:55,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 688 transitions. [2020-10-16 01:35:55,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:35:55,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:35:55,386 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:35:55,387 INFO L185 Difference]: Start difference. First operand has 45 places, 27 transitions, 124 flow. Second operand 5 states and 688 transitions. [2020-10-16 01:35:55,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 38 transitions, 209 flow [2020-10-16 01:35:55,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 38 transitions, 201 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-16 01:35:55,389 INFO L241 Difference]: Finished difference. Result has 47 places, 35 transitions, 204 flow [2020-10-16 01:35:55,390 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=204, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2020-10-16 01:35:55,390 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2020-10-16 01:35:55,390 INFO L481 AbstractCegarLoop]: Abstraction has has 47 places, 35 transitions, 204 flow [2020-10-16 01:35:55,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:35:55,390 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:35:55,390 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:35:55,390 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 01:35:55,391 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:35:55,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:35:55,391 INFO L82 PathProgramCache]: Analyzing trace with hash -804833837, now seen corresponding path program 1 times [2020-10-16 01:35:55,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:35:55,391 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104823856] [2020-10-16 01:35:55,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:35:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:35:55,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:35:55,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104823856] [2020-10-16 01:35:55,451 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:35:55,451 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:35:55,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707224431] [2020-10-16 01:35:55,451 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:35:55,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:35:55,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:35:55,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:35:55,453 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 168 [2020-10-16 01:35:55,453 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 204 flow. Second operand 5 states. [2020-10-16 01:35:55,454 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:35:55,454 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 168 [2020-10-16 01:35:55,454 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:35:55,523 INFO L129 PetriNetUnfolder]: 45/135 cut-off events. [2020-10-16 01:35:55,523 INFO L130 PetriNetUnfolder]: For 431/575 co-relation queries the response was YES. [2020-10-16 01:35:55,524 INFO L80 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 135 events. 45/135 cut-off events. For 431/575 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 516 event pairs, 9 based on Foata normal form. 58/187 useless extension candidates. Maximal degree in co-relation 544. Up to 74 conditions per place. [2020-10-16 01:35:55,525 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 5 selfloop transitions, 17 changer transitions 3/45 dead transitions. [2020-10-16 01:35:55,526 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 45 transitions, 336 flow [2020-10-16 01:35:55,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:35:55,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:35:55,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 963 transitions. [2020-10-16 01:35:55,529 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8188775510204082 [2020-10-16 01:35:55,529 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 963 transitions. [2020-10-16 01:35:55,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 963 transitions. [2020-10-16 01:35:55,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:35:55,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 963 transitions. [2020-10-16 01:35:55,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:35:55,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:35:55,534 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:35:55,534 INFO L185 Difference]: Start difference. First operand has 47 places, 35 transitions, 204 flow. Second operand 7 states and 963 transitions. [2020-10-16 01:35:55,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 45 transitions, 336 flow [2020-10-16 01:35:55,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 45 transitions, 323 flow, removed 4 selfloop flow, removed 1 redundant places. [2020-10-16 01:35:55,538 INFO L241 Difference]: Finished difference. Result has 55 places, 42 transitions, 312 flow [2020-10-16 01:35:55,538 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=312, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2020-10-16 01:35:55,538 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 21 predicate places. [2020-10-16 01:35:55,538 INFO L481 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 312 flow [2020-10-16 01:35:55,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:35:55,538 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:35:55,539 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:35:55,539 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 01:35:55,539 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:35:55,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:35:55,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1478195885, now seen corresponding path program 1 times [2020-10-16 01:35:55,539 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:35:55,540 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423312622] [2020-10-16 01:35:55,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:35:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:35:55,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:35:55,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423312622] [2020-10-16 01:35:55,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:35:55,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:35:55,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250206600] [2020-10-16 01:35:55,654 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:35:55,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:35:55,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:35:55,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:35:55,656 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 168 [2020-10-16 01:35:55,657 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 312 flow. Second operand 6 states. [2020-10-16 01:35:55,657 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:35:55,657 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 168 [2020-10-16 01:35:55,657 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:35:55,749 INFO L129 PetriNetUnfolder]: 26/98 cut-off events. [2020-10-16 01:35:55,750 INFO L130 PetriNetUnfolder]: For 735/977 co-relation queries the response was YES. [2020-10-16 01:35:55,751 INFO L80 FinitePrefix]: Finished finitePrefix Result has 501 conditions, 98 events. 26/98 cut-off events. For 735/977 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 360 event pairs, 1 based on Foata normal form. 60/153 useless extension candidates. Maximal degree in co-relation 479. Up to 60 conditions per place. [2020-10-16 01:35:55,752 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 2 selfloop transitions, 21 changer transitions 3/46 dead transitions. [2020-10-16 01:35:55,752 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 46 transitions, 402 flow [2020-10-16 01:35:55,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 01:35:55,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 01:35:55,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1232 transitions. [2020-10-16 01:35:55,756 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8148148148148148 [2020-10-16 01:35:55,756 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1232 transitions. [2020-10-16 01:35:55,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1232 transitions. [2020-10-16 01:35:55,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:35:55,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1232 transitions. [2020-10-16 01:35:55,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 01:35:55,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 01:35:55,762 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 01:35:55,763 INFO L185 Difference]: Start difference. First operand has 55 places, 42 transitions, 312 flow. Second operand 9 states and 1232 transitions. [2020-10-16 01:35:55,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 46 transitions, 402 flow [2020-10-16 01:35:55,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 46 transitions, 337 flow, removed 26 selfloop flow, removed 3 redundant places. [2020-10-16 01:35:55,770 INFO L241 Difference]: Finished difference. Result has 63 places, 43 transitions, 312 flow [2020-10-16 01:35:55,771 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=312, PETRI_PLACES=63, PETRI_TRANSITIONS=43} [2020-10-16 01:35:55,771 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 29 predicate places. [2020-10-16 01:35:55,771 INFO L481 AbstractCegarLoop]: Abstraction has has 63 places, 43 transitions, 312 flow [2020-10-16 01:35:55,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:35:55,771 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:35:55,772 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, 1] [2020-10-16 01:35:55,772 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 01:35:55,772 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:35:55,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:35:55,772 INFO L82 PathProgramCache]: Analyzing trace with hash -493350407, now seen corresponding path program 1 times [2020-10-16 01:35:55,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:35:55,775 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090647425] [2020-10-16 01:35:55,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:35:55,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:35:56,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:35:56,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090647425] [2020-10-16 01:35:56,001 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:35:56,001 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:35:56,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284477699] [2020-10-16 01:35:56,002 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 01:35:56,002 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:35:56,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 01:35:56,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 01:35:56,005 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 168 [2020-10-16 01:35:56,006 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 43 transitions, 312 flow. Second operand 8 states. [2020-10-16 01:35:56,006 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:35:56,006 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 168 [2020-10-16 01:35:56,006 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:35:56,241 INFO L129 PetriNetUnfolder]: 56/200 cut-off events. [2020-10-16 01:35:56,241 INFO L130 PetriNetUnfolder]: For 875/992 co-relation queries the response was YES. [2020-10-16 01:35:56,242 INFO L80 FinitePrefix]: Finished finitePrefix Result has 862 conditions, 200 events. 56/200 cut-off events. For 875/992 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 1165 event pairs, 0 based on Foata normal form. 20/208 useless extension candidates. Maximal degree in co-relation 837. Up to 65 conditions per place. [2020-10-16 01:35:56,243 INFO L132 encePairwiseOnDemand]: 161/168 looper letters, 8 selfloop transitions, 7 changer transitions 9/52 dead transitions. [2020-10-16 01:35:56,243 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 52 transitions, 408 flow [2020-10-16 01:35:56,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 01:35:56,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 01:35:56,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 924 transitions. [2020-10-16 01:35:56,247 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6875 [2020-10-16 01:35:56,247 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 924 transitions. [2020-10-16 01:35:56,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 924 transitions. [2020-10-16 01:35:56,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:35:56,248 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 924 transitions. [2020-10-16 01:35:56,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 01:35:56,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 01:35:56,252 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 01:35:56,252 INFO L185 Difference]: Start difference. First operand has 63 places, 43 transitions, 312 flow. Second operand 8 states and 924 transitions. [2020-10-16 01:35:56,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 52 transitions, 408 flow [2020-10-16 01:35:56,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 52 transitions, 316 flow, removed 27 selfloop flow, removed 10 redundant places. [2020-10-16 01:35:56,259 INFO L241 Difference]: Finished difference. Result has 63 places, 41 transitions, 244 flow [2020-10-16 01:35:56,259 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=244, PETRI_PLACES=63, PETRI_TRANSITIONS=41} [2020-10-16 01:35:56,259 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 29 predicate places. [2020-10-16 01:35:56,259 INFO L481 AbstractCegarLoop]: Abstraction has has 63 places, 41 transitions, 244 flow [2020-10-16 01:35:56,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 01:35:56,260 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:35:56,260 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, 1] [2020-10-16 01:35:56,260 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 01:35:56,260 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:35:56,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:35:56,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1095805621, now seen corresponding path program 2 times [2020-10-16 01:35:56,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:35:56,261 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215047631] [2020-10-16 01:35:56,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:35:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:35:56,299 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:35:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:35:56,337 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:35:56,370 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 01:35:56,371 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 01:35:56,371 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 01:35:56,387 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:56,387 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:56,389 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:56,389 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:56,389 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:56,390 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:56,390 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:56,390 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:56,390 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:56,390 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:56,390 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:56,390 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:56,391 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:56,391 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:56,391 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:56,392 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:56,392 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:56,392 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:56,392 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:56,392 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:56,392 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:56,393 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:56,393 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:56,393 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:56,393 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:56,393 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:56,393 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:56,394 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:56,394 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:56,394 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:56,394 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:56,394 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:56,394 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:56,394 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:56,395 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:56,396 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:56,396 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:56,396 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:56,396 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:56,396 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:56,396 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:56,396 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:56,397 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:56,397 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:56,397 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:56,397 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:56,397 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:56,398 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:56,398 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:56,398 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:56,398 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:56,398 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:56,398 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:56,398 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:56,399 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:56,399 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:56,399 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:56,399 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:56,399 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:56,399 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:56,400 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:56,400 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:56,400 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:56,400 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:56,400 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:56,401 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:56,401 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:56,401 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:56,401 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:56,401 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:56,401 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:56,401 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:56,402 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:56,402 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:56,402 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:35:56,402 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:35:56,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:35:56 BasicIcfg [2020-10-16 01:35:56,462 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 01:35:56,463 INFO L168 Benchmark]: Toolchain (without parser) took 11501.38 ms. Allocated memory was 252.2 MB in the beginning and 539.5 MB in the end (delta: 287.3 MB). Free memory was 208.0 MB in the beginning and 431.6 MB in the end (delta: -223.5 MB). Peak memory consumption was 63.8 MB. Max. memory is 14.2 GB. [2020-10-16 01:35:56,464 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 252.2 MB. Free memory is still 228.6 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 01:35:56,465 INFO L168 Benchmark]: CACSL2BoogieTranslator took 748.22 ms. Allocated memory was 252.2 MB in the beginning and 318.2 MB in the end (delta: 66.1 MB). Free memory was 208.0 MB in the beginning and 269.0 MB in the end (delta: -61.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 14.2 GB. [2020-10-16 01:35:56,465 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.55 ms. Allocated memory is still 318.2 MB. Free memory was 269.0 MB in the beginning and 264.0 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. [2020-10-16 01:35:56,466 INFO L168 Benchmark]: Boogie Preprocessor took 36.03 ms. Allocated memory is still 318.2 MB. Free memory was 264.0 MB in the beginning and 261.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:35:56,467 INFO L168 Benchmark]: RCFGBuilder took 1988.01 ms. Allocated memory was 318.2 MB in the beginning and 360.7 MB in the end (delta: 42.5 MB). Free memory was 261.5 MB in the beginning and 182.0 MB in the end (delta: 79.5 MB). Peak memory consumption was 122.0 MB. Max. memory is 14.2 GB. [2020-10-16 01:35:56,467 INFO L168 Benchmark]: TraceAbstraction took 8638.06 ms. Allocated memory was 360.7 MB in the beginning and 539.5 MB in the end (delta: 178.8 MB). Free memory was 182.0 MB in the beginning and 431.6 MB in the end (delta: -249.6 MB). There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 01:35:56,471 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 252.2 MB. Free memory is still 228.6 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 748.22 ms. Allocated memory was 252.2 MB in the beginning and 318.2 MB in the end (delta: 66.1 MB). Free memory was 208.0 MB in the beginning and 269.0 MB in the end (delta: -61.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 84.55 ms. Allocated memory is still 318.2 MB. Free memory was 269.0 MB in the beginning and 264.0 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 36.03 ms. Allocated memory is still 318.2 MB. Free memory was 264.0 MB in the beginning and 261.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1988.01 ms. Allocated memory was 318.2 MB in the beginning and 360.7 MB in the end (delta: 42.5 MB). Free memory was 261.5 MB in the beginning and 182.0 MB in the end (delta: 79.5 MB). Peak memory consumption was 122.0 MB. Max. memory is 14.2 GB. * TraceAbstraction took 8638.06 ms. Allocated memory was 360.7 MB in the beginning and 539.5 MB in the end (delta: 178.8 MB). Free memory was 182.0 MB in the beginning and 431.6 MB in the end (delta: -249.6 MB). There was no memory consumed. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1035 VarBasedMoverChecksPositive, 62 VarBasedMoverChecksNegative, 18 SemBasedMoverChecksPositive, 44 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 99 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.2s, 97 PlacesBefore, 34 PlacesAfterwards, 89 TransitionsBefore, 25 TransitionsAfterwards, 1642 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 76 TotalNumberOfCompositions, 4446 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p0_EAX = 0; [L702] 0 int __unbuffered_p2_EAX = 0; [L703] 0 _Bool main$tmp_guard0; [L704] 0 _Bool main$tmp_guard1; [L706] 0 int x = 0; [L707] 0 _Bool x$flush_delayed; [L708] 0 int x$mem_tmp; [L709] 0 _Bool x$r_buff0_thd0; [L710] 0 _Bool x$r_buff0_thd1; [L711] 0 _Bool x$r_buff0_thd2; [L712] 0 _Bool x$r_buff0_thd3; [L713] 0 _Bool x$r_buff1_thd0; [L714] 0 _Bool x$r_buff1_thd1; [L715] 0 _Bool x$r_buff1_thd2; [L716] 0 _Bool x$r_buff1_thd3; [L717] 0 _Bool x$read_delayed; [L718] 0 int *x$read_delayed_var; [L719] 0 int x$w_buff0; [L720] 0 _Bool x$w_buff0_used; [L721] 0 int x$w_buff1; [L722] 0 _Bool x$w_buff1_used; [L724] 0 int y = 0; [L725] 0 _Bool weak$$choice0; [L726] 0 _Bool weak$$choice2; [L807] 0 pthread_t t1804; [L808] FCALL, FORK 0 pthread_create(&t1804, ((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] [L809] 0 pthread_t t1805; [L810] FCALL, FORK 0 pthread_create(&t1805, ((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] [L750] 2 x$w_buff1 = x$w_buff0 [L751] 2 x$w_buff0 = 2 [L752] 2 x$w_buff1_used = x$w_buff0_used [L753] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L755] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L756] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L757] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L758] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L759] 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L762] 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L811] 0 pthread_t t1806; [L812] FCALL, FORK 0 pthread_create(&t1806, ((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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L779] 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L782] 3 y = 2 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] 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) [L785] 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) [L786] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L786] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L787] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L787] 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 [L788] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L788] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L789] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L789] 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 [L730] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __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=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L736] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L737] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L737] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L738] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L739] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L739] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L740] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L765] 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) [L765] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L765] 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) [L765] 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) [L766] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L767] 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 [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L769] 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 [L772] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L774] 2 return 0; [L792] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L794] 3 return 0; [L743] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L745] 1 return 0; [L814] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L818] 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) [L818] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L818] 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) [L818] 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) [L819] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L819] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L820] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L820] 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 [L821] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L821] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L822] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L822] 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 [L825] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L826] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L827] 0 x$flush_delayed = weak$$choice2 [L828] 0 x$mem_tmp = x [L829] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1 [L829] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L829] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L830] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L830] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L830] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L830] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L831] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L831] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1 [L831] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L831] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L831] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L832] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L832] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L832] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L832] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L833] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L834] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L834] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L835] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L835] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L836] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) [L837] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L837] 0 x = x$flush_delayed ? x$mem_tmp : x [L838] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __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=7, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 91 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 8.4s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 62 SDtfs, 83 SDslu, 84 SDs, 0 SdLazy, 301 SolverSat, 94 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=312occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 177 NumberOfCodeBlocks, 177 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 17661 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...