/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-SemanticLooper.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix042_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 04:50:43,833 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 04:50:43,835 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 04:50:43,875 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 04:50:43,876 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 04:50:43,883 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 04:50:43,886 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 04:50:43,889 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 04:50:43,892 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 04:50:43,894 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 04:50:43,895 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 04:50:43,896 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 04:50:43,896 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 04:50:43,899 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 04:50:43,901 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 04:50:43,902 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 04:50:43,904 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 04:50:43,905 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 04:50:43,906 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 04:50:43,913 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 04:50:43,915 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 04:50:43,916 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 04:50:43,917 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 04:50:43,918 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 04:50:43,931 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 04:50:43,931 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 04:50:43,931 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 04:50:43,932 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 04:50:43,933 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 04:50:43,933 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 04:50:43,933 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 04:50:43,938 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 04:50:43,939 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 04:50:43,940 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 04:50:43,940 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 04:50:43,941 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 04:50:43,943 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 04:50:43,944 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 04:50:43,944 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 04:50:43,945 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 04:50:43,947 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 04:50:43,949 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-SemanticLooper.epf [2020-10-16 04:50:43,988 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 04:50:43,988 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 04:50:43,990 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 04:50:43,990 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 04:50:43,990 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 04:50:43,990 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 04:50:43,991 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 04:50:43,991 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 04:50:43,991 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 04:50:43,991 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 04:50:43,991 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 04:50:43,992 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 04:50:43,992 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 04:50:43,992 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 04:50:43,993 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 04:50:43,993 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 04:50:43,993 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 04:50:43,994 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 04:50:43,994 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 04:50:43,994 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 04:50:43,994 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 04:50:43,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 04:50:43,995 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 04:50:43,995 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 04:50:43,995 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 04:50:43,996 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 04:50:43,996 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 04:50:43,996 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 04:50:43,996 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 04:50:44,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 04:50:44,295 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 04:50:44,299 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 04:50:44,300 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 04:50:44,300 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 04:50:44,301 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_pso.oepc.i [2020-10-16 04:50:44,357 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fff7e585c/3f0a450650654c818790a662f0178dcc/FLAGef38163ca [2020-10-16 04:50:44,890 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 04:50:44,892 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_pso.oepc.i [2020-10-16 04:50:44,913 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fff7e585c/3f0a450650654c818790a662f0178dcc/FLAGef38163ca [2020-10-16 04:50:45,122 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fff7e585c/3f0a450650654c818790a662f0178dcc [2020-10-16 04:50:45,130 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 04:50:45,131 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 04:50:45,132 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 04:50:45,132 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 04:50:45,136 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 04:50:45,136 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:50:45" (1/1) ... [2020-10-16 04:50:45,140 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@591f4b5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:50:45, skipping insertion in model container [2020-10-16 04:50:45,140 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:50:45" (1/1) ... [2020-10-16 04:50:45,147 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 04:50:45,197 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 04:50:45,637 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:50:45,655 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 04:50:45,766 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:50:45,838 INFO L208 MainTranslator]: Completed translation [2020-10-16 04:50:45,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:50:45 WrapperNode [2020-10-16 04:50:45,838 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 04:50:45,839 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 04:50:45,839 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 04:50:45,839 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 04:50:45,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:50:45" (1/1) ... [2020-10-16 04:50:45,867 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:50:45" (1/1) ... [2020-10-16 04:50:45,895 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 04:50:45,896 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 04:50:45,896 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 04:50:45,896 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 04:50:45,904 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:50:45" (1/1) ... [2020-10-16 04:50:45,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:50:45" (1/1) ... [2020-10-16 04:50:45,909 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:50:45" (1/1) ... [2020-10-16 04:50:45,909 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:50:45" (1/1) ... [2020-10-16 04:50:45,919 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:50:45" (1/1) ... [2020-10-16 04:50:45,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:50:45" (1/1) ... [2020-10-16 04:50:45,927 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:50:45" (1/1) ... [2020-10-16 04:50:45,932 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 04:50:45,933 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 04:50:45,933 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 04:50:45,933 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 04:50:45,934 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:50: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 04:50:46,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 04:50:46,003 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 04:50:46,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 04:50:46,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 04:50:46,004 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 04:50:46,004 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 04:50:46,004 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 04:50:46,004 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 04:50:46,004 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 04:50:46,004 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 04:50:46,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 04:50:46,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 04:50:46,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 04:50:46,007 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 04:50:47,873 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 04:50:47,874 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 04:50:47,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:50:47 BoogieIcfgContainer [2020-10-16 04:50:47,876 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 04:50:47,877 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 04:50:47,877 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 04:50:47,881 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 04:50:47,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 04:50:45" (1/3) ... [2020-10-16 04:50:47,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bd84ca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:50:47, skipping insertion in model container [2020-10-16 04:50:47,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:50:45" (2/3) ... [2020-10-16 04:50:47,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bd84ca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:50:47, skipping insertion in model container [2020-10-16 04:50:47,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:50:47" (3/3) ... [2020-10-16 04:50:47,884 INFO L111 eAbstractionObserver]: Analyzing ICFG mix042_pso.oepc.i [2020-10-16 04:50:47,895 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 04:50:47,903 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 04:50:47,904 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 04:50:47,933 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,934 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,934 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,934 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,935 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,935 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,935 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,936 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,937 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,937 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,937 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,937 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,938 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,938 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,939 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,939 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,939 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,940 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,941 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,942 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,942 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,942 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,942 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,943 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,943 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,943 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,943 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,943 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,944 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,944 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,944 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,944 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,944 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,945 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,945 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,945 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,945 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,946 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,946 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,946 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,946 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,946 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,947 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,947 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,947 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,947 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,947 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,947 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,948 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,948 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,948 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,948 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,948 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,949 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,949 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,949 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,949 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,949 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,950 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,950 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,950 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,952 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,952 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,952 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,952 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,953 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,953 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,953 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,954 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,954 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,958 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,958 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,958 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,959 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,962 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,970 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,970 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,970 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,970 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,971 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,971 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,971 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,971 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,971 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,972 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,972 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,972 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,976 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,977 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,977 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,977 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,977 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,977 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,978 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,978 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,978 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,978 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:50:47,995 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 04:50:48,016 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 04:50:48,016 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 04:50:48,016 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 04:50:48,016 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 04:50:48,017 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 04:50:48,017 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 04:50:48,017 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 04:50:48,017 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 04:50:48,031 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2020-10-16 04:50:48,107 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2020-10-16 04:50:48,108 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:50:48,113 INFO L80 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2020-10-16 04:50:48,113 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 97 transitions, 209 flow [2020-10-16 04:50:48,120 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 94 transitions, 197 flow [2020-10-16 04:50:48,122 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 04:50:48,125 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 94 transitions, 197 flow [2020-10-16 04:50:48,128 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 94 transitions, 197 flow [2020-10-16 04:50:48,129 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 197 flow [2020-10-16 04:50:48,152 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2020-10-16 04:50:48,152 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:50:48,153 INFO L80 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2020-10-16 04:50:48,156 INFO L117 LiptonReduction]: Number of co-enabled transitions 1814 [2020-10-16 04:50:48,338 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2020-10-16 04:50:48,714 WARN L193 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 04:50:48,913 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:50:48,914 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:48,915 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:48,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:48,920 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:48,921 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:48,924 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:50:48,925 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:48,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:50:48,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:48,948 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:48,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:48,952 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:48,952 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:48,955 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:50:48,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:49,029 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:50:49,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:49,031 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:49,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:49,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:49,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:49,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:50:49,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:49,056 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:49,057 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:49,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:49,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:49,061 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:49,061 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:49,064 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:50:49,064 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:49,251 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:49,252 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:49,253 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:49,253 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:49,256 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:49,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:49,259 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:50:49,259 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:49,276 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:50:49,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:49,278 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:49,279 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:49,304 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:49,305 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:49,308 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:50:49,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:49,389 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:50:49,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:49,390 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:49,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:49,392 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:49,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:49,395 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:50:49,395 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:49,410 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:50:49,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:49,411 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:49,412 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:49,414 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:49,414 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:49,416 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:50:49,416 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:49,498 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:49,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:49,500 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:49,500 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:49,502 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:49,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:49,504 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:50:49,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:49,518 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:50:49,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:49,519 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:49,520 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:49,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:49,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:49,523 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:50:49,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:49,629 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:50:49,629 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:49,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:49,631 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:49,633 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:49,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:49,636 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:50:49,636 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:49,658 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:49,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:49,660 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:49,660 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:49,663 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:49,664 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:49,666 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:50:49,667 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:49,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:49,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:49,849 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:50:49,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:50:49,851 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:50:49,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:50:49,854 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:50:49,854 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:50:49,857 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:50:49,857 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:50:49,860 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:50:49,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:50:49,862 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:50:49,862 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:50:49,915 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:50:49,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:50:49,919 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:50:49,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:50:49,958 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:50:49,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:49,960 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:49,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:49,963 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:49,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:49,966 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:50:49,966 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:49,988 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:49,989 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:49,990 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:49,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:49,993 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:49,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:49,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:50:49,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:50,174 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 04:50:50,309 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 04:50:50,397 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:50:50,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:50:50,400 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:50:50,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:50:50,436 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:50,436 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:50,440 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:50:50,441 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:50:50,443 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:50:50,443 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:50:50,444 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:50:50,445 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:50:50,446 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:50:50,447 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:50:50,448 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:50:50,449 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:50:50,451 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:50:50,451 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:50:50,487 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:50,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:50,488 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:50,489 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:50,490 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:50,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:50,492 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:50:50,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:50,553 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:50,554 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:50,555 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:50,555 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:50,556 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:50,557 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:50,558 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:50:50,559 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:50,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:50:50,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:50,611 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:50,612 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:50,613 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:50,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:50,615 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:50:50,615 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:50,629 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:50,629 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:50,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:50,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:50,632 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:50,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:50,633 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:50:50,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:50,834 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:50:50,834 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:51,017 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:51,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:51,018 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:51,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:51,020 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:51,020 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:51,021 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:50:51,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:51,036 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:51,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:51,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:51,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:50:51,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:50:51,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:51,040 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:50:51,041 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:50:51,920 WARN L193 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2020-10-16 04:50:52,027 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-16 04:50:52,052 INFO L132 LiptonReduction]: Checked pairs total: 4574 [2020-10-16 04:50:52,052 INFO L134 LiptonReduction]: Total number of compositions: 79 [2020-10-16 04:50:52,055 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3935 [2020-10-16 04:50:52,061 INFO L129 PetriNetUnfolder]: 0/4 cut-off events. [2020-10-16 04:50:52,061 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:50:52,061 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:50:52,062 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2020-10-16 04:50:52,062 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:50:52,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:50:52,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1055953, now seen corresponding path program 1 times [2020-10-16 04:50:52,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:50:52,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996657055] [2020-10-16 04:50:52,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:50:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:50:52,271 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 04:50:52,272 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996657055] [2020-10-16 04:50:52,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:50:52,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:50:52,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255673167] [2020-10-16 04:50:52,283 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:50:52,283 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:50:52,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:50:52,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:50:52,301 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 176 [2020-10-16 04:50:52,303 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 57 flow. Second operand 3 states. [2020-10-16 04:50:52,304 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:50:52,304 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 176 [2020-10-16 04:50:52,305 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:50:52,381 INFO L129 PetriNetUnfolder]: 49/136 cut-off events. [2020-10-16 04:50:52,381 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:50:52,382 INFO L80 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 136 events. 49/136 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 595 event pairs, 38 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 222. Up to 65 conditions per place. [2020-10-16 04:50:52,385 INFO L132 encePairwiseOnDemand]: 173/176 looper letters, 9 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2020-10-16 04:50:52,385 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 27 transitions, 85 flow [2020-10-16 04:50:52,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:50:52,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:50:52,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 468 transitions. [2020-10-16 04:50:52,402 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8863636363636364 [2020-10-16 04:50:52,403 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 468 transitions. [2020-10-16 04:50:52,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 468 transitions. [2020-10-16 04:50:52,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:50:52,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 468 transitions. [2020-10-16 04:50:52,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:50:52,425 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:50:52,425 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:50:52,427 INFO L185 Difference]: Start difference. First operand has 34 places, 24 transitions, 57 flow. Second operand 3 states and 468 transitions. [2020-10-16 04:50:52,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 27 transitions, 85 flow [2020-10-16 04:50:52,431 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 04:50:52,433 INFO L241 Difference]: Finished difference. Result has 32 places, 23 transitions, 56 flow [2020-10-16 04:50:52,435 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, 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 04:50:52,436 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2020-10-16 04:50:52,436 INFO L481 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 56 flow [2020-10-16 04:50:52,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:50:52,437 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:50:52,437 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:50:52,437 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 04:50:52,437 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:50:52,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:50:52,438 INFO L82 PathProgramCache]: Analyzing trace with hash 779190523, now seen corresponding path program 1 times [2020-10-16 04:50:52,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:50:52,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613673272] [2020-10-16 04:50:52,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:50:52,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:50:52,507 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 04:50:52,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613673272] [2020-10-16 04:50:52,508 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:50:52,508 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:50:52,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88694628] [2020-10-16 04:50:52,510 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:50:52,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:50:52,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:50:52,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:50:52,512 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 176 [2020-10-16 04:50:52,512 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 56 flow. Second operand 3 states. [2020-10-16 04:50:52,513 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:50:52,513 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 176 [2020-10-16 04:50:52,513 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:50:52,532 INFO L129 PetriNetUnfolder]: 7/48 cut-off events. [2020-10-16 04:50:52,532 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:50:52,533 INFO L80 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 48 events. 7/48 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 116 event pairs, 2 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 68. Up to 17 conditions per place. [2020-10-16 04:50:52,533 INFO L132 encePairwiseOnDemand]: 172/176 looper letters, 3 selfloop transitions, 3 changer transitions 2/26 dead transitions. [2020-10-16 04:50:52,533 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 26 transitions, 78 flow [2020-10-16 04:50:52,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:50:52,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:50:52,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2020-10-16 04:50:52,536 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8920454545454546 [2020-10-16 04:50:52,536 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 471 transitions. [2020-10-16 04:50:52,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 471 transitions. [2020-10-16 04:50:52,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:50:52,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 471 transitions. [2020-10-16 04:50:52,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:50:52,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:50:52,540 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:50:52,540 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 56 flow. Second operand 3 states and 471 transitions. [2020-10-16 04:50:52,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 26 transitions, 78 flow [2020-10-16 04:50:52,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 26 transitions, 74 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:50:52,542 INFO L241 Difference]: Finished difference. Result has 33 places, 24 transitions, 69 flow [2020-10-16 04:50:52,542 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2020-10-16 04:50:52,542 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, -1 predicate places. [2020-10-16 04:50:52,548 INFO L481 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 69 flow [2020-10-16 04:50:52,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:50:52,548 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:50:52,549 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:50:52,549 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 04:50:52,549 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:50:52,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:50:52,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1615138927, now seen corresponding path program 1 times [2020-10-16 04:50:52,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:50:52,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526888791] [2020-10-16 04:50:52,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:50:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:50:52,673 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 04:50:52,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526888791] [2020-10-16 04:50:52,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:50:52,673 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:50:52,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933745120] [2020-10-16 04:50:52,674 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:50:52,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:50:52,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:50:52,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:50:52,677 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 176 [2020-10-16 04:50:52,678 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 69 flow. Second operand 3 states. [2020-10-16 04:50:52,678 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:50:52,678 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 176 [2020-10-16 04:50:52,679 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:50:52,701 INFO L129 PetriNetUnfolder]: 2/30 cut-off events. [2020-10-16 04:50:52,701 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2020-10-16 04:50:52,702 INFO L80 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 30 events. 2/30 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 56 event pairs, 0 based on Foata normal form. 2/32 useless extension candidates. Maximal degree in co-relation 45. Up to 8 conditions per place. [2020-10-16 04:50:52,702 INFO L132 encePairwiseOnDemand]: 173/176 looper letters, 1 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2020-10-16 04:50:52,702 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 24 transitions, 75 flow [2020-10-16 04:50:52,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:50:52,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:50:52,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions. [2020-10-16 04:50:52,704 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8939393939393939 [2020-10-16 04:50:52,705 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 472 transitions. [2020-10-16 04:50:52,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 472 transitions. [2020-10-16 04:50:52,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:50:52,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 472 transitions. [2020-10-16 04:50:52,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:50:52,708 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:50:52,708 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:50:52,708 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 69 flow. Second operand 3 states and 472 transitions. [2020-10-16 04:50:52,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 24 transitions, 75 flow [2020-10-16 04:50:52,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 24 transitions, 72 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 04:50:52,710 INFO L241 Difference]: Finished difference. Result has 34 places, 24 transitions, 74 flow [2020-10-16 04:50:52,710 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2020-10-16 04:50:52,710 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 0 predicate places. [2020-10-16 04:50:52,710 INFO L481 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 74 flow [2020-10-16 04:50:52,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:50:52,711 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:50:52,711 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:50:52,711 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 04:50:52,711 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:50:52,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:50:52,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1477795191, now seen corresponding path program 1 times [2020-10-16 04:50:52,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:50:52,712 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126501607] [2020-10-16 04:50:52,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:50:52,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:50:52,779 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 04:50:52,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126501607] [2020-10-16 04:50:52,780 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:50:52,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:50:52,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291848467] [2020-10-16 04:50:52,781 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:50:52,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:50:52,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:50:52,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:50:52,783 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 176 [2020-10-16 04:50:52,783 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 74 flow. Second operand 4 states. [2020-10-16 04:50:52,783 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:50:52,783 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 176 [2020-10-16 04:50:52,784 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:50:52,840 INFO L129 PetriNetUnfolder]: 38/105 cut-off events. [2020-10-16 04:50:52,840 INFO L130 PetriNetUnfolder]: For 10/16 co-relation queries the response was YES. [2020-10-16 04:50:52,841 INFO L80 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 105 events. 38/105 cut-off events. For 10/16 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 433 event pairs, 14 based on Foata normal form. 10/107 useless extension candidates. Maximal degree in co-relation 209. Up to 56 conditions per place. [2020-10-16 04:50:52,842 INFO L132 encePairwiseOnDemand]: 170/176 looper letters, 7 selfloop transitions, 7 changer transitions 2/34 dead transitions. [2020-10-16 04:50:52,842 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 34 transitions, 126 flow [2020-10-16 04:50:52,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:50:52,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:50:52,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 748 transitions. [2020-10-16 04:50:52,845 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.85 [2020-10-16 04:50:52,846 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 748 transitions. [2020-10-16 04:50:52,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 748 transitions. [2020-10-16 04:50:52,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:50:52,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 748 transitions. [2020-10-16 04:50:52,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:50:52,850 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:50:52,850 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:50:52,850 INFO L185 Difference]: Start difference. First operand has 34 places, 24 transitions, 74 flow. Second operand 5 states and 748 transitions. [2020-10-16 04:50:52,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 34 transitions, 126 flow [2020-10-16 04:50:52,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 34 transitions, 122 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:50:52,852 INFO L241 Difference]: Finished difference. Result has 39 places, 30 transitions, 124 flow [2020-10-16 04:50:52,852 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2020-10-16 04:50:52,852 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2020-10-16 04:50:52,853 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 124 flow [2020-10-16 04:50:52,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:50:52,853 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:50:52,853 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:50:52,853 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 04:50:52,853 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:50:52,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:50:52,854 INFO L82 PathProgramCache]: Analyzing trace with hash -638446953, now seen corresponding path program 1 times [2020-10-16 04:50:52,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:50:52,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505408960] [2020-10-16 04:50:52,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:50:52,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:50:53,020 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 04:50:53,021 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505408960] [2020-10-16 04:50:53,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:50:53,024 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:50:53,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508079751] [2020-10-16 04:50:53,025 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:50:53,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:50:53,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:50:53,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:50:53,027 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 176 [2020-10-16 04:50:53,029 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 124 flow. Second operand 5 states. [2020-10-16 04:50:53,029 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:50:53,029 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 176 [2020-10-16 04:50:53,029 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:50:53,123 INFO L129 PetriNetUnfolder]: 24/86 cut-off events. [2020-10-16 04:50:53,123 INFO L130 PetriNetUnfolder]: For 81/159 co-relation queries the response was YES. [2020-10-16 04:50:53,125 INFO L80 FinitePrefix]: Finished finitePrefix Result has 288 conditions, 86 events. 24/86 cut-off events. For 81/159 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 314 event pairs, 2 based on Foata normal form. 27/110 useless extension candidates. Maximal degree in co-relation 273. Up to 52 conditions per place. [2020-10-16 04:50:53,125 INFO L132 encePairwiseOnDemand]: 170/176 looper letters, 5 selfloop transitions, 13 changer transitions 4/40 dead transitions. [2020-10-16 04:50:53,126 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 40 transitions, 226 flow [2020-10-16 04:50:53,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:50:53,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:50:53,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1046 transitions. [2020-10-16 04:50:53,129 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.849025974025974 [2020-10-16 04:50:53,130 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1046 transitions. [2020-10-16 04:50:53,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1046 transitions. [2020-10-16 04:50:53,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:50:53,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1046 transitions. [2020-10-16 04:50:53,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:50:53,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:50:53,136 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:50:53,136 INFO L185 Difference]: Start difference. First operand has 39 places, 30 transitions, 124 flow. Second operand 7 states and 1046 transitions. [2020-10-16 04:50:53,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 40 transitions, 226 flow [2020-10-16 04:50:53,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 40 transitions, 222 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 04:50:53,140 INFO L241 Difference]: Finished difference. Result has 47 places, 36 transitions, 208 flow [2020-10-16 04:50:53,140 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=208, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2020-10-16 04:50:53,141 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2020-10-16 04:50:53,141 INFO L481 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 208 flow [2020-10-16 04:50:53,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:50:53,141 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:50:53,141 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:50:53,141 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 04:50:53,143 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:50:53,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:50:53,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1676733046, now seen corresponding path program 1 times [2020-10-16 04:50:53,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:50:53,144 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996114330] [2020-10-16 04:50:53,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:50:53,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:50:53,350 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 04:50:53,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996114330] [2020-10-16 04:50:53,351 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:50:53,351 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:50:53,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554782458] [2020-10-16 04:50:53,352 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:50:53,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:50:53,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:50:53,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:50:53,354 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 176 [2020-10-16 04:50:53,355 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 208 flow. Second operand 6 states. [2020-10-16 04:50:53,355 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:50:53,355 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 176 [2020-10-16 04:50:53,355 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:50:53,448 INFO L129 PetriNetUnfolder]: 13/66 cut-off events. [2020-10-16 04:50:53,448 INFO L130 PetriNetUnfolder]: For 206/339 co-relation queries the response was YES. [2020-10-16 04:50:53,449 INFO L80 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 66 events. 13/66 cut-off events. For 206/339 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 225 event pairs, 0 based on Foata normal form. 35/98 useless extension candidates. Maximal degree in co-relation 266. Up to 41 conditions per place. [2020-10-16 04:50:53,450 INFO L132 encePairwiseOnDemand]: 170/176 looper letters, 2 selfloop transitions, 17 changer transitions 3/40 dead transitions. [2020-10-16 04:50:53,450 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 40 transitions, 284 flow [2020-10-16 04:50:53,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 04:50:53,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 04:50:53,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1338 transitions. [2020-10-16 04:50:53,455 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8446969696969697 [2020-10-16 04:50:53,455 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1338 transitions. [2020-10-16 04:50:53,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1338 transitions. [2020-10-16 04:50:53,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:50:53,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1338 transitions. [2020-10-16 04:50:53,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 04:50:53,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 04:50:53,463 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 04:50:53,463 INFO L185 Difference]: Start difference. First operand has 47 places, 36 transitions, 208 flow. Second operand 9 states and 1338 transitions. [2020-10-16 04:50:53,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 40 transitions, 284 flow [2020-10-16 04:50:53,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 40 transitions, 248 flow, removed 13 selfloop flow, removed 3 redundant places. [2020-10-16 04:50:53,469 INFO L241 Difference]: Finished difference. Result has 55 places, 37 transitions, 228 flow [2020-10-16 04:50:53,470 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=228, PETRI_PLACES=55, PETRI_TRANSITIONS=37} [2020-10-16 04:50:53,470 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 21 predicate places. [2020-10-16 04:50:53,470 INFO L481 AbstractCegarLoop]: Abstraction has has 55 places, 37 transitions, 228 flow [2020-10-16 04:50:53,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:50:53,470 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:50:53,471 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 04:50:53,471 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 04:50:53,471 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:50:53,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:50:53,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1999060385, now seen corresponding path program 1 times [2020-10-16 04:50:53,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:50:53,472 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816699500] [2020-10-16 04:50:53,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:50:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:50:53,533 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 04:50:53,533 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816699500] [2020-10-16 04:50:53,533 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:50:53,534 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:50:53,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546356467] [2020-10-16 04:50:53,534 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:50:53,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:50:53,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:50:53,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:50:53,536 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 176 [2020-10-16 04:50:53,537 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 37 transitions, 228 flow. Second operand 4 states. [2020-10-16 04:50:53,537 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:50:53,537 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 176 [2020-10-16 04:50:53,537 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:50:53,609 INFO L129 PetriNetUnfolder]: 22/106 cut-off events. [2020-10-16 04:50:53,609 INFO L130 PetriNetUnfolder]: For 270/300 co-relation queries the response was YES. [2020-10-16 04:50:53,610 INFO L80 FinitePrefix]: Finished finitePrefix Result has 397 conditions, 106 events. 22/106 cut-off events. For 270/300 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 489 event pairs, 0 based on Foata normal form. 1/96 useless extension candidates. Maximal degree in co-relation 375. Up to 36 conditions per place. [2020-10-16 04:50:53,611 INFO L132 encePairwiseOnDemand]: 173/176 looper letters, 3 selfloop transitions, 1 changer transitions 1/38 dead transitions. [2020-10-16 04:50:53,611 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 38 transitions, 240 flow [2020-10-16 04:50:53,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:50:53,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:50:53,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 602 transitions. [2020-10-16 04:50:53,614 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8551136363636364 [2020-10-16 04:50:53,614 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 602 transitions. [2020-10-16 04:50:53,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 602 transitions. [2020-10-16 04:50:53,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:50:53,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 602 transitions. [2020-10-16 04:50:53,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:50:53,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:50:53,617 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:50:53,617 INFO L185 Difference]: Start difference. First operand has 55 places, 37 transitions, 228 flow. Second operand 4 states and 602 transitions. [2020-10-16 04:50:53,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 38 transitions, 240 flow [2020-10-16 04:50:53,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 38 transitions, 182 flow, removed 14 selfloop flow, removed 8 redundant places. [2020-10-16 04:50:53,625 INFO L241 Difference]: Finished difference. Result has 51 places, 37 transitions, 177 flow [2020-10-16 04:50:53,625 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=177, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2020-10-16 04:50:53,626 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2020-10-16 04:50:53,626 INFO L481 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 177 flow [2020-10-16 04:50:53,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:50:53,626 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:50:53,626 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 04:50:53,626 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 04:50:53,626 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:50:53,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:50:53,626 INFO L82 PathProgramCache]: Analyzing trace with hash -711242463, now seen corresponding path program 2 times [2020-10-16 04:50:53,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:50:53,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109368246] [2020-10-16 04:50:53,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:50:53,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:50:53,955 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 04:50:53,956 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109368246] [2020-10-16 04:50:53,956 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:50:53,956 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:50:53,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566411354] [2020-10-16 04:50:53,957 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:50:53,957 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:50:53,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:50:53,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:50:53,959 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 176 [2020-10-16 04:50:53,960 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 177 flow. Second operand 7 states. [2020-10-16 04:50:53,960 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:50:53,960 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 176 [2020-10-16 04:50:53,960 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:50:54,148 INFO L129 PetriNetUnfolder]: 66/285 cut-off events. [2020-10-16 04:50:54,148 INFO L130 PetriNetUnfolder]: For 387/493 co-relation queries the response was YES. [2020-10-16 04:50:54,150 INFO L80 FinitePrefix]: Finished finitePrefix Result has 834 conditions, 285 events. 66/285 cut-off events. For 387/493 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 1918 event pairs, 5 based on Foata normal form. 44/315 useless extension candidates. Maximal degree in co-relation 815. Up to 68 conditions per place. [2020-10-16 04:50:54,151 INFO L132 encePairwiseOnDemand]: 169/176 looper letters, 13 selfloop transitions, 7 changer transitions 3/52 dead transitions. [2020-10-16 04:50:54,151 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 271 flow [2020-10-16 04:50:54,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 04:50:54,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 04:50:54,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 810 transitions. [2020-10-16 04:50:54,154 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7670454545454546 [2020-10-16 04:50:54,154 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 810 transitions. [2020-10-16 04:50:54,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 810 transitions. [2020-10-16 04:50:54,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:50:54,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 810 transitions. [2020-10-16 04:50:54,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 04:50:54,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 04:50:54,159 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 04:50:54,159 INFO L185 Difference]: Start difference. First operand has 51 places, 37 transitions, 177 flow. Second operand 6 states and 810 transitions. [2020-10-16 04:50:54,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 271 flow [2020-10-16 04:50:54,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 52 transitions, 266 flow, removed 2 selfloop flow, removed 2 redundant places. [2020-10-16 04:50:54,165 INFO L241 Difference]: Finished difference. Result has 56 places, 42 transitions, 218 flow [2020-10-16 04:50:54,165 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=218, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2020-10-16 04:50:54,166 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 22 predicate places. [2020-10-16 04:50:54,166 INFO L481 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 218 flow [2020-10-16 04:50:54,166 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:50:54,166 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:50:54,166 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 04:50:54,166 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 04:50:54,166 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:50:54,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:50:54,167 INFO L82 PathProgramCache]: Analyzing trace with hash -733213343, now seen corresponding path program 3 times [2020-10-16 04:50:54,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:50:54,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490903732] [2020-10-16 04:50:54,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:50:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:50:54,208 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 04:50:54,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490903732] [2020-10-16 04:50:54,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:50:54,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:50:54,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7731574] [2020-10-16 04:50:54,209 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:50:54,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:50:54,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:50:54,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:50:54,211 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 176 [2020-10-16 04:50:54,211 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 218 flow. Second operand 3 states. [2020-10-16 04:50:54,211 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:50:54,211 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 176 [2020-10-16 04:50:54,211 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:50:54,271 INFO L129 PetriNetUnfolder]: 92/399 cut-off events. [2020-10-16 04:50:54,272 INFO L130 PetriNetUnfolder]: For 382/402 co-relation queries the response was YES. [2020-10-16 04:50:54,274 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1210 conditions, 399 events. 92/399 cut-off events. For 382/402 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3026 event pairs, 19 based on Foata normal form. 5/389 useless extension candidates. Maximal degree in co-relation 1187. Up to 104 conditions per place. [2020-10-16 04:50:54,275 INFO L132 encePairwiseOnDemand]: 173/176 looper letters, 2 selfloop transitions, 2 changer transitions 5/42 dead transitions. [2020-10-16 04:50:54,275 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 42 transitions, 230 flow [2020-10-16 04:50:54,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:50:54,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:50:54,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 468 transitions. [2020-10-16 04:50:54,277 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8863636363636364 [2020-10-16 04:50:54,277 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 468 transitions. [2020-10-16 04:50:54,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 468 transitions. [2020-10-16 04:50:54,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:50:54,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 468 transitions. [2020-10-16 04:50:54,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:50:54,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:50:54,280 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:50:54,280 INFO L185 Difference]: Start difference. First operand has 56 places, 42 transitions, 218 flow. Second operand 3 states and 468 transitions. [2020-10-16 04:50:54,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 42 transitions, 230 flow [2020-10-16 04:50:54,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 42 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:50:54,289 INFO L241 Difference]: Finished difference. Result has 57 places, 37 transitions, 196 flow [2020-10-16 04:50:54,290 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=57, PETRI_TRANSITIONS=37} [2020-10-16 04:50:54,290 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 23 predicate places. [2020-10-16 04:50:54,290 INFO L481 AbstractCegarLoop]: Abstraction has has 57 places, 37 transitions, 196 flow [2020-10-16 04:50:54,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:50:54,290 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:50:54,291 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 04:50:54,291 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 04:50:54,291 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:50:54,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:50:54,291 INFO L82 PathProgramCache]: Analyzing trace with hash -145775681, now seen corresponding path program 4 times [2020-10-16 04:50:54,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:50:54,292 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536790610] [2020-10-16 04:50:54,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:50:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:50:54,342 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:50:54,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:50:54,384 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:50:54,434 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 04:50:54,434 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 04:50:54,434 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 04:50:54,435 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 04:50:54,451 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1018] [1018] L2-->L848: Formula: (let ((.cse6 (= (mod ~a$w_buff0_used~0_In1596700666 256) 0)) (.cse7 (= (mod ~a$r_buff0_thd0~0_In1596700666 256) 0)) (.cse8 (= (mod ~a$w_buff1_used~0_In1596700666 256) 0)) (.cse9 (= (mod ~a$r_buff1_thd0~0_In1596700666 256) 0))) (let ((.cse4 (or .cse8 .cse9)) (.cse2 (not .cse9)) (.cse3 (not .cse8)) (.cse0 (not .cse7)) (.cse1 (not .cse6)) (.cse5 (or .cse6 .cse7))) (and (or (and (= ~a~0_Out1596700666 ~a$w_buff0~0_In1596700666) .cse0 .cse1) (and (or (and (= ~a~0_Out1596700666 ~a$w_buff1~0_In1596700666) .cse2 .cse3) (and .cse4 (= ~a~0_In1596700666 ~a~0_Out1596700666))) .cse5)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1596700666 0)) (or (and .cse4 (= ~a$w_buff1_used~0_Out1596700666 ~a$w_buff1_used~0_In1596700666)) (and (= ~a$w_buff1_used~0_Out1596700666 0) .cse2 .cse3)) (= ~a$r_buff1_thd0~0_In1596700666 ~a$r_buff1_thd0~0_Out1596700666) (or (and .cse0 (= ~a$w_buff0_used~0_Out1596700666 0) .cse1) (and (= ~a$w_buff0_used~0_In1596700666 ~a$w_buff0_used~0_Out1596700666) .cse5)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out1596700666 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1596700666|) (= ~a$r_buff0_thd0~0_In1596700666 ~a$r_buff0_thd0~0_Out1596700666)))) InVars {~a~0=~a~0_In1596700666, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1596700666|, ~a$w_buff1~0=~a$w_buff1~0_In1596700666, ~a$w_buff0~0=~a$w_buff0~0_In1596700666, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In1596700666, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1596700666, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1596700666, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1596700666} OutVars{ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1596700666|, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out1596700666, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1596700666|, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1596700666|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_Out1596700666, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1596700666|, ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1596700666|, ~a~0=~a~0_Out1596700666, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1596700666|, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1596700666|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1596700666, ~a$w_buff1~0=~a$w_buff1~0_In1596700666, ~a$w_buff0~0=~a$w_buff0~0_In1596700666, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out1596700666, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out1596700666} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite47, ~a$r_buff1_thd0~0, ~a$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite48, ~a$w_buff1_used~0] because there is no mapped edge [2020-10-16 04:50:54,462 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 04:50:54,462 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:54,466 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 04:50:54,466 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:54,466 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 04:50:54,467 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:54,467 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 04:50:54,467 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:54,468 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 04:50:54,468 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:54,468 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 04:50:54,468 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:54,468 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 04:50:54,468 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:54,469 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 04:50:54,469 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:54,469 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 04:50:54,470 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:54,470 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 04:50:54,470 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:54,470 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 04:50:54,470 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:54,470 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 04:50:54,470 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:54,471 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 04:50:54,471 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:54,471 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 04:50:54,471 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:54,471 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 04:50:54,472 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:54,472 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 04:50:54,472 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:54,472 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 04:50:54,472 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:54,472 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 04:50:54,473 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:54,478 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 04:50:54,478 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:54,478 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 04:50:54,479 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:54,479 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 04:50:54,479 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:54,479 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 04:50:54,479 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:54,479 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 04:50:54,479 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:54,480 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 04:50:54,480 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:54,480 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 04:50:54,480 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:54,480 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 04:50:54,480 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:54,481 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 04:50:54,481 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:54,481 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 04:50:54,481 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:54,481 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 04:50:54,481 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:54,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 04:50:54 BasicIcfg [2020-10-16 04:50:54,577 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 04:50:54,579 INFO L168 Benchmark]: Toolchain (without parser) took 9448.08 ms. Allocated memory was 258.5 MB in the beginning and 492.8 MB in the end (delta: 234.4 MB). Free memory was 214.5 MB in the beginning and 259.9 MB in the end (delta: -45.4 MB). Peak memory consumption was 189.0 MB. Max. memory is 14.2 GB. [2020-10-16 04:50:54,580 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 258.5 MB. Free memory is still 234.9 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 04:50:54,580 INFO L168 Benchmark]: CACSL2BoogieTranslator took 706.85 ms. Allocated memory was 258.5 MB in the beginning and 334.0 MB in the end (delta: 75.5 MB). Free memory was 214.5 MB in the beginning and 284.7 MB in the end (delta: -70.3 MB). Peak memory consumption was 32.7 MB. Max. memory is 14.2 GB. [2020-10-16 04:50:54,581 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.39 ms. Allocated memory is still 334.0 MB. Free memory was 282.2 MB in the beginning and 279.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:50:54,582 INFO L168 Benchmark]: Boogie Preprocessor took 36.44 ms. Allocated memory is still 334.0 MB. Free memory was 279.7 MB in the beginning and 277.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:50:54,582 INFO L168 Benchmark]: RCFGBuilder took 1943.66 ms. Allocated memory was 334.0 MB in the beginning and 368.6 MB in the end (delta: 34.6 MB). Free memory was 277.2 MB in the beginning and 200.5 MB in the end (delta: 76.6 MB). Peak memory consumption was 111.2 MB. Max. memory is 14.2 GB. [2020-10-16 04:50:54,583 INFO L168 Benchmark]: TraceAbstraction took 6700.01 ms. Allocated memory was 368.6 MB in the beginning and 492.8 MB in the end (delta: 124.3 MB). Free memory was 200.5 MB in the beginning and 259.9 MB in the end (delta: -59.3 MB). Peak memory consumption was 64.9 MB. Max. memory is 14.2 GB. [2020-10-16 04:50:54,587 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.38 ms. Allocated memory is still 258.5 MB. Free memory is still 234.9 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 706.85 ms. Allocated memory was 258.5 MB in the beginning and 334.0 MB in the end (delta: 75.5 MB). Free memory was 214.5 MB in the beginning and 284.7 MB in the end (delta: -70.3 MB). Peak memory consumption was 32.7 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 56.39 ms. Allocated memory is still 334.0 MB. Free memory was 282.2 MB in the beginning and 279.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 36.44 ms. Allocated memory is still 334.0 MB. Free memory was 279.7 MB in the beginning and 277.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1943.66 ms. Allocated memory was 334.0 MB in the beginning and 368.6 MB in the end (delta: 34.6 MB). Free memory was 277.2 MB in the beginning and 200.5 MB in the end (delta: 76.6 MB). Peak memory consumption was 111.2 MB. Max. memory is 14.2 GB. * TraceAbstraction took 6700.01 ms. Allocated memory was 368.6 MB in the beginning and 492.8 MB in the end (delta: 124.3 MB). Free memory was 200.5 MB in the beginning and 259.9 MB in the end (delta: -59.3 MB). Peak memory consumption was 64.9 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1284 VarBasedMoverChecksPositive, 66 VarBasedMoverChecksNegative, 9 SemBasedMoverChecksPositive, 57 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 164 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.9s, 102 PlacesBefore, 34 PlacesAfterwards, 94 TransitionsBefore, 24 TransitionsAfterwards, 1814 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 79 TotalNumberOfCompositions, 4574 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; [L704] 0 int __unbuffered_p2_EBX = 0; [L706] 0 int a = 0; [L707] 0 _Bool a$flush_delayed; [L708] 0 int a$mem_tmp; [L709] 0 _Bool a$r_buff0_thd0; [L710] 0 _Bool a$r_buff0_thd1; [L711] 0 _Bool a$r_buff0_thd2; [L712] 0 _Bool a$r_buff0_thd3; [L713] 0 _Bool a$r_buff1_thd0; [L714] 0 _Bool a$r_buff1_thd1; [L715] 0 _Bool a$r_buff1_thd2; [L716] 0 _Bool a$r_buff1_thd3; [L717] 0 _Bool a$read_delayed; [L718] 0 int *a$read_delayed_var; [L719] 0 int a$w_buff0; [L720] 0 _Bool a$w_buff0_used; [L721] 0 int a$w_buff1; [L722] 0 _Bool a$w_buff1_used; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L832] 0 pthread_t t1111; [L833] FCALL, FORK 0 pthread_create(&t1111, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L834] 0 pthread_t t1112; [L835] FCALL, FORK 0 pthread_create(&t1112, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L736] 1 a$w_buff1 = a$w_buff0 [L737] 1 a$w_buff0 = 1 [L738] 1 a$w_buff1_used = a$w_buff0_used [L739] 1 a$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L741] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L742] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L743] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L744] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L745] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L768] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L836] 0 pthread_t t1113; [L837] FCALL, FORK 0 pthread_create(&t1113, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L785] 3 y = 2 [L788] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L791] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L771] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L771] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L771] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L771] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L772] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L772] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L773] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L773] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L774] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L774] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L775] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L775] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L794] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 3 a$flush_delayed = weak$$choice2 [L797] 3 a$mem_tmp = a [L798] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L798] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L799] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L799] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L800] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L800] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1) [L800] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L800] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L801] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L801] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L802] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L802] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0 [L802] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L802] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L803] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L804] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L804] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L805] 3 __unbuffered_p2_EBX = a [L806] EXPR 3 a$flush_delayed ? a$mem_tmp : a [L806] 3 a = a$flush_delayed ? a$mem_tmp : a [L807] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, z=1] [L751] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L751] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L752] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L752] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L753] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L753] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L754] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L754] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L755] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L755] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L810] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L810] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L811] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L811] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L812] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L812] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L813] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L813] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L814] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L814] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 2 return 0; [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L839] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L850] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 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: 6.4s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 32 SDtfs, 17 SDslu, 15 SDs, 0 SdLazy, 174 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=228occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 153 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 122 ConstructedInterpolants, 0 QuantifiedInterpolants, 10393 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...