/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix024_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 01:20:30,605 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 01:20:30,607 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 01:20:30,631 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 01:20:30,631 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 01:20:30,632 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 01:20:30,634 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 01:20:30,635 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 01:20:30,637 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 01:20:30,638 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 01:20:30,639 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 01:20:30,640 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 01:20:30,640 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 01:20:30,641 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 01:20:30,642 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 01:20:30,643 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 01:20:30,645 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 01:20:30,648 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 01:20:30,650 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 01:20:30,652 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 01:20:30,656 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 01:20:30,657 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 01:20:30,659 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 01:20:30,660 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 01:20:30,662 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 01:20:30,662 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 01:20:30,663 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 01:20:30,667 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 01:20:30,668 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 01:20:30,670 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 01:20:30,670 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 01:20:30,671 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 01:20:30,671 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 01:20:30,672 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 01:20:30,673 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 01:20:30,673 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 01:20:30,674 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 01:20:30,675 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 01:20:30,675 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 01:20:30,683 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 01:20:30,684 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 01:20:30,687 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2020-10-16 01:20:30,730 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 01:20:30,730 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 01:20:30,733 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 01:20:30,733 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 01:20:30,734 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 01:20:30,734 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 01:20:30,734 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 01:20:30,735 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 01:20:30,735 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 01:20:30,735 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 01:20:30,735 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 01:20:30,735 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 01:20:30,736 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 01:20:30,736 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 01:20:30,737 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 01:20:30,737 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 01:20:30,737 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 01:20:30,737 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 01:20:30,738 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 01:20:30,738 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 01:20:30,738 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 01:20:30,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:20:30,738 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 01:20:30,738 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 01:20:30,739 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 01:20:30,739 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 01:20:30,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 01:20:30,740 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 01:20:30,740 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 01:20:31,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 01:20:31,057 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 01:20:31,060 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 01:20:31,061 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 01:20:31,062 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 01:20:31,062 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_pso.oepc.i [2020-10-16 01:20:31,129 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbf59a6f9/acff81c2602540ac8ec98c37eebe2329/FLAG29736b4d8 [2020-10-16 01:20:31,715 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 01:20:31,716 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_pso.oepc.i [2020-10-16 01:20:31,744 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbf59a6f9/acff81c2602540ac8ec98c37eebe2329/FLAG29736b4d8 [2020-10-16 01:20:31,923 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbf59a6f9/acff81c2602540ac8ec98c37eebe2329 [2020-10-16 01:20:31,931 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 01:20:31,933 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 01:20:31,934 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 01:20:31,934 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 01:20:31,937 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 01:20:31,938 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:20:31" (1/1) ... [2020-10-16 01:20:31,942 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b7b52f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:20:31, skipping insertion in model container [2020-10-16 01:20:31,943 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:20:31" (1/1) ... [2020-10-16 01:20:31,951 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 01:20:32,011 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 01:20:32,500 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:20:32,519 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 01:20:32,620 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:20:32,710 INFO L208 MainTranslator]: Completed translation [2020-10-16 01:20:32,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:20:32 WrapperNode [2020-10-16 01:20:32,711 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 01:20:32,712 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 01:20:32,712 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 01:20:32,712 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 01:20:32,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:20:32" (1/1) ... [2020-10-16 01:20:32,739 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:20:32" (1/1) ... [2020-10-16 01:20:32,772 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 01:20:32,773 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 01:20:32,773 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 01:20:32,773 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 01:20:32,783 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:20:32" (1/1) ... [2020-10-16 01:20:32,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:20:32" (1/1) ... [2020-10-16 01:20:32,787 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:20:32" (1/1) ... [2020-10-16 01:20:32,788 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:20:32" (1/1) ... [2020-10-16 01:20:32,805 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:20:32" (1/1) ... [2020-10-16 01:20:32,813 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:20:32" (1/1) ... [2020-10-16 01:20:32,816 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:20:32" (1/1) ... [2020-10-16 01:20:32,822 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 01:20:32,827 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 01:20:32,827 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 01:20:32,828 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 01:20:32,828 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:20:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:20:32,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 01:20:32,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 01:20:32,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 01:20:32,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 01:20:32,896 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 01:20:32,896 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 01:20:32,896 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 01:20:32,897 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 01:20:32,897 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 01:20:32,897 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 01:20:32,897 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 01:20:32,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 01:20:32,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 01:20:32,899 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 01:20:34,921 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 01:20:34,921 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 01:20:34,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:20:34 BoogieIcfgContainer [2020-10-16 01:20:34,924 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 01:20:34,925 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 01:20:34,925 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 01:20:34,929 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 01:20:34,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:20:31" (1/3) ... [2020-10-16 01:20:34,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40805183 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:20:34, skipping insertion in model container [2020-10-16 01:20:34,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:20:32" (2/3) ... [2020-10-16 01:20:34,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40805183 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:20:34, skipping insertion in model container [2020-10-16 01:20:34,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:20:34" (3/3) ... [2020-10-16 01:20:34,932 INFO L111 eAbstractionObserver]: Analyzing ICFG mix024_pso.oepc.i [2020-10-16 01:20:34,943 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 01:20:34,950 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 01:20:34,951 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 01:20:34,981 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,981 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,981 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,981 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,982 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,982 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,982 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,983 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,983 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,983 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,983 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,984 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,984 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,984 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,984 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,985 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,985 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,986 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,986 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,986 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,986 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,987 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,987 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,987 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,987 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,988 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,988 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,988 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,988 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,989 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,989 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,989 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,990 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,990 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,994 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,997 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,997 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,997 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,997 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,999 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,999 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,999 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:34,999 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,000 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,001 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,005 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,005 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,005 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,005 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,006 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,006 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,006 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,006 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,007 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,007 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,011 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,012 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,012 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,012 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,012 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,013 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,013 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,013 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,013 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,013 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,014 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,014 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,014 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,014 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,015 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,015 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,015 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,015 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,016 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,016 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,016 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,016 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,016 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,017 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,017 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,017 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,017 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,018 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,018 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,018 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,020 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,020 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,020 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,021 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,021 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,021 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,021 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,022 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,022 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,022 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,022 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,023 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:20:35,039 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 01:20:35,060 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 01:20:35,060 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 01:20:35,060 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 01:20:35,060 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 01:20:35,061 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 01:20:35,061 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 01:20:35,061 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 01:20:35,061 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 01:20:35,075 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 107 places, 99 transitions, 213 flow [2020-10-16 01:20:35,125 INFO L129 PetriNetUnfolder]: 2/96 cut-off events. [2020-10-16 01:20:35,125 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:20:35,131 INFO L80 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2020-10-16 01:20:35,131 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 99 transitions, 213 flow [2020-10-16 01:20:35,138 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 96 transitions, 201 flow [2020-10-16 01:20:35,143 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 01:20:35,146 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 96 transitions, 201 flow [2020-10-16 01:20:35,184 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 96 transitions, 201 flow [2020-10-16 01:20:35,185 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 104 places, 96 transitions, 201 flow [2020-10-16 01:20:35,208 INFO L129 PetriNetUnfolder]: 2/96 cut-off events. [2020-10-16 01:20:35,209 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:20:35,210 INFO L80 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2020-10-16 01:20:35,213 INFO L117 LiptonReduction]: Number of co-enabled transitions 1928 [2020-10-16 01:20:35,445 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:20:35,445 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:20:35,447 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:35,447 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:20:35,451 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:35,451 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:20:35,455 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:20:35,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:20:35,477 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:35,478 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:20:35,479 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:35,479 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:20:35,482 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:35,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:20:35,486 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:20:35,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:20:35,563 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:20:35,563 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:20:35,971 WARN L193 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 01:20:36,085 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:36,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:20:36,088 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:36,089 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:20:36,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:36,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:20:36,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:20:36,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:20:36,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:36,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:20:36,125 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:36,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:20:36,128 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:36,128 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:20:36,131 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:20:36,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:20:36,505 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:36,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:20:36,506 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:36,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:20:36,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:36,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:20:36,511 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:20:36,511 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:20:36,526 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:36,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:20:36,528 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:36,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:20:36,530 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:36,530 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:20:36,532 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:20:36,533 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:20:36,598 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:20:36,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:20:36,599 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:36,600 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:20:36,602 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:36,602 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:20:36,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:20:36,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:20:36,623 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:36,623 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:20:36,624 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:36,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:20:36,626 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:36,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:20:36,629 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:20:36,629 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:20:36,790 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:20:36,791 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:20:36,795 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:20:36,795 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:20:36,843 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:20:36,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:20:36,845 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:20:36,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:20:36,847 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:20:36,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:20:36,848 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:20:36,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:20:36,850 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:20:36,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:20:36,853 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 01:20:36,853 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:20:36,855 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 01:20:36,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:20:36,941 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:20:36,941 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:20:36,943 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:36,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:20:36,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:36,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:20:36,949 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:20:36,949 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:20:36,971 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:20:36,971 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:20:36,972 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:36,973 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:20:36,975 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:36,976 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:20:36,979 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:20:36,979 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:20:37,470 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:20:37,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:20:37,472 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:37,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:20:37,474 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:37,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:20:37,476 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:20:37,476 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:20:37,490 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:20:37,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:20:37,492 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:37,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:20:37,494 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:37,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:20:37,496 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:20:37,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:20:37,598 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:37,598 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:20:37,600 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:20:37,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:20:37,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:20:37,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:20:37,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:20:37,605 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:20:37,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:20:37,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:20:37,608 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 01:20:37,609 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:20:37,611 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 01:20:37,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:20:37,652 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:20:37,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:20:37,655 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:20:37,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:20:37,685 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:20:37,686 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:20:37,686 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:37,687 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:20:37,689 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:37,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:20:37,691 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:20:37,691 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:20:37,733 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:20:37,733 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:20:37,734 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:37,734 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:20:37,736 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:37,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:20:37,737 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:20:37,738 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:20:37,848 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:20:37,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:20:37,849 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:37,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:20:37,851 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:37,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:20:37,853 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:20:37,853 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:20:37,865 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:20:37,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:20:37,866 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:37,867 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:20:37,869 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:37,870 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:20:37,872 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:20:37,872 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:20:37,939 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:37,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:20:37,940 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:37,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:20:37,942 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:37,942 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:20:37,943 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:20:37,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:20:37,954 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:37,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:20:37,955 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:37,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:20:37,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:37,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:20:37,959 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:20:37,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:20:38,011 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:20:38,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:20:38,276 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:38,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:20:38,278 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:38,278 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:20:38,279 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:38,280 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:20:38,281 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:20:38,281 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:20:38,291 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:20:38,292 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:20:38,292 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:38,293 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:20:38,294 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:20:38,294 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:20:38,295 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:20:38,296 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:20:39,234 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2020-10-16 01:20:39,347 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-16 01:20:39,366 INFO L132 LiptonReduction]: Checked pairs total: 6007 [2020-10-16 01:20:39,366 INFO L134 LiptonReduction]: Total number of compositions: 83 [2020-10-16 01:20:39,369 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4231 [2020-10-16 01:20:39,374 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2020-10-16 01:20:39,374 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:20:39,374 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:20:39,375 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2020-10-16 01:20:39,375 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 01:20:39,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:20:39,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1063883, now seen corresponding path program 1 times [2020-10-16 01:20:39,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:20:39,391 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097067714] [2020-10-16 01:20:39,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:20:39,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:20:39,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:20:39,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097067714] [2020-10-16 01:20:39,583 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:20:39,584 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:20:39,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582091768] [2020-10-16 01:20:39,594 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:20:39,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:20:39,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:20:39,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:20:39,613 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 182 [2020-10-16 01:20:39,615 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states. [2020-10-16 01:20:39,615 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:20:39,615 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 182 [2020-10-16 01:20:39,617 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:20:39,709 INFO L129 PetriNetUnfolder]: 49/144 cut-off events. [2020-10-16 01:20:39,709 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:20:39,710 INFO L80 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 144 events. 49/144 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 669 event pairs, 9 based on Foata normal form. 17/152 useless extension candidates. Maximal degree in co-relation 230. Up to 65 conditions per place. [2020-10-16 01:20:39,712 INFO L132 encePairwiseOnDemand]: 178/182 looper letters, 9 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2020-10-16 01:20:39,713 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 28 transitions, 87 flow [2020-10-16 01:20:39,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:20:39,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:20:39,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2020-10-16 01:20:39,730 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8553113553113553 [2020-10-16 01:20:39,731 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 467 transitions. [2020-10-16 01:20:39,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 467 transitions. [2020-10-16 01:20:39,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:20:39,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 467 transitions. [2020-10-16 01:20:39,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:20:39,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:20:39,748 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:20:39,750 INFO L185 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 467 transitions. [2020-10-16 01:20:39,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 28 transitions, 87 flow [2020-10-16 01:20:39,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 28 transitions, 84 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-16 01:20:39,756 INFO L241 Difference]: Finished difference. Result has 33 places, 24 transitions, 58 flow [2020-10-16 01:20:39,758 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=54, 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=58, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2020-10-16 01:20:39,759 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2020-10-16 01:20:39,760 INFO L481 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 58 flow [2020-10-16 01:20:39,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:20:39,760 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:20:39,760 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:20:39,760 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 01:20:39,760 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 01:20:39,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:20:39,761 INFO L82 PathProgramCache]: Analyzing trace with hash 186072963, now seen corresponding path program 1 times [2020-10-16 01:20:39,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:20:39,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684852270] [2020-10-16 01:20:39,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:20:39,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:20:39,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:20:39,880 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684852270] [2020-10-16 01:20:39,880 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:20:39,880 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:20:39,881 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34167459] [2020-10-16 01:20:39,882 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:20:39,882 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:20:39,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:20:39,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:20:39,884 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 182 [2020-10-16 01:20:39,885 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 58 flow. Second operand 3 states. [2020-10-16 01:20:39,885 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:20:39,885 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 182 [2020-10-16 01:20:39,885 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:20:39,900 INFO L129 PetriNetUnfolder]: 1/26 cut-off events. [2020-10-16 01:20:39,900 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:20:39,900 INFO L80 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 26 events. 1/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 34. Up to 5 conditions per place. [2020-10-16 01:20:39,900 INFO L132 encePairwiseOnDemand]: 179/182 looper letters, 1 selfloop transitions, 2 changer transitions 2/25 dead transitions. [2020-10-16 01:20:39,901 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 25 transitions, 70 flow [2020-10-16 01:20:39,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:20:39,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:20:39,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 477 transitions. [2020-10-16 01:20:39,903 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8736263736263736 [2020-10-16 01:20:39,903 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 477 transitions. [2020-10-16 01:20:39,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 477 transitions. [2020-10-16 01:20:39,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:20:39,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 477 transitions. [2020-10-16 01:20:39,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:20:39,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:20:39,907 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:20:39,907 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 58 flow. Second operand 3 states and 477 transitions. [2020-10-16 01:20:39,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 25 transitions, 70 flow [2020-10-16 01:20:39,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 66 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:20:39,908 INFO L241 Difference]: Finished difference. Result has 34 places, 23 transitions, 60 flow [2020-10-16 01:20:39,908 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=54, 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=60, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2020-10-16 01:20:39,909 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2020-10-16 01:20:39,909 INFO L481 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 60 flow [2020-10-16 01:20:39,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:20:39,909 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:20:39,910 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:20:39,910 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 01:20:39,910 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 01:20:39,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:20:39,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1628191181, now seen corresponding path program 1 times [2020-10-16 01:20:39,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:20:39,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273309279] [2020-10-16 01:20:39,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:20:39,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:20:39,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:20:39,961 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273309279] [2020-10-16 01:20:39,961 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:20:39,961 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:20:39,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803461069] [2020-10-16 01:20:39,962 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:20:39,962 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:20:39,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:20:39,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:20:39,964 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 182 [2020-10-16 01:20:39,964 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 60 flow. Second operand 3 states. [2020-10-16 01:20:39,965 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:20:39,965 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 182 [2020-10-16 01:20:39,965 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:20:39,976 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2020-10-16 01:20:39,976 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-10-16 01:20:39,977 INFO L80 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 23 events. 0/23 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 1/24 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2020-10-16 01:20:39,977 INFO L132 encePairwiseOnDemand]: 179/182 looper letters, 1 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2020-10-16 01:20:39,977 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 23 transitions, 66 flow [2020-10-16 01:20:39,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:20:39,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:20:39,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 478 transitions. [2020-10-16 01:20:39,979 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8754578754578755 [2020-10-16 01:20:39,979 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 478 transitions. [2020-10-16 01:20:39,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 478 transitions. [2020-10-16 01:20:39,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:20:39,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 478 transitions. [2020-10-16 01:20:39,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:20:39,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:20:39,982 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:20:39,982 INFO L185 Difference]: Start difference. First operand has 34 places, 23 transitions, 60 flow. Second operand 3 states and 478 transitions. [2020-10-16 01:20:39,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 23 transitions, 66 flow [2020-10-16 01:20:39,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 23 transitions, 62 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:20:39,984 INFO L241 Difference]: Finished difference. Result has 34 places, 23 transitions, 64 flow [2020-10-16 01:20:39,984 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, 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=64, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2020-10-16 01:20:39,984 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2020-10-16 01:20:39,984 INFO L481 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 64 flow [2020-10-16 01:20:39,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:20:39,985 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:20:39,985 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:20:39,985 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 01:20:39,985 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 01:20:39,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:20:39,985 INFO L82 PathProgramCache]: Analyzing trace with hash 658647039, now seen corresponding path program 1 times [2020-10-16 01:20:39,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:20:39,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751013588] [2020-10-16 01:20:39,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:20:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:20:40,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:20:40,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751013588] [2020-10-16 01:20:40,071 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:20:40,071 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:20:40,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434074363] [2020-10-16 01:20:40,072 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:20:40,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:20:40,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:20:40,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:20:40,075 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 182 [2020-10-16 01:20:40,075 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 64 flow. Second operand 4 states. [2020-10-16 01:20:40,075 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:20:40,075 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 182 [2020-10-16 01:20:40,076 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:20:40,125 INFO L129 PetriNetUnfolder]: 28/81 cut-off events. [2020-10-16 01:20:40,125 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-10-16 01:20:40,126 INFO L80 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 81 events. 28/81 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 287 event pairs, 12 based on Foata normal form. 8/88 useless extension candidates. Maximal degree in co-relation 157. Up to 45 conditions per place. [2020-10-16 01:20:40,126 INFO L132 encePairwiseOnDemand]: 176/182 looper letters, 5 selfloop transitions, 4 changer transitions 7/33 dead transitions. [2020-10-16 01:20:40,127 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 33 transitions, 116 flow [2020-10-16 01:20:40,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:20:40,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:20:40,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 753 transitions. [2020-10-16 01:20:40,130 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8274725274725274 [2020-10-16 01:20:40,130 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 753 transitions. [2020-10-16 01:20:40,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 753 transitions. [2020-10-16 01:20:40,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:20:40,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 753 transitions. [2020-10-16 01:20:40,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:20:40,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:20:40,134 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:20:40,134 INFO L185 Difference]: Start difference. First operand has 34 places, 23 transitions, 64 flow. Second operand 5 states and 753 transitions. [2020-10-16 01:20:40,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 33 transitions, 116 flow [2020-10-16 01:20:40,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 33 transitions, 112 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:20:40,136 INFO L241 Difference]: Finished difference. Result has 39 places, 26 transitions, 96 flow [2020-10-16 01:20:40,136 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=96, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2020-10-16 01:20:40,136 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2020-10-16 01:20:40,136 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 96 flow [2020-10-16 01:20:40,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:20:40,136 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:20:40,137 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:20:40,137 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 01:20:40,137 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 01:20:40,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:20:40,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1273396643, now seen corresponding path program 1 times [2020-10-16 01:20:40,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:20:40,138 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789175402] [2020-10-16 01:20:40,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:20:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:20:40,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:20:40,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789175402] [2020-10-16 01:20:40,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:20:40,232 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:20:40,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737608070] [2020-10-16 01:20:40,232 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:20:40,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:20:40,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:20:40,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:20:40,235 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 182 [2020-10-16 01:20:40,235 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 96 flow. Second operand 5 states. [2020-10-16 01:20:40,235 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:20:40,235 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 182 [2020-10-16 01:20:40,235 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:20:40,295 INFO L129 PetriNetUnfolder]: 16/59 cut-off events. [2020-10-16 01:20:40,295 INFO L130 PetriNetUnfolder]: For 42/50 co-relation queries the response was YES. [2020-10-16 01:20:40,296 INFO L80 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 59 events. 16/59 cut-off events. For 42/50 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 157 event pairs, 2 based on Foata normal form. 11/69 useless extension candidates. Maximal degree in co-relation 178. Up to 35 conditions per place. [2020-10-16 01:20:40,296 INFO L132 encePairwiseOnDemand]: 176/182 looper letters, 5 selfloop transitions, 7 changer transitions 7/36 dead transitions. [2020-10-16 01:20:40,296 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 36 transitions, 192 flow [2020-10-16 01:20:40,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:20:40,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:20:40,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 903 transitions. [2020-10-16 01:20:40,300 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8269230769230769 [2020-10-16 01:20:40,300 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 903 transitions. [2020-10-16 01:20:40,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 903 transitions. [2020-10-16 01:20:40,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:20:40,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 903 transitions. [2020-10-16 01:20:40,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:20:40,304 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:20:40,304 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:20:40,305 INFO L185 Difference]: Start difference. First operand has 39 places, 26 transitions, 96 flow. Second operand 6 states and 903 transitions. [2020-10-16 01:20:40,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 36 transitions, 192 flow [2020-10-16 01:20:40,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 36 transitions, 186 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 01:20:40,307 INFO L241 Difference]: Finished difference. Result has 43 places, 29 transitions, 146 flow [2020-10-16 01:20:40,307 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=146, PETRI_PLACES=43, PETRI_TRANSITIONS=29} [2020-10-16 01:20:40,308 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 8 predicate places. [2020-10-16 01:20:40,308 INFO L481 AbstractCegarLoop]: Abstraction has has 43 places, 29 transitions, 146 flow [2020-10-16 01:20:40,308 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:20:40,308 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:20:40,308 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:20:40,309 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 01:20:40,309 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 01:20:40,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:20:40,309 INFO L82 PathProgramCache]: Analyzing trace with hash 420261703, now seen corresponding path program 1 times [2020-10-16 01:20:40,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:20:40,310 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822647270] [2020-10-16 01:20:40,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:20:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:20:40,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:20:40,430 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822647270] [2020-10-16 01:20:40,430 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:20:40,430 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:20:40,430 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077293489] [2020-10-16 01:20:40,431 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:20:40,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:20:40,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:20:40,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:20:40,433 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 182 [2020-10-16 01:20:40,434 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 29 transitions, 146 flow. Second operand 6 states. [2020-10-16 01:20:40,434 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:20:40,434 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 182 [2020-10-16 01:20:40,434 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:20:40,507 INFO L129 PetriNetUnfolder]: 7/38 cut-off events. [2020-10-16 01:20:40,508 INFO L130 PetriNetUnfolder]: For 67/83 co-relation queries the response was YES. [2020-10-16 01:20:40,508 INFO L80 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 38 events. 7/38 cut-off events. For 67/83 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 57 event pairs, 0 based on Foata normal form. 12/49 useless extension candidates. Maximal degree in co-relation 129. Up to 20 conditions per place. [2020-10-16 01:20:40,509 INFO L132 encePairwiseOnDemand]: 176/182 looper letters, 2 selfloop transitions, 10 changer transitions 4/33 dead transitions. [2020-10-16 01:20:40,509 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 33 transitions, 214 flow [2020-10-16 01:20:40,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:20:40,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:20:40,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1047 transitions. [2020-10-16 01:20:40,515 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8218210361067504 [2020-10-16 01:20:40,515 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1047 transitions. [2020-10-16 01:20:40,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1047 transitions. [2020-10-16 01:20:40,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:20:40,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1047 transitions. [2020-10-16 01:20:40,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:20:40,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:20:40,522 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:20:40,522 INFO L185 Difference]: Start difference. First operand has 43 places, 29 transitions, 146 flow. Second operand 7 states and 1047 transitions. [2020-10-16 01:20:40,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 33 transitions, 214 flow [2020-10-16 01:20:40,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 33 transitions, 170 flow, removed 16 selfloop flow, removed 6 redundant places. [2020-10-16 01:20:40,525 INFO L241 Difference]: Finished difference. Result has 44 places, 29 transitions, 140 flow [2020-10-16 01:20:40,526 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=140, PETRI_PLACES=44, PETRI_TRANSITIONS=29} [2020-10-16 01:20:40,526 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 9 predicate places. [2020-10-16 01:20:40,526 INFO L481 AbstractCegarLoop]: Abstraction has has 44 places, 29 transitions, 140 flow [2020-10-16 01:20:40,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:20:40,526 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:20:40,526 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, 1] [2020-10-16 01:20:40,527 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 01:20:40,527 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 01:20:40,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:20:40,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1211045565, now seen corresponding path program 1 times [2020-10-16 01:20:40,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:20:40,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827964357] [2020-10-16 01:20:40,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:20:40,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:20:40,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:20:40,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827964357] [2020-10-16 01:20:40,610 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:20:40,610 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:20:40,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823046214] [2020-10-16 01:20:40,611 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:20:40,612 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:20:40,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:20:40,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:20:40,615 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 182 [2020-10-16 01:20:40,616 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 29 transitions, 140 flow. Second operand 3 states. [2020-10-16 01:20:40,616 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:20:40,616 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 182 [2020-10-16 01:20:40,617 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:20:40,649 INFO L129 PetriNetUnfolder]: 12/57 cut-off events. [2020-10-16 01:20:40,650 INFO L130 PetriNetUnfolder]: For 70/72 co-relation queries the response was YES. [2020-10-16 01:20:40,650 INFO L80 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 57 events. 12/57 cut-off events. For 70/72 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 149 event pairs, 0 based on Foata normal form. 1/57 useless extension candidates. Maximal degree in co-relation 156. Up to 23 conditions per place. [2020-10-16 01:20:40,652 INFO L132 encePairwiseOnDemand]: 179/182 looper letters, 3 selfloop transitions, 2 changer transitions 2/31 dead transitions. [2020-10-16 01:20:40,652 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 31 transitions, 158 flow [2020-10-16 01:20:40,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:20:40,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:20:40,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2020-10-16 01:20:40,655 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8608058608058609 [2020-10-16 01:20:40,655 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 470 transitions. [2020-10-16 01:20:40,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 470 transitions. [2020-10-16 01:20:40,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:20:40,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 470 transitions. [2020-10-16 01:20:40,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:20:40,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:20:40,658 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:20:40,658 INFO L185 Difference]: Start difference. First operand has 44 places, 29 transitions, 140 flow. Second operand 3 states and 470 transitions. [2020-10-16 01:20:40,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 31 transitions, 158 flow [2020-10-16 01:20:40,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 31 transitions, 120 flow, removed 12 selfloop flow, removed 6 redundant places. [2020-10-16 01:20:40,664 INFO L241 Difference]: Finished difference. Result has 39 places, 29 transitions, 110 flow [2020-10-16 01:20:40,664 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2020-10-16 01:20:40,664 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2020-10-16 01:20:40,664 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 110 flow [2020-10-16 01:20:40,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:20:40,665 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:20:40,665 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, 1] [2020-10-16 01:20:40,665 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 01:20:40,667 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 01:20:40,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:20:40,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1078099749, now seen corresponding path program 2 times [2020-10-16 01:20:40,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:20:40,668 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805097567] [2020-10-16 01:20:40,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:20:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:20:40,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:20:40,786 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805097567] [2020-10-16 01:20:40,786 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:20:40,786 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:20:40,787 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824095183] [2020-10-16 01:20:40,787 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:20:40,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:20:40,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:20:40,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:20:40,789 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 182 [2020-10-16 01:20:40,790 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 110 flow. Second operand 4 states. [2020-10-16 01:20:40,790 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:20:40,790 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 182 [2020-10-16 01:20:40,790 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:20:40,813 INFO L129 PetriNetUnfolder]: 10/55 cut-off events. [2020-10-16 01:20:40,813 INFO L130 PetriNetUnfolder]: For 28/29 co-relation queries the response was YES. [2020-10-16 01:20:40,813 INFO L80 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 55 events. 10/55 cut-off events. For 28/29 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 139 event pairs, 0 based on Foata normal form. 1/54 useless extension candidates. Maximal degree in co-relation 117. Up to 15 conditions per place. [2020-10-16 01:20:40,814 INFO L132 encePairwiseOnDemand]: 179/182 looper letters, 3 selfloop transitions, 1 changer transitions 1/30 dead transitions. [2020-10-16 01:20:40,814 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 30 transitions, 122 flow [2020-10-16 01:20:40,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:20:40,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:20:40,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 602 transitions. [2020-10-16 01:20:40,817 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8269230769230769 [2020-10-16 01:20:40,817 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 602 transitions. [2020-10-16 01:20:40,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 602 transitions. [2020-10-16 01:20:40,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:20:40,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 602 transitions. [2020-10-16 01:20:40,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:20:40,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:20:40,820 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:20:40,820 INFO L185 Difference]: Start difference. First operand has 39 places, 29 transitions, 110 flow. Second operand 4 states and 602 transitions. [2020-10-16 01:20:40,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 30 transitions, 122 flow [2020-10-16 01:20:40,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 116 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 01:20:40,822 INFO L241 Difference]: Finished difference. Result has 42 places, 29 transitions, 111 flow [2020-10-16 01:20:40,822 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2020-10-16 01:20:40,823 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2020-10-16 01:20:40,823 INFO L481 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 111 flow [2020-10-16 01:20:40,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:20:40,823 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:20:40,823 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, 1] [2020-10-16 01:20:40,823 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 01:20:40,825 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 01:20:40,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:20:40,825 INFO L82 PathProgramCache]: Analyzing trace with hash 289015485, now seen corresponding path program 3 times [2020-10-16 01:20:40,826 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:20:40,827 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643250410] [2020-10-16 01:20:40,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:20:40,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:20:41,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:20:41,002 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643250410] [2020-10-16 01:20:41,003 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:20:41,003 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:20:41,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048900175] [2020-10-16 01:20:41,003 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:20:41,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:20:41,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:20:41,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:20:41,006 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 182 [2020-10-16 01:20:41,006 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 111 flow. Second operand 5 states. [2020-10-16 01:20:41,006 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:20:41,006 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 182 [2020-10-16 01:20:41,007 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:20:41,159 INFO L129 PetriNetUnfolder]: 33/122 cut-off events. [2020-10-16 01:20:41,160 INFO L130 PetriNetUnfolder]: For 49/50 co-relation queries the response was YES. [2020-10-16 01:20:41,160 INFO L80 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 122 events. 33/122 cut-off events. For 49/50 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 454 event pairs, 6 based on Foata normal form. 1/117 useless extension candidates. Maximal degree in co-relation 279. Up to 41 conditions per place. [2020-10-16 01:20:41,161 INFO L132 encePairwiseOnDemand]: 176/182 looper letters, 7 selfloop transitions, 5 changer transitions 7/40 dead transitions. [2020-10-16 01:20:41,161 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 40 transitions, 171 flow [2020-10-16 01:20:41,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:20:41,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:20:41,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 806 transitions. [2020-10-16 01:20:41,165 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7380952380952381 [2020-10-16 01:20:41,165 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 806 transitions. [2020-10-16 01:20:41,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 806 transitions. [2020-10-16 01:20:41,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:20:41,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 806 transitions. [2020-10-16 01:20:41,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:20:41,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:20:41,170 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:20:41,170 INFO L185 Difference]: Start difference. First operand has 42 places, 29 transitions, 111 flow. Second operand 6 states and 806 transitions. [2020-10-16 01:20:41,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 40 transitions, 171 flow [2020-10-16 01:20:41,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 40 transitions, 168 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 01:20:41,173 INFO L241 Difference]: Finished difference. Result has 48 places, 33 transitions, 146 flow [2020-10-16 01:20:41,173 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=146, PETRI_PLACES=48, PETRI_TRANSITIONS=33} [2020-10-16 01:20:41,173 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 13 predicate places. [2020-10-16 01:20:41,173 INFO L481 AbstractCegarLoop]: Abstraction has has 48 places, 33 transitions, 146 flow [2020-10-16 01:20:41,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:20:41,174 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:20:41,174 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, 1] [2020-10-16 01:20:41,174 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 01:20:41,174 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 01:20:41,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:20:41,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1965199813, now seen corresponding path program 4 times [2020-10-16 01:20:41,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:20:41,175 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700727491] [2020-10-16 01:20:41,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:20:41,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:20:41,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:20:41,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700727491] [2020-10-16 01:20:41,568 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:20:41,568 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-16 01:20:41,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553786484] [2020-10-16 01:20:41,569 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-16 01:20:41,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:20:41,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-16 01:20:41,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-10-16 01:20:41,572 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 182 [2020-10-16 01:20:41,572 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 33 transitions, 146 flow. Second operand 11 states. [2020-10-16 01:20:41,573 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:20:41,573 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 182 [2020-10-16 01:20:41,573 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:20:42,070 INFO L129 PetriNetUnfolder]: 77/198 cut-off events. [2020-10-16 01:20:42,070 INFO L130 PetriNetUnfolder]: For 261/341 co-relation queries the response was YES. [2020-10-16 01:20:42,071 INFO L80 FinitePrefix]: Finished finitePrefix Result has 701 conditions, 198 events. 77/198 cut-off events. For 261/341 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 758 event pairs, 18 based on Foata normal form. 13/202 useless extension candidates. Maximal degree in co-relation 687. Up to 120 conditions per place. [2020-10-16 01:20:42,072 INFO L132 encePairwiseOnDemand]: 173/182 looper letters, 18 selfloop transitions, 9 changer transitions 36/74 dead transitions. [2020-10-16 01:20:42,072 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 74 transitions, 496 flow [2020-10-16 01:20:42,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-16 01:20:42,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-16 01:20:42,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1353 transitions. [2020-10-16 01:20:42,077 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6195054945054945 [2020-10-16 01:20:42,078 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1353 transitions. [2020-10-16 01:20:42,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1353 transitions. [2020-10-16 01:20:42,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:20:42,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1353 transitions. [2020-10-16 01:20:42,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-16 01:20:42,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-16 01:20:42,085 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-16 01:20:42,085 INFO L185 Difference]: Start difference. First operand has 48 places, 33 transitions, 146 flow. Second operand 12 states and 1353 transitions. [2020-10-16 01:20:42,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 74 transitions, 496 flow [2020-10-16 01:20:42,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 74 transitions, 480 flow, removed 8 selfloop flow, removed 2 redundant places. [2020-10-16 01:20:42,090 INFO L241 Difference]: Finished difference. Result has 65 places, 37 transitions, 245 flow [2020-10-16 01:20:42,090 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=245, PETRI_PLACES=65, PETRI_TRANSITIONS=37} [2020-10-16 01:20:42,090 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 30 predicate places. [2020-10-16 01:20:42,090 INFO L481 AbstractCegarLoop]: Abstraction has has 65 places, 37 transitions, 245 flow [2020-10-16 01:20:42,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-16 01:20:42,090 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:20:42,091 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, 1] [2020-10-16 01:20:42,091 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 01:20:42,091 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:20:42,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:20:42,091 INFO L82 PathProgramCache]: Analyzing trace with hash 2024442951, now seen corresponding path program 5 times [2020-10-16 01:20:42,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:20:42,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009850442] [2020-10-16 01:20:42,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:20:42,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:20:42,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:20:42,249 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009850442] [2020-10-16 01:20:42,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:20:42,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:20:42,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209883240] [2020-10-16 01:20:42,251 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:20:42,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:20:42,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:20:42,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:20:42,253 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 182 [2020-10-16 01:20:42,254 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 37 transitions, 245 flow. Second operand 7 states. [2020-10-16 01:20:42,254 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:20:42,254 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 182 [2020-10-16 01:20:42,255 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:20:42,415 INFO L129 PetriNetUnfolder]: 30/113 cut-off events. [2020-10-16 01:20:42,416 INFO L130 PetriNetUnfolder]: For 489/561 co-relation queries the response was YES. [2020-10-16 01:20:42,416 INFO L80 FinitePrefix]: Finished finitePrefix Result has 492 conditions, 113 events. 30/113 cut-off events. For 489/561 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 420 event pairs, 10 based on Foata normal form. 14/119 useless extension candidates. Maximal degree in co-relation 468. Up to 36 conditions per place. [2020-10-16 01:20:42,417 INFO L132 encePairwiseOnDemand]: 176/182 looper letters, 6 selfloop transitions, 4 changer transitions 12/43 dead transitions. [2020-10-16 01:20:42,417 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 43 transitions, 315 flow [2020-10-16 01:20:42,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:20:42,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:20:42,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 763 transitions. [2020-10-16 01:20:42,422 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6987179487179487 [2020-10-16 01:20:42,422 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 763 transitions. [2020-10-16 01:20:42,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 763 transitions. [2020-10-16 01:20:42,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:20:42,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 763 transitions. [2020-10-16 01:20:42,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:20:42,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:20:42,430 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:20:42,430 INFO L185 Difference]: Start difference. First operand has 65 places, 37 transitions, 245 flow. Second operand 6 states and 763 transitions. [2020-10-16 01:20:42,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 43 transitions, 315 flow [2020-10-16 01:20:42,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 43 transitions, 276 flow, removed 14 selfloop flow, removed 9 redundant places. [2020-10-16 01:20:42,439 INFO L241 Difference]: Finished difference. Result has 57 places, 31 transitions, 168 flow [2020-10-16 01:20:42,439 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=168, PETRI_PLACES=57, PETRI_TRANSITIONS=31} [2020-10-16 01:20:42,439 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 22 predicate places. [2020-10-16 01:20:42,439 INFO L481 AbstractCegarLoop]: Abstraction has has 57 places, 31 transitions, 168 flow [2020-10-16 01:20:42,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:20:42,440 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:20:42,440 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, 1] [2020-10-16 01:20:42,440 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 01:20:42,440 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:20:42,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:20:42,440 INFO L82 PathProgramCache]: Analyzing trace with hash -294993223, now seen corresponding path program 6 times [2020-10-16 01:20:42,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:20:42,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593367207] [2020-10-16 01:20:42,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:20:42,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:20:42,506 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:20:42,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:20:42,558 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:20:42,608 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 01:20:42,608 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 01:20:42,608 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 01:20:42,610 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 01:20:42,625 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L2-->L853: Formula: (let ((.cse7 (= (mod ~a$r_buff1_thd0~0_In-416145036 256) 0)) (.cse6 (= (mod ~a$w_buff1_used~0_In-416145036 256) 0)) (.cse9 (= (mod ~a$r_buff0_thd0~0_In-416145036 256) 0)) (.cse8 (= (mod ~a$w_buff0_used~0_In-416145036 256) 0))) (let ((.cse4 (not .cse8)) (.cse5 (not .cse9)) (.cse3 (or .cse8 .cse9)) (.cse0 (or .cse7 .cse6)) (.cse1 (not .cse7)) (.cse2 (not .cse6))) (and (not (= 0 ULTIMATE.start_assume_abort_if_not_~cond_Out-416145036)) (or (and (or (and .cse0 (= ~a~0_In-416145036 ~a~0_Out-416145036)) (and (= ~a~0_Out-416145036 ~a$w_buff1~0_In-416145036) .cse1 .cse2)) .cse3) (and .cse4 .cse5 (= ~a~0_Out-416145036 ~a$w_buff0~0_In-416145036))) (= ~a$r_buff0_thd0~0_In-416145036 ~a$r_buff0_thd0~0_Out-416145036) (or (and .cse4 .cse5 (= ~a$w_buff0_used~0_Out-416145036 0)) (and (= ~a$w_buff0_used~0_Out-416145036 ~a$w_buff0_used~0_In-416145036) .cse3)) (or (and (= ~a$w_buff1_used~0_Out-416145036 ~a$w_buff1_used~0_In-416145036) .cse0) (and (= ~a$w_buff1_used~0_Out-416145036 0) .cse1 .cse2)) (= ~a$r_buff1_thd0~0_Out-416145036 ~a$r_buff1_thd0~0_In-416145036) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-416145036 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-416145036|)))) InVars {~a~0=~a~0_In-416145036, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-416145036|, ~a$w_buff1~0=~a$w_buff1~0_In-416145036, ~a$w_buff0~0=~a$w_buff0~0_In-416145036, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-416145036, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-416145036, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-416145036, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-416145036} OutVars{ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-416145036|, ~a$w_buff0_used~0=~a$w_buff0_used~0_Out-416145036, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-416145036|, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-416145036|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_Out-416145036, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-416145036|, ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-416145036|, ~a~0=~a~0_Out-416145036, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-416145036|, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-416145036|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-416145036, ~a$w_buff1~0=~a$w_buff1~0_In-416145036, ~a$w_buff0~0=~a$w_buff0~0_In-416145036, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out-416145036, ~a$w_buff1_used~0=~a$w_buff1_used~0_Out-416145036} 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 01:20:42,634 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:20:42,634 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:20:42,638 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:20:42,661 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:20:42,661 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:20:42,661 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:20:42,661 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:20:42,661 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:20:42,662 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:20:42,662 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:20:42,662 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:20:42,662 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:20:42,663 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:20:42,663 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:20:42,663 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:20:42,663 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:20:42,663 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:20:42,663 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:20:42,663 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:20:42,664 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:20:42,664 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:20:42,664 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:20:42,664 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:20:42,664 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:20:42,664 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:20:42,664 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:20:42,664 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:20:42,664 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:20:42,665 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:20:42,665 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:20:42,665 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:20:42,665 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:20:42,665 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:20:42,665 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:20:42,665 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:20:42,666 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:20:42,666 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:20:42,666 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:20:42,666 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:20:42,666 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:20:42,666 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:20:42,667 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:20:42,667 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:20:42,667 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:20:42,667 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:20:42,667 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:20:42,668 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:20:42,668 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:20:42,668 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:20:42,668 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:20:42,668 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:20:42,668 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:20:42,669 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:20:42,669 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:20:42,669 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:20:42,669 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:20:42,669 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:20:42,669 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:20:42,670 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:20:42,670 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:20:42,670 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:20:42,670 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:20:42,670 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:20:42,670 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:20:42,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:20:42 BasicIcfg [2020-10-16 01:20:42,726 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 01:20:42,727 INFO L168 Benchmark]: Toolchain (without parser) took 10794.50 ms. Allocated memory was 253.2 MB in the beginning and 547.9 MB in the end (delta: 294.6 MB). Free memory was 209.0 MB in the beginning and 502.6 MB in the end (delta: -293.6 MB). Peak memory consumption was 289.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:20:42,728 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 253.2 MB. Free memory is still 229.6 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 01:20:42,729 INFO L168 Benchmark]: CACSL2BoogieTranslator took 777.53 ms. Allocated memory was 253.2 MB in the beginning and 320.3 MB in the end (delta: 67.1 MB). Free memory was 209.0 MB in the beginning and 270.5 MB in the end (delta: -61.5 MB). Peak memory consumption was 33.2 MB. Max. memory is 14.2 GB. [2020-10-16 01:20:42,729 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.93 ms. Allocated memory is still 320.3 MB. Free memory was 270.5 MB in the beginning and 268.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:20:42,730 INFO L168 Benchmark]: Boogie Preprocessor took 49.17 ms. Allocated memory is still 320.3 MB. Free memory was 268.0 MB in the beginning and 265.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:20:42,731 INFO L168 Benchmark]: RCFGBuilder took 2096.97 ms. Allocated memory was 320.3 MB in the beginning and 360.2 MB in the end (delta: 39.8 MB). Free memory was 265.5 MB in the beginning and 188.9 MB in the end (delta: 76.6 MB). Peak memory consumption was 116.4 MB. Max. memory is 14.2 GB. [2020-10-16 01:20:42,732 INFO L168 Benchmark]: TraceAbstraction took 7800.30 ms. Allocated memory was 360.2 MB in the beginning and 547.9 MB in the end (delta: 187.7 MB). Free memory was 188.9 MB in the beginning and 502.6 MB in the end (delta: -313.6 MB). Peak memory consumption was 162.4 MB. Max. memory is 14.2 GB. [2020-10-16 01:20:42,736 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.22 ms. Allocated memory is still 253.2 MB. Free memory is still 229.6 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 777.53 ms. Allocated memory was 253.2 MB in the beginning and 320.3 MB in the end (delta: 67.1 MB). Free memory was 209.0 MB in the beginning and 270.5 MB in the end (delta: -61.5 MB). Peak memory consumption was 33.2 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 60.93 ms. Allocated memory is still 320.3 MB. Free memory was 270.5 MB in the beginning and 268.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 49.17 ms. Allocated memory is still 320.3 MB. Free memory was 268.0 MB in the beginning and 265.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2096.97 ms. Allocated memory was 320.3 MB in the beginning and 360.2 MB in the end (delta: 39.8 MB). Free memory was 265.5 MB in the beginning and 188.9 MB in the end (delta: 76.6 MB). Peak memory consumption was 116.4 MB. Max. memory is 14.2 GB. * TraceAbstraction took 7800.30 ms. Allocated memory was 360.2 MB in the beginning and 547.9 MB in the end (delta: 187.7 MB). Free memory was 188.9 MB in the beginning and 502.6 MB in the end (delta: -313.6 MB). Peak memory consumption was 162.4 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1430 VarBasedMoverChecksPositive, 100 VarBasedMoverChecksNegative, 25 SemBasedMoverChecksPositive, 75 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 203 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.1s, 104 PlacesBefore, 35 PlacesAfterwards, 96 TransitionsBefore, 26 TransitionsAfterwards, 1928 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 83 TotalNumberOfCompositions, 6007 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_p0_EBX = 0; [L704] 0 int __unbuffered_p2_EAX = 0; [L706] 0 int __unbuffered_p2_EBX = 0; [L708] 0 int a = 0; [L709] 0 _Bool a$flush_delayed; [L710] 0 int a$mem_tmp; [L711] 0 _Bool a$r_buff0_thd0; [L712] 0 _Bool a$r_buff0_thd1; [L713] 0 _Bool a$r_buff0_thd2; [L714] 0 _Bool a$r_buff0_thd3; [L715] 0 _Bool a$r_buff1_thd0; [L716] 0 _Bool a$r_buff1_thd1; [L717] 0 _Bool a$r_buff1_thd2; [L718] 0 _Bool a$r_buff1_thd3; [L719] 0 _Bool a$read_delayed; [L720] 0 int *a$read_delayed_var; [L721] 0 int a$w_buff0; [L722] 0 _Bool a$w_buff0_used; [L723] 0 int a$w_buff1; [L724] 0 _Bool a$w_buff1_used; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L837] 0 pthread_t t639; [L838] FCALL, FORK 0 pthread_create(&t639, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L839] 0 pthread_t t640; [L840] FCALL, FORK 0 pthread_create(&t640, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L738] 1 a$w_buff1 = a$w_buff0 [L739] 1 a$w_buff0 = 1 [L740] 1 a$w_buff1_used = a$w_buff0_used [L741] 1 a$w_buff0_used = (_Bool)1 [L7] COND FALSE 1 !(!expression) [L743] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L744] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L745] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L746] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L747] 1 a$r_buff0_thd1 = (_Bool)1 [L750] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=1, y=0, z=0] [L753] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, y=0, z=0] [L756] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, y=0, z=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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] [L776] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1] [L779] 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) [L779] 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) [L780] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L780] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L781] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L781] 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 [L782] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L782] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L783] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L783] 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 [L841] 0 pthread_t t641; [L842] FCALL, FORK 0 pthread_create(&t641, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1] [L793] 3 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, z=2] [L796] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __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=1, z=2] [L799] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L800] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L801] 3 a$flush_delayed = weak$$choice2 [L802] 3 a$mem_tmp = a [L803] 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) [L803] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1 [L803] 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) [L803] 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) [L804] 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)) [L804] EXPR 3 !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) [L804] 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)) [L804] 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)) [L805] 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)) [L805] 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)) [L806] 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)) [L806] EXPR 3 !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) [L806] 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)) [L806] 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)) [L807] 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)) [L807] 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) [L807] 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)) [L807] 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)) [L808] 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)) [L808] 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)) [L809] 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)) [L809] 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) [L809] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0 [L809] 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) [L809] 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)) [L809] 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)) [L810] 3 __unbuffered_p2_EBX = a [L811] EXPR 3 a$flush_delayed ? a$mem_tmp : a [L811] 3 a = a$flush_delayed ? a$mem_tmp : a [L812] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __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=7, weak$$choice2=0, x=1, y=1, z=2] [L759] 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) [L759] EXPR 1 a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a [L759] 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) [L759] 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) [L760] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L760] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L761] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L761] 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 [L762] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L762] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L763] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L763] 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 [L815] 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) [L815] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L815] 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) [L815] 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) [L816] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L816] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L817] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L817] 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 [L818] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L818] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L819] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L819] 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 [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 2 return 0; [L766] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L768] 1 return 0; [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; [L844] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L855] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2 && __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=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __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=7, weak$$choice2=0, x=1, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 98 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: 7.5s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 43 SDtfs, 22 SDslu, 36 SDs, 0 SdLazy, 493 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=245occurred in iteration=10, 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.9s InterpolantComputationTime, 209 NumberOfCodeBlocks, 209 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 175 ConstructedInterpolants, 0 QuantifiedInterpolants, 21453 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...